/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 06:17:01,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:17:01,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:17:01,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:17:01,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:17:01,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:17:01,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:17:01,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:17:01,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:17:01,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:17:01,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:17:01,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:17:01,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:17:01,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:17:01,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:17:01,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:17:01,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:17:01,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:17:01,977 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:17:01,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:17:01,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:17:01,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:17:01,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:17:01,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:17:01,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:17:01,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:17:01,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:17:01,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:17:01,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:17:01,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:17:01,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:17:01,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:17:01,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:17:01,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:17:01,989 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:17:01,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:17:01,990 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:17:01,990 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:17:01,990 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:17:01,991 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:17:01,991 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:17:01,992 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-Before.epf [2022-01-19 06:17:02,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:17:02,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:17:02,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:17:02,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:17:02,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:17:02,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:17:02,007 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:17:02,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:17:02,008 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:17:02,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:17:02,008 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:17:02,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:17:02,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:17:02,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:17:02,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:17:02,009 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:17:02,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:17:02,009 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:17:02,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:17:02,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:17:02,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:17:02,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:17:02,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:17:02,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:17:02,010 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:17:02,011 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 [2022-01-19 06:17:02,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:17:02,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:17:02,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:17:02,223 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:17:02,224 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:17:02,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2022-01-19 06:17:02,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bea942f/65bd4032115240788111e03bd5b2546e/FLAG18bf6a96c [2022-01-19 06:17:02,640 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:17:02,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2022-01-19 06:17:02,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bea942f/65bd4032115240788111e03bd5b2546e/FLAG18bf6a96c [2022-01-19 06:17:02,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2bea942f/65bd4032115240788111e03bd5b2546e [2022-01-19 06:17:03,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:17:03,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:17:03,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:17:03,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:17:03,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:17:03,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a27428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03, skipping insertion in model container [2022-01-19 06:17:03,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:17:03,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:17:03,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2022-01-19 06:17:03,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:17:03,425 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:17:03,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2022-01-19 06:17:03,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:17:03,506 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:17:03,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03 WrapperNode [2022-01-19 06:17:03,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:17:03,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:17:03,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:17:03,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:17:03,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,562 INFO L137 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 189 [2022-01-19 06:17:03,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:17:03,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:17:03,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:17:03,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:17:03,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,588 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:17:03,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:17:03,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:17:03,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:17:03,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (1/1) ... [2022-01-19 06:17:03,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:17:03,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:17:03,638 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 06:17:03,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 06:17:03,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:17:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:17:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:17:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:17:03,671 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 06:17:03,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:17:03,672 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 06:17:03,672 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 06:17:03,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:17:03,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:17:03,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:17:03,674 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 06:17:03,753 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:17:03,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:17:03,925 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:17:03,931 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:17:03,931 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2022-01-19 06:17:03,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:17:03 BoogieIcfgContainer [2022-01-19 06:17:03,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:17:03,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:17:03,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:17:03,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:17:03,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:17:03" (1/3) ... [2022-01-19 06:17:03,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd040c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:17:03, skipping insertion in model container [2022-01-19 06:17:03,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:17:03" (2/3) ... [2022-01-19 06:17:03,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecd040c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:17:03, skipping insertion in model container [2022-01-19 06:17:03,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:17:03" (3/3) ... [2022-01-19 06:17:03,939 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2022-01-19 06:17:03,945 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:17:03,946 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 06:17:03,946 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:17:03,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,984 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,985 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,985 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,986 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,987 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,988 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,988 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,988 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,988 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,988 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,989 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,990 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,991 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,992 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,993 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,994 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,995 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,996 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,997 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,998 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:03,999 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,000 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,001 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,002 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,003 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,004 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,005 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,006 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,007 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,008 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,009 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,011 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,012 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,013 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,014 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:17:04,017 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-01-19 06:17:04,058 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:17:04,062 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:17:04,063 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 06:17:04,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:17:04,124 INFO L129 PetriNetUnfolder]: 45/272 cut-off events. [2022-01-19 06:17:04,125 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:17:04,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 272 events. 45/272 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 838 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2022-01-19 06:17:04,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:17:04,142 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 195 transitions, 395 flow [2022-01-19 06:17:04,158 INFO L129 PetriNetUnfolder]: 15/138 cut-off events. [2022-01-19 06:17:04,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:17:04,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:04,159 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:04,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1575720690, now seen corresponding path program 1 times [2022-01-19 06:17:04,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:04,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905517259] [2022-01-19 06:17:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:04,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:17:04,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:04,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905517259] [2022-01-19 06:17:04,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905517259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:17:04,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:17:04,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:17:04,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231634799] [2022-01-19 06:17:04,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:17:04,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:17:04,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:04,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:17:04,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:17:04,330 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:17:04,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 195 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:04,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:17:04,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:04,375 INFO L129 PetriNetUnfolder]: 4/228 cut-off events. [2022-01-19 06:17:04,375 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:17:04,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 228 events. 4/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 629 event pairs, 0 based on Foata normal form. 39/254 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2022-01-19 06:17:04,377 INFO L132 encePairwiseOnDemand]: 170/200 looper letters, 10 selfloop transitions, 2 changer transitions 1/170 dead transitions. [2022-01-19 06:17:04,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 170 transitions, 369 flow [2022-01-19 06:17:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:17:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:17:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-01-19 06:17:04,388 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2022-01-19 06:17:04,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-01-19 06:17:04,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-01-19 06:17:04,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:17:04,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-01-19 06:17:04,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,400 INFO L186 Difference]: Start difference. First operand has 168 places, 195 transitions, 395 flow. Second operand 3 states and 527 transitions. [2022-01-19 06:17:04,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 170 transitions, 369 flow [2022-01-19 06:17:04,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:17:04,405 INFO L242 Difference]: Finished difference. Result has 169 places, 166 transitions, 347 flow [2022-01-19 06:17:04,407 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2022-01-19 06:17:04,409 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 1 predicate places. [2022-01-19 06:17:04,409 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 347 flow [2022-01-19 06:17:04,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,410 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:04,410 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:04,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:17:04,410 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:04,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1970782420, now seen corresponding path program 1 times [2022-01-19 06:17:04,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:04,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071069728] [2022-01-19 06:17:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:04,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:17:04,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071069728] [2022-01-19 06:17:04,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071069728] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:17:04,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205873077] [2022-01-19 06:17:04,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:04,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:04,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:17:04,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:17:04,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 06:17:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:04,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:17:04,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:17:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:17:04,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:17:04,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205873077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:17:04,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:17:04,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:17:04,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551599078] [2022-01-19 06:17:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:17:04,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:17:04,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:04,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:17:04,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:17:04,677 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:17:04,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:04,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:17:04,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:04,725 INFO L129 PetriNetUnfolder]: 3/173 cut-off events. [2022-01-19 06:17:04,725 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:17:04,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 173 events. 3/173 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 319 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 160. Up to 6 conditions per place. [2022-01-19 06:17:04,729 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 8 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2022-01-19 06:17:04,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 168 transitions, 371 flow [2022-01-19 06:17:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:17:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:17:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-01-19 06:17:04,732 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8283333333333334 [2022-01-19 06:17:04,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-01-19 06:17:04,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-01-19 06:17:04,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:17:04,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-01-19 06:17:04,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,737 INFO L186 Difference]: Start difference. First operand has 169 places, 166 transitions, 347 flow. Second operand 3 states and 497 transitions. [2022-01-19 06:17:04,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 168 transitions, 371 flow [2022-01-19 06:17:04,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 168 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:17:04,743 INFO L242 Difference]: Finished difference. Result has 170 places, 166 transitions, 353 flow [2022-01-19 06:17:04,744 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=353, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2022-01-19 06:17:04,745 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 2 predicate places. [2022-01-19 06:17:04,745 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 353 flow [2022-01-19 06:17:04,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:04,745 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:04,746 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:04,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 06:17:04,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:04,960 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 449728335, now seen corresponding path program 1 times [2022-01-19 06:17:04,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:04,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440720900] [2022-01-19 06:17:04,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:04,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:17:05,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:05,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440720900] [2022-01-19 06:17:05,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440720900] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:17:05,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770988735] [2022-01-19 06:17:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:05,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:05,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:17:05,029 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:17:05,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 06:17:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:05,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:17:05,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:17:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:17:05,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:17:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:17:05,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770988735] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:17:05,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:17:05,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:17:05,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395690976] [2022-01-19 06:17:05,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:17:05,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:17:05,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:05,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:17:05,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:17:05,339 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:17:05,340 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 353 flow. Second operand has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:05,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:05,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:17:05,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:05,434 INFO L129 PetriNetUnfolder]: 3/180 cut-off events. [2022-01-19 06:17:05,435 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:17:05,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 180 events. 3/180 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 314 event pairs, 0 based on Foata normal form. 2/176 useless extension candidates. Maximal degree in co-relation 148. Up to 6 conditions per place. [2022-01-19 06:17:05,436 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/176 dead transitions. [2022-01-19 06:17:05,436 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 176 transitions, 415 flow [2022-01-19 06:17:05,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:17:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:17:05,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-01-19 06:17:05,439 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-01-19 06:17:05,439 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-01-19 06:17:05,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-01-19 06:17:05,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:17:05,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-01-19 06:17:05,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.44444444444446) internal successors, (1471), 9 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:05,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:05,451 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:05,451 INFO L186 Difference]: Start difference. First operand has 170 places, 166 transitions, 353 flow. Second operand 9 states and 1471 transitions. [2022-01-19 06:17:05,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 176 transitions, 415 flow [2022-01-19 06:17:05,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 176 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 06:17:05,460 INFO L242 Difference]: Finished difference. Result has 179 places, 172 transitions, 399 flow [2022-01-19 06:17:05,461 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=399, PETRI_PLACES=179, PETRI_TRANSITIONS=172} [2022-01-19 06:17:05,461 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 11 predicate places. [2022-01-19 06:17:05,461 INFO L470 AbstractCegarLoop]: Abstraction has has 179 places, 172 transitions, 399 flow [2022-01-19 06:17:05,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:05,462 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:05,462 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:05,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 06:17:05,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-01-19 06:17:05,663 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 305383343, now seen corresponding path program 2 times [2022-01-19 06:17:05,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:05,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142052303] [2022-01-19 06:17:05,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:05,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:17:05,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:05,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142052303] [2022-01-19 06:17:05,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142052303] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:17:05,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23970753] [2022-01-19 06:17:05,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:17:05,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:05,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:17:05,756 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:17:05,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 06:17:05,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:17:05,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:17:05,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:17:05,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:17:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:17:05,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:17:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:17:06,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23970753] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:17:06,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:17:06,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:17:06,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894156795] [2022-01-19 06:17:06,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:17:06,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:17:06,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:17:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:17:06,133 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 200 [2022-01-19 06:17:06,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 172 transitions, 399 flow. Second operand has 19 states, 19 states have (on average 157.05263157894737) internal successors, (2984), 19 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:06,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:06,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 200 [2022-01-19 06:17:06,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:06,336 INFO L129 PetriNetUnfolder]: 2/146 cut-off events. [2022-01-19 06:17:06,336 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:17:06,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 146 events. 2/146 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 5/148 useless extension candidates. Maximal degree in co-relation 170. Up to 11 conditions per place. [2022-01-19 06:17:06,337 INFO L132 encePairwiseOnDemand]: 189/200 looper letters, 23 selfloop transitions, 25 changer transitions 32/144 dead transitions. [2022-01-19 06:17:06,337 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 497 flow [2022-01-19 06:17:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:17:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:17:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3903 transitions. [2022-01-19 06:17:06,343 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7806 [2022-01-19 06:17:06,344 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3903 transitions. [2022-01-19 06:17:06,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3903 transitions. [2022-01-19 06:17:06,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:17:06,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3903 transitions. [2022-01-19 06:17:06,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 156.12) internal successors, (3903), 25 states have internal predecessors, (3903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:06,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:06,360 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 200.0) internal successors, (5200), 26 states have internal predecessors, (5200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:06,360 INFO L186 Difference]: Start difference. First operand has 179 places, 172 transitions, 399 flow. Second operand 25 states and 3903 transitions. [2022-01-19 06:17:06,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 497 flow [2022-01-19 06:17:06,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 144 transitions, 481 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 06:17:06,364 INFO L242 Difference]: Finished difference. Result has 153 places, 99 transitions, 356 flow [2022-01-19 06:17:06,364 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=356, PETRI_PLACES=153, PETRI_TRANSITIONS=99} [2022-01-19 06:17:06,365 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -15 predicate places. [2022-01-19 06:17:06,365 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 99 transitions, 356 flow [2022-01-19 06:17:06,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 157.05263157894737) internal successors, (2984), 19 states have internal predecessors, (2984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:06,368 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:06,368 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:06,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 06:17:06,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:06,587 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:06,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1085374393, now seen corresponding path program 1 times [2022-01-19 06:17:06,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:06,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848559992] [2022-01-19 06:17:06,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:06,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:17:06,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:06,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848559992] [2022-01-19 06:17:06,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848559992] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:17:06,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114454187] [2022-01-19 06:17:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:06,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:06,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:17:06,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:17:06,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 06:17:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:06,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:17:06,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:17:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:17:06,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:17:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:17:07,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114454187] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:17:07,135 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:17:07,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:17:07,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235973396] [2022-01-19 06:17:07,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:17:07,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:17:07,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:07,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:17:07,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:17:07,139 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:17:07,142 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 99 transitions, 356 flow. Second operand has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:07,142 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:07,142 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:17:07,142 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:07,374 INFO L129 PetriNetUnfolder]: 1/129 cut-off events. [2022-01-19 06:17:07,374 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:17:07,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 129 events. 1/129 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 3/132 useless extension candidates. Maximal degree in co-relation 265. Up to 17 conditions per place. [2022-01-19 06:17:07,375 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/125 dead transitions. [2022-01-19 06:17:07,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 125 transitions, 612 flow [2022-01-19 06:17:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:17:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:17:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-01-19 06:17:07,383 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-01-19 06:17:07,384 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-01-19 06:17:07,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-01-19 06:17:07,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:17:07,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-01-19 06:17:07,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.93333333333334) internal successors, (4888), 30 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:07,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:07,421 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:07,421 INFO L186 Difference]: Start difference. First operand has 153 places, 99 transitions, 356 flow. Second operand 30 states and 4888 transitions. [2022-01-19 06:17:07,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 125 transitions, 612 flow [2022-01-19 06:17:07,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 125 transitions, 576 flow, removed 9 selfloop flow, removed 9 redundant places. [2022-01-19 06:17:07,425 INFO L242 Difference]: Finished difference. Result has 146 places, 109 transitions, 478 flow [2022-01-19 06:17:07,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=478, PETRI_PLACES=146, PETRI_TRANSITIONS=109} [2022-01-19 06:17:07,426 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -22 predicate places. [2022-01-19 06:17:07,426 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 109 transitions, 478 flow [2022-01-19 06:17:07,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:07,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:07,427 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:07,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 06:17:07,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:07,644 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1164011634, now seen corresponding path program 2 times [2022-01-19 06:17:07,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:07,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065830521] [2022-01-19 06:17:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:07,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:17:08,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:08,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065830521] [2022-01-19 06:17:08,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065830521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:17:08,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:17:08,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 06:17:08,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876519904] [2022-01-19 06:17:08,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:17:08,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 06:17:08,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 06:17:08,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-01-19 06:17:08,389 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 200 [2022-01-19 06:17:08,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 109 transitions, 478 flow. Second operand has 17 states, 17 states have (on average 103.17647058823529) internal successors, (1754), 17 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:08,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:08,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 200 [2022-01-19 06:17:08,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:08,749 INFO L129 PetriNetUnfolder]: 55/311 cut-off events. [2022-01-19 06:17:08,750 INFO L130 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2022-01-19 06:17:08,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 311 events. 55/311 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 890 event pairs, 5 based on Foata normal form. 6/317 useless extension candidates. Maximal degree in co-relation 421. Up to 48 conditions per place. [2022-01-19 06:17:08,751 INFO L132 encePairwiseOnDemand]: 187/200 looper letters, 47 selfloop transitions, 11 changer transitions 24/152 dead transitions. [2022-01-19 06:17:08,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 152 transitions, 728 flow [2022-01-19 06:17:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 06:17:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 06:17:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2004 transitions. [2022-01-19 06:17:08,755 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5273684210526316 [2022-01-19 06:17:08,755 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2004 transitions. [2022-01-19 06:17:08,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2004 transitions. [2022-01-19 06:17:08,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:17:08,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2004 transitions. [2022-01-19 06:17:08,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 105.47368421052632) internal successors, (2004), 19 states have internal predecessors, (2004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:08,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 200.0) internal successors, (4000), 20 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:08,765 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 200.0) internal successors, (4000), 20 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:08,765 INFO L186 Difference]: Start difference. First operand has 146 places, 109 transitions, 478 flow. Second operand 19 states and 2004 transitions. [2022-01-19 06:17:08,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 152 transitions, 728 flow [2022-01-19 06:17:08,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 152 transitions, 684 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:17:08,772 INFO L242 Difference]: Finished difference. Result has 157 places, 112 transitions, 497 flow [2022-01-19 06:17:08,772 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=497, PETRI_PLACES=157, PETRI_TRANSITIONS=112} [2022-01-19 06:17:08,772 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -11 predicate places. [2022-01-19 06:17:08,773 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 112 transitions, 497 flow [2022-01-19 06:17:08,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 103.17647058823529) internal successors, (1754), 17 states have internal predecessors, (1754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:08,774 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:08,774 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:08,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 06:17:08,774 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 993770532, now seen corresponding path program 1 times [2022-01-19 06:17:08,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:08,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904402116] [2022-01-19 06:17:08,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:08,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:17:08,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:08,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904402116] [2022-01-19 06:17:08,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904402116] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:17:08,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236610740] [2022-01-19 06:17:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:08,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:08,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:17:08,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:17:08,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 06:17:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:09,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:17:09,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:17:09,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:17:09,399 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:17:09,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:17:09,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:17:09,596 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:17:09,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:17:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2022-01-19 06:17:09,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:17:09,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_217) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:17:09,748 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_217) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:17:10,299 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:17:10,321 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:17:10,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:17:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 1 not checked. [2022-01-19 06:17:10,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236610740] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:17:10,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:17:10,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:17:10,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673373449] [2022-01-19 06:17:10,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:17:10,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:17:10,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:17:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:17:10,338 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 200 [2022-01-19 06:17:10,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 112 transitions, 497 flow. Second operand has 26 states, 26 states have (on average 116.5) internal successors, (3029), 26 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:10,340 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:10,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 200 [2022-01-19 06:17:10,340 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:17:34,430 WARN L228 SmtUtils]: Spent 24.04s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:17:48,479 WARN L228 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:17:52,644 INFO L129 PetriNetUnfolder]: 2/180 cut-off events. [2022-01-19 06:17:52,644 INFO L130 PetriNetUnfolder]: For 198/201 co-relation queries the response was YES. [2022-01-19 06:17:52,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 180 events. 2/180 cut-off events. For 198/201 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 226 event pairs, 0 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 418. Up to 16 conditions per place. [2022-01-19 06:17:52,645 INFO L132 encePairwiseOnDemand]: 187/200 looper letters, 19 selfloop transitions, 12 changer transitions 13/126 dead transitions. [2022-01-19 06:17:52,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 126 transitions, 659 flow [2022-01-19 06:17:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 06:17:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 06:17:52,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2325 transitions. [2022-01-19 06:17:52,652 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.58125 [2022-01-19 06:17:52,652 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2325 transitions. [2022-01-19 06:17:52,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2325 transitions. [2022-01-19 06:17:52,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:17:52,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2325 transitions. [2022-01-19 06:17:52,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 116.25) internal successors, (2325), 20 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:52,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 200.0) internal successors, (4200), 21 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:52,663 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 200.0) internal successors, (4200), 21 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:52,663 INFO L186 Difference]: Start difference. First operand has 157 places, 112 transitions, 497 flow. Second operand 20 states and 2325 transitions. [2022-01-19 06:17:52,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 126 transitions, 659 flow [2022-01-19 06:17:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 126 transitions, 596 flow, removed 27 selfloop flow, removed 14 redundant places. [2022-01-19 06:17:52,667 INFO L242 Difference]: Finished difference. Result has 161 places, 113 transitions, 509 flow [2022-01-19 06:17:52,667 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=509, PETRI_PLACES=161, PETRI_TRANSITIONS=113} [2022-01-19 06:17:52,668 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -7 predicate places. [2022-01-19 06:17:52,668 INFO L470 AbstractCegarLoop]: Abstraction has has 161 places, 113 transitions, 509 flow [2022-01-19 06:17:52,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 116.5) internal successors, (3029), 26 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:52,669 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:17:52,669 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:17:52,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:17:52,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:52,886 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 06:17:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:17:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash -679979078, now seen corresponding path program 2 times [2022-01-19 06:17:52,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:17:52,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214841604] [2022-01-19 06:17:52,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:17:52,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:17:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:17:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:17:53,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:17:53,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214841604] [2022-01-19 06:17:53,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214841604] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:17:53,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172896449] [2022-01-19 06:17:53,089 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:17:53,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:17:53,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:17:53,090 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:17:53,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 06:17:53,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:17:53,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:17:53,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:17:53,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:17:53,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:17:53,616 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:17:53,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:17:53,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:17:53,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:17:53,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:17:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:17:53,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:17:53,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_282) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:17:53,964 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_282) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:17:54,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:17:54,498 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:17:54,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:17:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:17:54,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172896449] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:17:54,511 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:17:54,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:17:54,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954687821] [2022-01-19 06:17:54,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:17:54,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:17:54,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:17:54,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:17:54,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:17:54,513 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 200 [2022-01-19 06:17:54,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 113 transitions, 509 flow. Second operand has 26 states, 26 states have (on average 116.5) internal successors, (3029), 26 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:17:54,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:17:54,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 200 [2022-01-19 06:17:54,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:10,593 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:18:24,652 WARN L228 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 30 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:18:34,677 WARN L228 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 26 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:18:34,728 INFO L129 PetriNetUnfolder]: 2/141 cut-off events. [2022-01-19 06:18:34,728 INFO L130 PetriNetUnfolder]: For 164/166 co-relation queries the response was YES. [2022-01-19 06:18:34,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 141 events. 2/141 cut-off events. For 164/166 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 3/144 useless extension candidates. Maximal degree in co-relation 345. Up to 16 conditions per place. [2022-01-19 06:18:34,729 INFO L132 encePairwiseOnDemand]: 187/200 looper letters, 0 selfloop transitions, 0 changer transitions 111/111 dead transitions. [2022-01-19 06:18:34,729 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 111 transitions, 561 flow [2022-01-19 06:18:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 06:18:34,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 06:18:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1740 transitions. [2022-01-19 06:18:34,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.58 [2022-01-19 06:18:34,731 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1740 transitions. [2022-01-19 06:18:34,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1740 transitions. [2022-01-19 06:18:34,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:34,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1740 transitions. [2022-01-19 06:18:34,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.0) internal successors, (1740), 15 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:34,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 200.0) internal successors, (3200), 16 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:34,736 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 200.0) internal successors, (3200), 16 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:34,736 INFO L186 Difference]: Start difference. First operand has 161 places, 113 transitions, 509 flow. Second operand 15 states and 1740 transitions. [2022-01-19 06:18:34,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 111 transitions, 561 flow [2022-01-19 06:18:34,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 111 transitions, 531 flow, removed 6 selfloop flow, removed 12 redundant places. [2022-01-19 06:18:34,738 INFO L242 Difference]: Finished difference. Result has 153 places, 0 transitions, 0 flow [2022-01-19 06:18:34,739 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=0, PETRI_PLACES=153, PETRI_TRANSITIONS=0} [2022-01-19 06:18:34,739 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, -15 predicate places. [2022-01-19 06:18:34,739 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 0 transitions, 0 flow [2022-01-19 06:18:34,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 116.5) internal successors, (3029), 26 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:34,741 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 06:18:34,742 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-19 06:18:34,742 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-19 06:18:34,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:34,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:34,958 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2022-01-19 06:18:34,958 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2022-01-19 06:18:34,961 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 06:18:34,961 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:18:34,961 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 06:18:34,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:18:34,973 INFO L129 PetriNetUnfolder]: 45/272 cut-off events. [2022-01-19 06:18:34,973 INFO L130 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2022-01-19 06:18:34,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 272 events. 45/272 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 838 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 150. Up to 8 conditions per place. [2022-01-19 06:18:34,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 200 transitions, 408 flow [2022-01-19 06:18:34,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 195 transitions, 395 flow [2022-01-19 06:18:34,982 INFO L129 PetriNetUnfolder]: 14/133 cut-off events. [2022-01-19 06:18:34,982 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 06:18:34,982 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:34,982 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:34,983 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:18:34,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash -959674574, now seen corresponding path program 1 times [2022-01-19 06:18:34,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:34,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533965995] [2022-01-19 06:18:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:34,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:34,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:34,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533965995] [2022-01-19 06:18:34,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533965995] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:18:34,996 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:18:34,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:18:34,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164781088] [2022-01-19 06:18:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:18:34,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:18:34,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:34,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:18:34,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:18:34,998 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-01-19 06:18:34,998 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 195 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:34,998 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:34,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-01-19 06:18:34,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:35,016 INFO L129 PetriNetUnfolder]: 4/228 cut-off events. [2022-01-19 06:18:35,016 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:18:35,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 228 events. 4/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 629 event pairs, 0 based on Foata normal form. 39/254 useless extension candidates. Maximal degree in co-relation 125. Up to 9 conditions per place. [2022-01-19 06:18:35,017 INFO L132 encePairwiseOnDemand]: 170/200 looper letters, 10 selfloop transitions, 2 changer transitions 1/170 dead transitions. [2022-01-19 06:18:35,017 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 170 transitions, 369 flow [2022-01-19 06:18:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:18:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:18:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-01-19 06:18:35,018 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2022-01-19 06:18:35,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-01-19 06:18:35,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-01-19 06:18:35,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:35,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-01-19 06:18:35,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,021 INFO L186 Difference]: Start difference. First operand has 168 places, 195 transitions, 395 flow. Second operand 3 states and 527 transitions. [2022-01-19 06:18:35,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 170 transitions, 369 flow [2022-01-19 06:18:35,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:18:35,026 INFO L242 Difference]: Finished difference. Result has 169 places, 166 transitions, 347 flow [2022-01-19 06:18:35,026 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=169, PETRI_TRANSITIONS=166} [2022-01-19 06:18:35,027 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 1 predicate places. [2022-01-19 06:18:35,027 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 166 transitions, 347 flow [2022-01-19 06:18:35,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,027 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:35,027 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:35,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 06:18:35,028 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:18:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1718762197, now seen corresponding path program 1 times [2022-01-19 06:18:35,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:35,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724199131] [2022-01-19 06:18:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:35,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:35,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724199131] [2022-01-19 06:18:35,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724199131] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:35,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526834726] [2022-01-19 06:18:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:35,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:35,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:35,053 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:35,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 06:18:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:35,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:18:35,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:35,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:35,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526834726] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:35,244 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:35,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:18:35,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353638539] [2022-01-19 06:18:35,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:35,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:18:35,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:35,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:18:35,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:18:35,248 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:18:35,248 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 166 transitions, 347 flow. Second operand has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,248 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:35,248 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:18:35,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:35,311 INFO L129 PetriNetUnfolder]: 4/234 cut-off events. [2022-01-19 06:18:35,311 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 06:18:35,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 234 events. 4/234 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 2/225 useless extension candidates. Maximal degree in co-relation 227. Up to 6 conditions per place. [2022-01-19 06:18:35,312 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/176 dead transitions. [2022-01-19 06:18:35,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 176 transitions, 409 flow [2022-01-19 06:18:35,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:18:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:18:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-01-19 06:18:35,314 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-01-19 06:18:35,314 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-01-19 06:18:35,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-01-19 06:18:35,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:35,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-01-19 06:18:35,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.44444444444446) internal successors, (1471), 9 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,318 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,318 INFO L186 Difference]: Start difference. First operand has 169 places, 166 transitions, 347 flow. Second operand 9 states and 1471 transitions. [2022-01-19 06:18:35,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 176 transitions, 409 flow [2022-01-19 06:18:35,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 176 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:18:35,321 INFO L242 Difference]: Finished difference. Result has 178 places, 172 transitions, 395 flow [2022-01-19 06:18:35,322 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=395, PETRI_PLACES=178, PETRI_TRANSITIONS=172} [2022-01-19 06:18:35,322 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 10 predicate places. [2022-01-19 06:18:35,322 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 172 transitions, 395 flow [2022-01-19 06:18:35,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,322 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:35,323 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:35,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:35,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:35,535 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:18:35,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2122069387, now seen corresponding path program 2 times [2022-01-19 06:18:35,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:35,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811643621] [2022-01-19 06:18:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:35,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:35,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811643621] [2022-01-19 06:18:35,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811643621] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:35,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028923571] [2022-01-19 06:18:35,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:18:35,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:35,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:35,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:35,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 06:18:35,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:18:35,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:18:35,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:18:35,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:35,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:35,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028923571] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:35,821 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:35,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-19 06:18:35,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623258140] [2022-01-19 06:18:35,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:35,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-19 06:18:35,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-19 06:18:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-19 06:18:35,823 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:18:35,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 172 transitions, 395 flow. Second operand has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:35,825 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:18:35,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:35,951 INFO L129 PetriNetUnfolder]: 4/254 cut-off events. [2022-01-19 06:18:35,951 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-01-19 06:18:35,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 254 events. 4/254 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 4/247 useless extension candidates. Maximal degree in co-relation 221. Up to 11 conditions per place. [2022-01-19 06:18:35,952 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 19 selfloop transitions, 21 changer transitions 0/196 dead transitions. [2022-01-19 06:18:35,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 196 transitions, 583 flow [2022-01-19 06:18:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 06:18:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 06:18:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3425 transitions. [2022-01-19 06:18:35,955 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2022-01-19 06:18:35,955 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3425 transitions. [2022-01-19 06:18:35,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3425 transitions. [2022-01-19 06:18:35,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:35,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3425 transitions. [2022-01-19 06:18:35,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 163.0952380952381) internal successors, (3425), 21 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,962 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,962 INFO L186 Difference]: Start difference. First operand has 178 places, 172 transitions, 395 flow. Second operand 21 states and 3425 transitions. [2022-01-19 06:18:35,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 196 transitions, 583 flow [2022-01-19 06:18:35,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 196 transitions, 569 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:18:35,965 INFO L242 Difference]: Finished difference. Result has 202 places, 185 transitions, 519 flow [2022-01-19 06:18:35,965 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=519, PETRI_PLACES=202, PETRI_TRANSITIONS=185} [2022-01-19 06:18:35,965 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 34 predicate places. [2022-01-19 06:18:35,965 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 185 transitions, 519 flow [2022-01-19 06:18:35,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:35,966 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:35,966 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:35,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:36,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 06:18:36,183 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:18:36,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1016344139, now seen corresponding path program 3 times [2022-01-19 06:18:36,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:36,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37623253] [2022-01-19 06:18:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:36,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:36,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:36,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37623253] [2022-01-19 06:18:36,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37623253] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:36,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230331640] [2022-01-19 06:18:36,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 06:18:36,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:36,294 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:36,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 06:18:36,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-19 06:18:36,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:18:36,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:18:36,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:36,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 06:18:36,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230331640] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:36,657 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:36,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:18:36,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181986502] [2022-01-19 06:18:36,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:36,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:18:36,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:36,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:18:36,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:18:36,659 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-01-19 06:18:36,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 185 transitions, 519 flow. Second operand has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:36,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:36,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-01-19 06:18:36,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:36,870 INFO L129 PetriNetUnfolder]: 4/269 cut-off events. [2022-01-19 06:18:36,871 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-01-19 06:18:36,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 269 events. 4/269 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 3/261 useless extension candidates. Maximal degree in co-relation 317. Up to 17 conditions per place. [2022-01-19 06:18:36,872 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/211 dead transitions. [2022-01-19 06:18:36,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 211 transitions, 775 flow [2022-01-19 06:18:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:18:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:18:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-01-19 06:18:36,875 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-01-19 06:18:36,875 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-01-19 06:18:36,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-01-19 06:18:36,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:36,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-01-19 06:18:36,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.93333333333334) internal successors, (4888), 30 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:36,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:36,886 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:36,886 INFO L186 Difference]: Start difference. First operand has 202 places, 185 transitions, 519 flow. Second operand 30 states and 4888 transitions. [2022-01-19 06:18:36,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 211 transitions, 775 flow [2022-01-19 06:18:36,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 211 transitions, 745 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-01-19 06:18:36,890 INFO L242 Difference]: Finished difference. Result has 229 places, 195 transitions, 647 flow [2022-01-19 06:18:36,890 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=647, PETRI_PLACES=229, PETRI_TRANSITIONS=195} [2022-01-19 06:18:36,890 INFO L334 CegarLoopForPetriNet]: 168 programPoint places, 61 predicate places. [2022-01-19 06:18:36,890 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 195 transitions, 647 flow [2022-01-19 06:18:36,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:36,891 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:36,891 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:36,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:37,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:37,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 06:18:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 282089810, now seen corresponding path program 4 times [2022-01-19 06:18:37,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:37,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278887866] [2022-01-19 06:18:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:37,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:18:37,120 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 06:18:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 06:18:37,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 06:18:37,153 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 06:18:37,153 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 06:18:37,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 06:18:37,154 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1] [2022-01-19 06:18:37,154 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 06:18:37,155 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 06:18:37,155 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 06:18:37,173 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,174 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,175 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,176 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,177 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,178 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,179 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,180 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,181 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,182 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,185 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,186 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,187 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,188 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,189 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,190 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,191 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,192 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,193 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,194 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,195 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_~p~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~nondet31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,196 WARN L322 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:18:37,197 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 06:18:37,198 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:18:37,198 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 06:18:37,199 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 06:18:37,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 235 places, 275 transitions, 568 flow [2022-01-19 06:18:37,251 INFO L129 PetriNetUnfolder]: 75/444 cut-off events. [2022-01-19 06:18:37,252 INFO L130 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-01-19 06:18:37,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 444 events. 75/444 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1726 event pairs, 0 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 274. Up to 12 conditions per place. [2022-01-19 06:18:37,254 INFO L82 GeneralOperation]: Start removeDead. Operand has 235 places, 275 transitions, 568 flow [2022-01-19 06:18:37,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 235 places, 275 transitions, 568 flow [2022-01-19 06:18:37,262 INFO L129 PetriNetUnfolder]: 13/134 cut-off events. [2022-01-19 06:18:37,262 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 06:18:37,262 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:37,262 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:37,263 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:37,263 INFO L85 PathProgramCache]: Analyzing trace with hash 510054994, now seen corresponding path program 1 times [2022-01-19 06:18:37,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:37,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660267539] [2022-01-19 06:18:37,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:37,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:18:37,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:37,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660267539] [2022-01-19 06:18:37,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660267539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:18:37,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:18:37,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 06:18:37,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874813301] [2022-01-19 06:18:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:18:37,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:18:37,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:37,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:18:37,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 06:18:37,279 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 275 [2022-01-19 06:18:37,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 275 transitions, 568 flow. Second operand has 3 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) [2022-01-19 06:18:37,279 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:37,279 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 275 [2022-01-19 06:18:37,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:37,318 INFO L129 PetriNetUnfolder]: 9/377 cut-off events. [2022-01-19 06:18:37,318 INFO L130 PetriNetUnfolder]: For 18/22 co-relation queries the response was YES. [2022-01-19 06:18:37,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 377 events. 9/377 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1438 event pairs, 0 based on Foata normal form. 90/446 useless extension candidates. Maximal degree in co-relation 248. Up to 14 conditions per place. [2022-01-19 06:18:37,321 INFO L132 encePairwiseOnDemand]: 233/275 looper letters, 13 selfloop transitions, 2 changer transitions 1/237 dead transitions. [2022-01-19 06:18:37,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 237 transitions, 522 flow [2022-01-19 06:18:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:18:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:18:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2022-01-19 06:18:37,322 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8751515151515151 [2022-01-19 06:18:37,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2022-01-19 06:18:37,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2022-01-19 06:18:37,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:37,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2022-01-19 06:18:37,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,324 INFO L186 Difference]: Start difference. First operand has 235 places, 275 transitions, 568 flow. Second operand 3 states and 722 transitions. [2022-01-19 06:18:37,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 237 transitions, 522 flow [2022-01-19 06:18:37,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 237 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 06:18:37,327 INFO L242 Difference]: Finished difference. Result has 235 places, 233 transitions, 494 flow [2022-01-19 06:18:37,327 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=235, PETRI_TRANSITIONS=233} [2022-01-19 06:18:37,328 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 0 predicate places. [2022-01-19 06:18:37,328 INFO L470 AbstractCegarLoop]: Abstraction has has 235 places, 233 transitions, 494 flow [2022-01-19 06:18:37,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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) [2022-01-19 06:18:37,329 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:37,329 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:37,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 06:18:37,329 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:37,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1078955039, now seen corresponding path program 1 times [2022-01-19 06:18:37,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:37,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923827547] [2022-01-19 06:18:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:37,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:18:37,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:37,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923827547] [2022-01-19 06:18:37,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923827547] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:37,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728783036] [2022-01-19 06:18:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:37,348 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:37,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:37,349 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:37,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 06:18:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:37,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 06:18:37,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:37,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:18:37,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 06:18:37,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728783036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:18:37,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 06:18:37,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 06:18:37,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900630317] [2022-01-19 06:18:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:18:37,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 06:18:37,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:37,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 06:18:37,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:18:37,475 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 275 [2022-01-19 06:18:37,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 233 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:37,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 275 [2022-01-19 06:18:37,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:37,510 INFO L129 PetriNetUnfolder]: 7/331 cut-off events. [2022-01-19 06:18:37,510 INFO L130 PetriNetUnfolder]: For 15/34 co-relation queries the response was YES. [2022-01-19 06:18:37,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 331 events. 7/331 cut-off events. For 15/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1125 event pairs, 0 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 336. Up to 16 conditions per place. [2022-01-19 06:18:37,513 INFO L132 encePairwiseOnDemand]: 272/275 looper letters, 13 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2022-01-19 06:18:37,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 237 transitions, 532 flow [2022-01-19 06:18:37,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 06:18:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 06:18:37,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2022-01-19 06:18:37,514 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2022-01-19 06:18:37,514 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2022-01-19 06:18:37,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2022-01-19 06:18:37,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:37,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2022-01-19 06:18:37,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,517 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,517 INFO L186 Difference]: Start difference. First operand has 235 places, 233 transitions, 494 flow. Second operand 3 states and 682 transitions. [2022-01-19 06:18:37,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 237 transitions, 532 flow [2022-01-19 06:18:37,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 237 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:18:37,520 INFO L242 Difference]: Finished difference. Result has 236 places, 234 transitions, 504 flow [2022-01-19 06:18:37,521 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=236, PETRI_TRANSITIONS=234} [2022-01-19 06:18:37,521 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 1 predicate places. [2022-01-19 06:18:37,521 INFO L470 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 504 flow [2022-01-19 06:18:37,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:37,521 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:37,521 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:37,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:37,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 06:18:37,738 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:37,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1428162091, now seen corresponding path program 1 times [2022-01-19 06:18:37,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:37,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021290400] [2022-01-19 06:18:37,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:37,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:18:37,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:37,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021290400] [2022-01-19 06:18:37,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021290400] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:37,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649132317] [2022-01-19 06:18:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:37,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:37,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:37,777 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:37,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 06:18:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:37,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 06:18:37,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:18:37,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:18:38,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649132317] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:38,018 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:38,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 06:18:38,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291046155] [2022-01-19 06:18:38,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:38,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 06:18:38,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 06:18:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 06:18:38,019 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 275 [2022-01-19 06:18:38,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 234 transitions, 504 flow. Second operand has 10 states, 10 states have (on average 223.1) internal successors, (2231), 10 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) [2022-01-19 06:18:38,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:38,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 275 [2022-01-19 06:18:38,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:38,091 INFO L129 PetriNetUnfolder]: 7/338 cut-off events. [2022-01-19 06:18:38,091 INFO L130 PetriNetUnfolder]: For 19/23 co-relation queries the response was YES. [2022-01-19 06:18:38,093 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 338 events. 7/338 cut-off events. For 19/23 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1121 event pairs, 0 based on Foata normal form. 2/326 useless extension candidates. Maximal degree in co-relation 321. Up to 11 conditions per place. [2022-01-19 06:18:38,094 INFO L132 encePairwiseOnDemand]: 269/275 looper letters, 14 selfloop transitions, 9 changer transitions 0/244 dead transitions. [2022-01-19 06:18:38,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 244 transitions, 572 flow [2022-01-19 06:18:38,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:18:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:18:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2014 transitions. [2022-01-19 06:18:38,096 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8137373737373738 [2022-01-19 06:18:38,096 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2014 transitions. [2022-01-19 06:18:38,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2014 transitions. [2022-01-19 06:18:38,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:38,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2014 transitions. [2022-01-19 06:18:38,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 223.77777777777777) internal successors, (2014), 9 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,101 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,101 INFO L186 Difference]: Start difference. First operand has 236 places, 234 transitions, 504 flow. Second operand 9 states and 2014 transitions. [2022-01-19 06:18:38,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 244 transitions, 572 flow [2022-01-19 06:18:38,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 244 transitions, 570 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 06:18:38,104 INFO L242 Difference]: Finished difference. Result has 246 places, 240 transitions, 552 flow [2022-01-19 06:18:38,104 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=552, PETRI_PLACES=246, PETRI_TRANSITIONS=240} [2022-01-19 06:18:38,105 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 11 predicate places. [2022-01-19 06:18:38,105 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 240 transitions, 552 flow [2022-01-19 06:18:38,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 223.1) internal successors, (2231), 10 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) [2022-01-19 06:18:38,105 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:38,105 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:38,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:38,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 06:18:38,311 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2019148117, now seen corresponding path program 2 times [2022-01-19 06:18:38,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:38,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716219798] [2022-01-19 06:18:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:38,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 06:18:38,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:38,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716219798] [2022-01-19 06:18:38,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716219798] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:38,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343428640] [2022-01-19 06:18:38,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:18:38,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:38,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:38,336 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:38,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 06:18:38,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:18:38,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:18:38,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 06:18:38,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:18:38,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 06:18:38,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343428640] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:38,684 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:38,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-01-19 06:18:38,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623900060] [2022-01-19 06:18:38,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:38,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 06:18:38,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:38,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 06:18:38,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-01-19 06:18:38,686 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 275 [2022-01-19 06:18:38,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 240 transitions, 552 flow. Second operand has 19 states, 19 states have (on average 217.05263157894737) internal successors, (4124), 19 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:38,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 275 [2022-01-19 06:18:38,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:38,884 INFO L129 PetriNetUnfolder]: 5/313 cut-off events. [2022-01-19 06:18:38,884 INFO L130 PetriNetUnfolder]: For 36/43 co-relation queries the response was YES. [2022-01-19 06:18:38,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 313 events. 5/313 cut-off events. For 36/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 732 event pairs, 1 based on Foata normal form. 6/307 useless extension candidates. Maximal degree in co-relation 293. Up to 14 conditions per place. [2022-01-19 06:18:38,887 INFO L132 encePairwiseOnDemand]: 264/275 looper letters, 31 selfloop transitions, 26 changer transitions 0/270 dead transitions. [2022-01-19 06:18:38,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 270 transitions, 786 flow [2022-01-19 06:18:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 06:18:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 06:18:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5412 transitions. [2022-01-19 06:18:38,891 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7872 [2022-01-19 06:18:38,891 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5412 transitions. [2022-01-19 06:18:38,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5412 transitions. [2022-01-19 06:18:38,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:38,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5412 transitions. [2022-01-19 06:18:38,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 216.48) internal successors, (5412), 25 states have internal predecessors, (5412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 275.0) internal successors, (7150), 26 states have internal predecessors, (7150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,903 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 275.0) internal successors, (7150), 26 states have internal predecessors, (7150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,903 INFO L186 Difference]: Start difference. First operand has 246 places, 240 transitions, 552 flow. Second operand 25 states and 5412 transitions. [2022-01-19 06:18:38,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 270 transitions, 786 flow [2022-01-19 06:18:38,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 270 transitions, 772 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 06:18:38,907 INFO L242 Difference]: Finished difference. Result has 277 places, 255 transitions, 704 flow [2022-01-19 06:18:38,907 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=704, PETRI_PLACES=277, PETRI_TRANSITIONS=255} [2022-01-19 06:18:38,907 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 42 predicate places. [2022-01-19 06:18:38,907 INFO L470 AbstractCegarLoop]: Abstraction has has 277 places, 255 transitions, 704 flow [2022-01-19 06:18:38,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 217.05263157894737) internal successors, (4124), 19 states have internal predecessors, (4124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:38,908 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:38,908 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:38,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:39,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-19 06:18:39,124 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:39,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash 44072195, now seen corresponding path program 1 times [2022-01-19 06:18:39,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:39,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307669083] [2022-01-19 06:18:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:39,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:18:39,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:39,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307669083] [2022-01-19 06:18:39,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307669083] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:39,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340713556] [2022-01-19 06:18:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:39,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:39,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:39,229 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:39,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-19 06:18:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:39,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-19 06:18:39,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:18:39,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 06:18:39,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340713556] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:39,618 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:39,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-01-19 06:18:39,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649075279] [2022-01-19 06:18:39,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:39,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 06:18:39,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 06:18:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-01-19 06:18:39,622 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 275 [2022-01-19 06:18:39,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 255 transitions, 704 flow. Second operand has 23 states, 23 states have (on average 223.43478260869566) internal successors, (5139), 23 states have internal predecessors, (5139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:39,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:39,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 275 [2022-01-19 06:18:39,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:39,894 INFO L129 PetriNetUnfolder]: 5/328 cut-off events. [2022-01-19 06:18:39,894 INFO L130 PetriNetUnfolder]: For 135/136 co-relation queries the response was YES. [2022-01-19 06:18:39,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 328 events. 5/328 cut-off events. For 135/136 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 732 event pairs, 1 based on Foata normal form. 3/319 useless extension candidates. Maximal degree in co-relation 345. Up to 17 conditions per place. [2022-01-19 06:18:39,897 INFO L132 encePairwiseOnDemand]: 269/275 looper letters, 28 selfloop transitions, 30 changer transitions 0/281 dead transitions. [2022-01-19 06:18:39,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 281 transitions, 966 flow [2022-01-19 06:18:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 06:18:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 06:18:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6691 transitions. [2022-01-19 06:18:39,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.811030303030303 [2022-01-19 06:18:39,907 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6691 transitions. [2022-01-19 06:18:39,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6691 transitions. [2022-01-19 06:18:39,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:39,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6691 transitions. [2022-01-19 06:18:39,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 223.03333333333333) internal successors, (6691), 30 states have internal predecessors, (6691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:39,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 275.0) internal successors, (8525), 31 states have internal predecessors, (8525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:39,929 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 275.0) internal successors, (8525), 31 states have internal predecessors, (8525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:39,929 INFO L186 Difference]: Start difference. First operand has 277 places, 255 transitions, 704 flow. Second operand 30 states and 6691 transitions. [2022-01-19 06:18:39,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 281 transitions, 966 flow [2022-01-19 06:18:39,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 281 transitions, 932 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-01-19 06:18:39,935 INFO L242 Difference]: Finished difference. Result has 303 places, 265 transitions, 828 flow [2022-01-19 06:18:39,935 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=828, PETRI_PLACES=303, PETRI_TRANSITIONS=265} [2022-01-19 06:18:39,935 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 68 predicate places. [2022-01-19 06:18:39,935 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 265 transitions, 828 flow [2022-01-19 06:18:39,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 223.43478260869566) internal successors, (5139), 23 states have internal predecessors, (5139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:39,936 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:39,937 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:39,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:40,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-19 06:18:40,156 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1321944183, now seen corresponding path program 2 times [2022-01-19 06:18:40,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:40,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150397990] [2022-01-19 06:18:40,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:40,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:18:40,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:40,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150397990] [2022-01-19 06:18:40,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150397990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:18:40,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:18:40,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 06:18:40,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905751770] [2022-01-19 06:18:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:18:40,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 06:18:40,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 06:18:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-19 06:18:40,297 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 275 [2022-01-19 06:18:40,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 265 transitions, 828 flow. Second operand has 13 states, 13 states have (on average 164.15384615384616) internal successors, (2134), 13 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:40,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:40,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 275 [2022-01-19 06:18:40,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:45,885 INFO L129 PetriNetUnfolder]: 17499/43977 cut-off events. [2022-01-19 06:18:45,885 INFO L130 PetriNetUnfolder]: For 740/740 co-relation queries the response was YES. [2022-01-19 06:18:46,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71965 conditions, 43977 events. 17499/43977 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 1704. Compared 549710 event pairs, 3819 based on Foata normal form. 0/42744 useless extension candidates. Maximal degree in co-relation 71710. Up to 10205 conditions per place. [2022-01-19 06:18:46,196 INFO L132 encePairwiseOnDemand]: 257/275 looper letters, 490 selfloop transitions, 81 changer transitions 147/912 dead transitions. [2022-01-19 06:18:46,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 912 transitions, 3676 flow [2022-01-19 06:18:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 06:18:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 06:18:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6718 transitions. [2022-01-19 06:18:46,201 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6602457002457003 [2022-01-19 06:18:46,201 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6718 transitions. [2022-01-19 06:18:46,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6718 transitions. [2022-01-19 06:18:46,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:46,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6718 transitions. [2022-01-19 06:18:46,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 181.56756756756758) internal successors, (6718), 37 states have internal predecessors, (6718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 275.0) internal successors, (10450), 38 states have internal predecessors, (10450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,220 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 275.0) internal successors, (10450), 38 states have internal predecessors, (10450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,220 INFO L186 Difference]: Start difference. First operand has 303 places, 265 transitions, 828 flow. Second operand 37 states and 6718 transitions. [2022-01-19 06:18:46,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 912 transitions, 3676 flow [2022-01-19 06:18:46,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 912 transitions, 3632 flow, removed 4 selfloop flow, removed 18 redundant places. [2022-01-19 06:18:46,233 INFO L242 Difference]: Finished difference. Result has 340 places, 358 transitions, 1343 flow [2022-01-19 06:18:46,233 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1343, PETRI_PLACES=340, PETRI_TRANSITIONS=358} [2022-01-19 06:18:46,234 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 105 predicate places. [2022-01-19 06:18:46,234 INFO L470 AbstractCegarLoop]: Abstraction has has 340 places, 358 transitions, 1343 flow [2022-01-19 06:18:46,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 164.15384615384616) internal successors, (2134), 13 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,234 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:46,234 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:46,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 06:18:46,235 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:46,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:46,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1385235796, now seen corresponding path program 1 times [2022-01-19 06:18:46,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:46,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759359552] [2022-01-19 06:18:46,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:46,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:46,276 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:18:46,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:46,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759359552] [2022-01-19 06:18:46,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759359552] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:46,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703146237] [2022-01-19 06:18:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:46,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:46,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:46,278 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:46,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-19 06:18:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:46,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 06:18:46,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:18:46,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:18:46,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703146237] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:46,680 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:46,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-19 06:18:46,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013327585] [2022-01-19 06:18:46,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:46,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:18:46,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:18:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:18:46,684 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 275 [2022-01-19 06:18:46,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 358 transitions, 1343 flow. Second operand has 14 states, 14 states have (on average 223.5) internal successors, (3129), 14 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:46,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 275 [2022-01-19 06:18:46,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:18:46,827 INFO L129 PetriNetUnfolder]: 49/825 cut-off events. [2022-01-19 06:18:46,827 INFO L130 PetriNetUnfolder]: For 982/1069 co-relation queries the response was YES. [2022-01-19 06:18:46,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 825 events. 49/825 cut-off events. For 982/1069 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4771 event pairs, 9 based on Foata normal form. 64/867 useless extension candidates. Maximal degree in co-relation 1313. Up to 31 conditions per place. [2022-01-19 06:18:46,832 INFO L132 encePairwiseOnDemand]: 270/275 looper letters, 19 selfloop transitions, 7 changer transitions 8/248 dead transitions. [2022-01-19 06:18:46,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 248 transitions, 1012 flow [2022-01-19 06:18:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 06:18:46,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 06:18:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2006 transitions. [2022-01-19 06:18:46,834 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8105050505050505 [2022-01-19 06:18:46,834 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2006 transitions. [2022-01-19 06:18:46,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2006 transitions. [2022-01-19 06:18:46,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:18:46,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2006 transitions. [2022-01-19 06:18:46,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 222.88888888888889) internal successors, (2006), 9 states have internal predecessors, (2006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,853 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 275.0) internal successors, (2750), 10 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,853 INFO L186 Difference]: Start difference. First operand has 340 places, 358 transitions, 1343 flow. Second operand 9 states and 2006 transitions. [2022-01-19 06:18:46,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 248 transitions, 1012 flow [2022-01-19 06:18:46,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 248 transitions, 969 flow, removed 8 selfloop flow, removed 16 redundant places. [2022-01-19 06:18:46,859 INFO L242 Difference]: Finished difference. Result has 260 places, 231 transitions, 837 flow [2022-01-19 06:18:46,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=837, PETRI_PLACES=260, PETRI_TRANSITIONS=231} [2022-01-19 06:18:46,860 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 25 predicate places. [2022-01-19 06:18:46,860 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 231 transitions, 837 flow [2022-01-19 06:18:46,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 223.5) internal successors, (3129), 14 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:46,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:18:46,861 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:18:46,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-01-19 06:18:47,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:47,061 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:18:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:18:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash -977482110, now seen corresponding path program 1 times [2022-01-19 06:18:47,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:18:47,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215246654] [2022-01-19 06:18:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:47,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:18:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:18:47,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:18:47,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215246654] [2022-01-19 06:18:47,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215246654] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:18:47,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282451810] [2022-01-19 06:18:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:18:47,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:18:47,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:18:47,305 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:18:47,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-19 06:18:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:18:47,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:18:47,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:18:47,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:18:47,950 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:18:47,950 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:18:47,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:18:48,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:18:48,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:18:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:18:48,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:18:48,235 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_681) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:18:48,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_681 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_681) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:18:48,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:18:48,814 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:18:48,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:18:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:18:48,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282451810] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:18:48,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:18:48,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:18:48,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88067625] [2022-01-19 06:18:48,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:18:48,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:18:48,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:18:48,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:18:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=472, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:18:48,829 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 275 [2022-01-19 06:18:48,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 231 transitions, 837 flow. Second operand has 26 states, 26 states have (on average 164.5) internal successors, (4277), 26 states have internal predecessors, (4277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:18:48,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:18:48,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 275 [2022-01-19 06:18:48,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:19:02,933 WARN L228 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 32 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:19:18,960 WARN L228 SmtUtils]: Spent 16.02s on a formula simplification. DAG size of input: 26 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:19:36,999 WARN L228 SmtUtils]: Spent 18.02s on a formula simplification. DAG size of input: 25 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:19:37,760 INFO L129 PetriNetUnfolder]: 1618/5254 cut-off events. [2022-01-19 06:19:37,761 INFO L130 PetriNetUnfolder]: For 8578/8581 co-relation queries the response was YES. [2022-01-19 06:19:37,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12369 conditions, 5254 events. 1618/5254 cut-off events. For 8578/8581 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 51837 event pairs, 842 based on Foata normal form. 1/5131 useless extension candidates. Maximal degree in co-relation 12126. Up to 2350 conditions per place. [2022-01-19 06:19:37,787 INFO L132 encePairwiseOnDemand]: 258/275 looper letters, 91 selfloop transitions, 46 changer transitions 20/309 dead transitions. [2022-01-19 06:19:37,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 309 transitions, 1504 flow [2022-01-19 06:19:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 06:19:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 06:19:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3527 transitions. [2022-01-19 06:19:37,790 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6107359307359307 [2022-01-19 06:19:37,790 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3527 transitions. [2022-01-19 06:19:37,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3527 transitions. [2022-01-19 06:19:37,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:19:37,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3527 transitions. [2022-01-19 06:19:37,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 167.95238095238096) internal successors, (3527), 21 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:37,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 275.0) internal successors, (6050), 22 states have internal predecessors, (6050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:37,796 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 275.0) internal successors, (6050), 22 states have internal predecessors, (6050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:37,796 INFO L186 Difference]: Start difference. First operand has 260 places, 231 transitions, 837 flow. Second operand 21 states and 3527 transitions. [2022-01-19 06:19:37,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 309 transitions, 1504 flow [2022-01-19 06:19:37,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 309 transitions, 1479 flow, removed 2 selfloop flow, removed 9 redundant places. [2022-01-19 06:19:37,809 INFO L242 Difference]: Finished difference. Result has 283 places, 264 transitions, 1226 flow [2022-01-19 06:19:37,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1226, PETRI_PLACES=283, PETRI_TRANSITIONS=264} [2022-01-19 06:19:37,810 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 48 predicate places. [2022-01-19 06:19:37,810 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 264 transitions, 1226 flow [2022-01-19 06:19:37,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 164.5) internal successors, (4277), 26 states have internal predecessors, (4277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:37,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:19:37,810 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:19:37,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-19 06:19:38,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:19:38,027 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:19:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:19:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1345551224, now seen corresponding path program 2 times [2022-01-19 06:19:38,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:19:38,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108119385] [2022-01-19 06:19:38,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:19:38,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:19:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:19:38,210 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:19:38,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:19:38,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108119385] [2022-01-19 06:19:38,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108119385] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:19:38,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298496074] [2022-01-19 06:19:38,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:19:38,211 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:19:38,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:19:38,212 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:19:38,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-19 06:19:38,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:19:38,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:19:38,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:19:38,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:19:38,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:19:38,670 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:19:38,670 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:19:38,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:19:38,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:19:38,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:19:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:19:38,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:19:38,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_746) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:19:38,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_746) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:19:39,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:19:39,451 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:19:39,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:19:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 4 not checked. [2022-01-19 06:19:39,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298496074] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:19:39,464 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:19:39,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:19:39,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458302935] [2022-01-19 06:19:39,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:19:39,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:19:39,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:19:39,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:19:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=472, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:19:39,467 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 275 [2022-01-19 06:19:39,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 264 transitions, 1226 flow. Second operand has 26 states, 26 states have (on average 164.5) internal successors, (4277), 26 states have internal predecessors, (4277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:19:39,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:19:39,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 275 [2022-01-19 06:19:39,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:20:05,544 WARN L228 SmtUtils]: Spent 26.02s on a formula simplification. DAG size of input: 32 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:20:23,572 WARN L228 SmtUtils]: Spent 18.02s on a formula simplification. DAG size of input: 26 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:20:24,563 INFO L129 PetriNetUnfolder]: 1853/5960 cut-off events. [2022-01-19 06:20:24,564 INFO L130 PetriNetUnfolder]: For 16247/16288 co-relation queries the response was YES. [2022-01-19 06:20:24,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15586 conditions, 5960 events. 1853/5960 cut-off events. For 16247/16288 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 63223 event pairs, 770 based on Foata normal form. 41/5826 useless extension candidates. Maximal degree in co-relation 15329. Up to 1047 conditions per place. [2022-01-19 06:20:24,610 INFO L132 encePairwiseOnDemand]: 259/275 looper letters, 169 selfloop transitions, 33 changer transitions 45/399 dead transitions. [2022-01-19 06:20:24,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 399 transitions, 2385 flow [2022-01-19 06:20:24,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 06:20:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 06:20:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2926 transitions. [2022-01-19 06:20:24,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6258823529411764 [2022-01-19 06:20:24,612 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2926 transitions. [2022-01-19 06:20:24,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2926 transitions. [2022-01-19 06:20:24,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:20:24,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2926 transitions. [2022-01-19 06:20:24,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 172.11764705882354) internal successors, (2926), 17 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:24,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 275.0) internal successors, (4950), 18 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:24,617 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 275.0) internal successors, (4950), 18 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:24,617 INFO L186 Difference]: Start difference. First operand has 283 places, 264 transitions, 1226 flow. Second operand 17 states and 2926 transitions. [2022-01-19 06:20:24,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 399 transitions, 2385 flow [2022-01-19 06:20:24,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 399 transitions, 2301 flow, removed 38 selfloop flow, removed 5 redundant places. [2022-01-19 06:20:24,650 INFO L242 Difference]: Finished difference. Result has 297 places, 281 transitions, 1431 flow [2022-01-19 06:20:24,651 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1431, PETRI_PLACES=297, PETRI_TRANSITIONS=281} [2022-01-19 06:20:24,651 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 62 predicate places. [2022-01-19 06:20:24,651 INFO L470 AbstractCegarLoop]: Abstraction has has 297 places, 281 transitions, 1431 flow [2022-01-19 06:20:24,652 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 164.5) internal successors, (4277), 26 states have internal predecessors, (4277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:24,652 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:20:24,652 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:20:24,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-19 06:20:24,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-19 06:20:24,886 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:20:24,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:20:24,886 INFO L85 PathProgramCache]: Analyzing trace with hash -278495548, now seen corresponding path program 1 times [2022-01-19 06:20:24,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:20:24,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413723551] [2022-01-19 06:20:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:20:24,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:20:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:20:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:20:25,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:20:25,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413723551] [2022-01-19 06:20:25,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413723551] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:20:25,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932570596] [2022-01-19 06:20:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:20:25,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:20:25,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:20:25,135 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:20:25,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-19 06:20:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:20:25,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:20:25,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:20:25,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:20:25,608 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:20:25,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:20:25,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:20:25,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:20:25,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:20:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2022-01-19 06:20:25,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:20:25,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_811) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:20:26,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:20:26,360 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:20:26,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:20:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 1 not checked. [2022-01-19 06:20:26,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932570596] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:20:26,372 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:20:26,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:20:26,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15047701] [2022-01-19 06:20:26,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:20:26,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:20:26,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:20:26,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:20:26,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=510, Unknown=1, NotChecked=46, Total=650 [2022-01-19 06:20:26,374 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 275 [2022-01-19 06:20:26,376 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 281 transitions, 1431 flow. Second operand has 26 states, 26 states have (on average 164.6153846153846) internal successors, (4280), 26 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:20:26,376 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:20:26,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 275 [2022-01-19 06:20:26,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:20:50,438 WARN L228 SmtUtils]: Spent 24.02s on a formula simplification. DAG size of input: 29 DAG size of output: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:21:08,465 WARN L228 SmtUtils]: Spent 18.02s on a formula simplification. DAG size of input: 23 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:21:09,607 INFO L129 PetriNetUnfolder]: 2318/7829 cut-off events. [2022-01-19 06:21:09,607 INFO L130 PetriNetUnfolder]: For 21419/21606 co-relation queries the response was YES. [2022-01-19 06:21:09,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20062 conditions, 7829 events. 2318/7829 cut-off events. For 21419/21606 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 88075 event pairs, 1078 based on Foata normal form. 88/7611 useless extension candidates. Maximal degree in co-relation 19797. Up to 3455 conditions per place. [2022-01-19 06:21:09,663 INFO L132 encePairwiseOnDemand]: 259/275 looper letters, 111 selfloop transitions, 30 changer transitions 23/346 dead transitions. [2022-01-19 06:21:09,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 346 transitions, 2183 flow [2022-01-19 06:21:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 06:21:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 06:21:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2538 transitions. [2022-01-19 06:21:09,665 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6152727272727273 [2022-01-19 06:21:09,665 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2538 transitions. [2022-01-19 06:21:09,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2538 transitions. [2022-01-19 06:21:09,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:21:09,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2538 transitions. [2022-01-19 06:21:09,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 169.2) internal successors, (2538), 15 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:09,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 275.0) internal successors, (4400), 16 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:09,670 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 275.0) internal successors, (4400), 16 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:09,670 INFO L186 Difference]: Start difference. First operand has 297 places, 281 transitions, 1431 flow. Second operand 15 states and 2538 transitions. [2022-01-19 06:21:09,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 346 transitions, 2183 flow [2022-01-19 06:21:09,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 346 transitions, 2144 flow, removed 10 selfloop flow, removed 9 redundant places. [2022-01-19 06:21:09,699 INFO L242 Difference]: Finished difference. Result has 307 places, 304 transitions, 1757 flow [2022-01-19 06:21:09,699 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1757, PETRI_PLACES=307, PETRI_TRANSITIONS=304} [2022-01-19 06:21:09,700 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 72 predicate places. [2022-01-19 06:21:09,700 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 304 transitions, 1757 flow [2022-01-19 06:21:09,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 164.6153846153846) internal successors, (4280), 26 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:09,700 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:21:09,700 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:21:09,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-19 06:21:09,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:09,918 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:21:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:21:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash -81971299, now seen corresponding path program 1 times [2022-01-19 06:21:09,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:21:09,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888306569] [2022-01-19 06:21:09,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:09,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:21:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-19 06:21:10,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:21:10,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888306569] [2022-01-19 06:21:10,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888306569] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:21:10,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439183659] [2022-01-19 06:21:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:21:10,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:21:10,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:21:10,151 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:21:10,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-19 06:21:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:21:10,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 06:21:10,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:21:10,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:21:10,660 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:21:10,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:21:10,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:21:10,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:21:10,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:21:10,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:21:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-19 06:21:10,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:21:10,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_881) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:21:11,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_881 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_881) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:21:11,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:21:11,502 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:21:11,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:21:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 13 not checked. [2022-01-19 06:21:11,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439183659] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:21:11,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:21:11,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 26 [2022-01-19 06:21:11,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584202108] [2022-01-19 06:21:11,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:21:11,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:21:11,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:21:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:21:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=469, Unknown=2, NotChecked=90, Total=650 [2022-01-19 06:21:11,518 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 275 [2022-01-19 06:21:11,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 304 transitions, 1757 flow. Second operand has 26 states, 26 states have (on average 164.6153846153846) internal successors, (4280), 26 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:21:11,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:21:11,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 275 [2022-01-19 06:21:11,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:21:35,600 WARN L228 SmtUtils]: Spent 24.03s on a formula simplification. DAG size of input: 29 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:22:03,662 WARN L228 SmtUtils]: Spent 28.04s on a formula simplification. DAG size of input: 33 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:22:23,688 WARN L228 SmtUtils]: Spent 20.02s on a formula simplification. DAG size of input: 25 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:22:25,356 INFO L129 PetriNetUnfolder]: 2542/9824 cut-off events. [2022-01-19 06:22:25,356 INFO L130 PetriNetUnfolder]: For 27250/27307 co-relation queries the response was YES. [2022-01-19 06:22:25,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25844 conditions, 9824 events. 2542/9824 cut-off events. For 27250/27307 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 117583 event pairs, 767 based on Foata normal form. 65/9625 useless extension candidates. Maximal degree in co-relation 25572. Up to 3154 conditions per place. [2022-01-19 06:22:25,416 INFO L132 encePairwiseOnDemand]: 251/275 looper letters, 176 selfloop transitions, 203 changer transitions 46/581 dead transitions. [2022-01-19 06:22:25,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 581 transitions, 4191 flow [2022-01-19 06:22:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 06:22:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 06:22:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5000 transitions. [2022-01-19 06:22:25,419 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6269592476489029 [2022-01-19 06:22:25,419 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5000 transitions. [2022-01-19 06:22:25,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5000 transitions. [2022-01-19 06:22:25,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:22:25,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5000 transitions. [2022-01-19 06:22:25,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 172.41379310344828) internal successors, (5000), 29 states have internal predecessors, (5000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:25,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 275.0) internal successors, (8250), 30 states have internal predecessors, (8250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:25,429 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 275.0) internal successors, (8250), 30 states have internal predecessors, (8250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:25,429 INFO L186 Difference]: Start difference. First operand has 307 places, 304 transitions, 1757 flow. Second operand 29 states and 5000 transitions. [2022-01-19 06:22:25,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 581 transitions, 4191 flow [2022-01-19 06:22:25,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 581 transitions, 4043 flow, removed 66 selfloop flow, removed 7 redundant places. [2022-01-19 06:22:25,500 INFO L242 Difference]: Finished difference. Result has 343 places, 475 transitions, 3476 flow [2022-01-19 06:22:25,500 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3476, PETRI_PLACES=343, PETRI_TRANSITIONS=475} [2022-01-19 06:22:25,500 INFO L334 CegarLoopForPetriNet]: 235 programPoint places, 108 predicate places. [2022-01-19 06:22:25,500 INFO L470 AbstractCegarLoop]: Abstraction has has 343 places, 475 transitions, 3476 flow [2022-01-19 06:22:25,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 164.6153846153846) internal successors, (4280), 26 states have internal predecessors, (4280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:25,501 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:22:25,501 INFO L254 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:22:25,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-19 06:22:25,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:25,704 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-19 06:22:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:22:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1495717173, now seen corresponding path program 2 times [2022-01-19 06:22:25,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:22:25,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383582758] [2022-01-19 06:22:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:22:25,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:22:25,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:22:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-01-19 06:22:26,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:22:26,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383582758] [2022-01-19 06:22:26,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383582758] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:22:26,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419499922] [2022-01-19 06:22:26,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:22:26,762 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:22:26,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:22:26,763 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 06:22:26,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-19 06:22:26,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:22:26,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:22:26,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-19 06:22:26,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:22:26,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-01-19 06:22:27,293 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 06:22:27,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 06:22:27,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:22:27,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:22:27,491 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-19 06:22:27,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-19 06:22:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-01-19 06:22:27,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:22:27,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_951) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:22:27,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_951) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2022-01-19 06:22:28,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 06:22:28,137 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-19 06:22:28,137 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-19 06:22:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 13 not checked. [2022-01-19 06:22:28,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419499922] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:22:28,151 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:22:28,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 35 [2022-01-19 06:22:28,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815906543] [2022-01-19 06:22:28,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:22:28,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 06:22:28,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:22:28,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 06:22:28,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=933, Unknown=2, NotChecked=126, Total=1190 [2022-01-19 06:22:28,154 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 275 [2022-01-19 06:22:28,156 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 475 transitions, 3476 flow. Second operand has 35 states, 35 states have (on average 151.37142857142857) internal successors, (5298), 35 states have internal predecessors, (5298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:22:28,156 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:22:28,156 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 275 [2022-01-19 06:22:28,156 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:23:16,322 WARN L228 SmtUtils]: Spent 48.04s on a formula simplification. DAG size of input: 37 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:24:06,380 WARN L228 SmtUtils]: Spent 50.05s on a formula simplification. DAG size of input: 39 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:24:36,426 WARN L228 SmtUtils]: Spent 30.03s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:12,569 WARN L228 SmtUtils]: Spent 36.03s on a formula simplification. DAG size of input: 33 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:20,790 WARN L228 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 47 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:28,874 WARN L228 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 55 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:38,957 WARN L228 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 93 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:25:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 06:25:39,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-19 06:25:39,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:25:39,208 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: at most one deprecated predicate at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:452) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:433) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:171) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:197) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:212) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:137) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:208) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:167) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:128) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:65) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:120) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:509) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:280) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-19 06:25:39,210 INFO L158 Benchmark]: Toolchain (without parser) took 516207.96ms. Allocated memory was 453.0MB in the beginning and 1.0GB in the end (delta: 570.4MB). Free memory was 392.7MB in the beginning and 390.4MB in the end (delta: 2.3MB). Peak memory consumption was 574.5MB. Max. memory is 16.0GB. [2022-01-19 06:25:39,211 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 453.0MB. Free memory was 410.8MB in the beginning and 410.7MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:25:39,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.91ms. Allocated memory was 453.0MB in the beginning and 631.2MB in the end (delta: 178.3MB). Free memory was 392.5MB in the beginning and 582.2MB in the end (delta: -189.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.0GB. [2022-01-19 06:25:39,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.05ms. Allocated memory is still 631.2MB. Free memory was 582.2MB in the beginning and 579.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:25:39,211 INFO L158 Benchmark]: Boogie Preprocessor took 31.15ms. Allocated memory is still 631.2MB. Free memory was 579.0MB in the beginning and 576.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:25:39,211 INFO L158 Benchmark]: RCFGBuilder took 338.46ms. Allocated memory is still 631.2MB. Free memory was 576.9MB in the beginning and 557.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-19 06:25:39,211 INFO L158 Benchmark]: TraceAbstraction took 515275.99ms. Allocated memory was 631.2MB in the beginning and 1.0GB in the end (delta: 392.2MB). Free memory was 557.0MB in the beginning and 390.4MB in the end (delta: 166.6MB). Peak memory consumption was 557.7MB. Max. memory is 16.0GB. [2022-01-19 06:25:39,212 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.10ms. Allocated memory is still 453.0MB. Free memory was 410.8MB in the beginning and 410.7MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 500.91ms. Allocated memory was 453.0MB in the beginning and 631.2MB in the end (delta: 178.3MB). Free memory was 392.5MB in the beginning and 582.2MB in the end (delta: -189.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.05ms. Allocated memory is still 631.2MB. Free memory was 582.2MB in the beginning and 579.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.15ms. Allocated memory is still 631.2MB. Free memory was 579.0MB in the beginning and 576.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 338.46ms. Allocated memory is still 631.2MB. Free memory was 576.9MB in the beginning and 557.0MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 515275.99ms. Allocated memory was 631.2MB in the beginning and 1.0GB in the end (delta: 392.2MB). Free memory was 557.0MB in the beginning and 390.4MB in the end (delta: 166.6MB). Peak memory consumption was 557.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: at most one deprecated predicate de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: at most one deprecated predicate: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:980) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-19 06:25:39,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...