/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-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 12:31:47,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 12:31:47,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 12:31:47,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 12:31:47,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 12:31:47,814 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 12:31:47,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 12:31:47,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 12:31:47,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 12:31:47,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 12:31:47,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 12:31:47,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 12:31:47,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 12:31:47,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 12:31:47,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 12:31:47,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 12:31:47,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 12:31:47,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 12:31:47,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 12:31:47,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 12:31:47,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 12:31:47,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 12:31:47,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 12:31:47,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 12:31:47,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 12:31:47,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 12:31:47,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 12:31:47,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 12:31:47,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 12:31:47,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 12:31:47,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 12:31:47,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 12:31:47,864 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 12:31:47,864 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 12:31:47,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 12:31:47,865 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 12:31:47,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 12:31:47,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 12:31:47,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 12:31:47,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 12:31:47,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 12:31:47,868 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-After.epf [2022-01-19 12:31:47,899 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 12:31:47,899 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 12:31:47,900 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 12:31:47,900 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 12:31:47,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 12:31:47,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 12:31:47,900 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 12:31:47,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 12:31:47,901 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 12:31:47,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 12:31:47,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 12:31:47,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 12:31:47,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 12:31:47,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 12:31:47,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 12:31:47,902 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 12:31:47,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 12:31:47,902 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 12:31:47,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 12:31:47,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 12:31:47,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 12:31:47,902 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 12:31:47,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 12:31:47,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:31:47,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 12:31:47,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 12:31:47,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 12:31:47,906 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 12:31:47,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 12:31:47,907 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 12:31:47,907 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 12:31:47,907 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 12:31:47,907 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 12:31:48,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 12:31:48,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 12:31:48,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 12:31:48,168 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 12:31:48,168 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 12:31:48,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-01-19 12:31:48,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f268949/0d519de907344e41b7f1aecc55c2af37/FLAGb8dec72f0 [2022-01-19 12:31:48,644 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 12:31:48,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-01-19 12:31:48,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f268949/0d519de907344e41b7f1aecc55c2af37/FLAGb8dec72f0 [2022-01-19 12:31:48,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35f268949/0d519de907344e41b7f1aecc55c2af37 [2022-01-19 12:31:48,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 12:31:48,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 12:31:48,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 12:31:48,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 12:31:48,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 12:31:48,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:31:48" (1/1) ... [2022-01-19 12:31:48,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b56901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:48, skipping insertion in model container [2022-01-19 12:31:48,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:31:48" (1/1) ... [2022-01-19 12:31:48,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 12:31:49,019 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 12:31:49,178 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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2022-01-19 12:31:49,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:31:49,369 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 12:31:49,381 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/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2022-01-19 12:31:49,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:31:49,462 INFO L208 MainTranslator]: Completed translation [2022-01-19 12:31:49,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49 WrapperNode [2022-01-19 12:31:49,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 12:31:49,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 12:31:49,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 12:31:49,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 12:31:49,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,503 INFO L137 Inliner]: procedures = 165, calls = 42, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 139 [2022-01-19 12:31:49,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 12:31:49,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 12:31:49,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 12:31:49,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 12:31:49,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,514 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 12:31:49,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 12:31:49,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 12:31:49,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 12:31:49,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (1/1) ... [2022-01-19 12:31:49,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:31:49,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:31:49,552 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 12:31:49,565 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 12:31:49,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 12:31:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 12:31:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 12:31:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 12:31:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-01-19 12:31:49,589 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-01-19 12:31:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 12:31:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 12:31:49,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 12:31:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 12:31:49,591 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 12:31:49,695 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 12:31:49,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 12:31:50,023 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 12:31:50,034 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 12:31:50,036 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 12:31:50,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:31:50 BoogieIcfgContainer [2022-01-19 12:31:50,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 12:31:50,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 12:31:50,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 12:31:50,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 12:31:50,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:31:48" (1/3) ... [2022-01-19 12:31:50,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1403bc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:31:50, skipping insertion in model container [2022-01-19 12:31:50,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:31:49" (2/3) ... [2022-01-19 12:31:50,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1403bc70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:31:50, skipping insertion in model container [2022-01-19 12:31:50,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:31:50" (3/3) ... [2022-01-19 12:31:50,046 INFO L111 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2022-01-19 12:31:50,050 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 12:31:50,050 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-19 12:31:50,051 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 12:31:50,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,108 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,109 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,110 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,111 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,113 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,114 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,115 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,116 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,117 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,118 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,119 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,120 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,121 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,122 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,123 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,124 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,125 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,126 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 12:31:50,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,126 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,126 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 12:31:50,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,127 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 12:31:50,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,127 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 12:31:50,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,127 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,128 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,129 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,129 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 12:31:50,130 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,131 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 12:31:50,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,131 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,132 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 12:31:50,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,132 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 12:31:50,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,132 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,133 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,134 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,135 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,136 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,137 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,139 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,143 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,144 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,145 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,146 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,146 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 12:31:50,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,147 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,147 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 12:31:50,147 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 12:31:50,148 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 12:31:50,148 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 12:31:50,148 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 12:31:50,148 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 12:31:50,148 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 12:31:50,148 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 12:31:50,148 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 12:31:50,148 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 12:31:50,149 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 12:31:50,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,149 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 12:31:50,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,149 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,149 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 12:31:50,150 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 12:31:50,150 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 12:31:50,150 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 12:31:50,150 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 12:31:50,150 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 12:31:50,150 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 12:31:50,150 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 12:31:50,151 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 12:31:50,151 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 12:31:50,151 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 12:31:50,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,152 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,153 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,154 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,154 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,154 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,154 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,154 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,154 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,155 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,155 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,155 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,155 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 12:31:50,156 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,156 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,156 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 12:31:50,157 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,157 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,157 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 12:31:50,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,158 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 12:31:50,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,158 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,166 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~y~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,167 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~z~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,168 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 12:31:50,168 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 12:31:50,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,168 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,169 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 12:31:50,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,169 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:31:50,171 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 12:31:50,223 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 12:31:50,236 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 12:31:50,237 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 12:31:50,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 183 transitions, 371 flow [2022-01-19 12:31:50,340 INFO L129 PetriNetUnfolder]: 8/186 cut-off events. [2022-01-19 12:31:50,340 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 12:31:50,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 186 events. 8/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 163 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-01-19 12:31:50,346 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 183 transitions, 371 flow [2022-01-19 12:31:50,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 181 transitions, 365 flow [2022-01-19 12:31:50,390 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2022-01-19 12:31:50,390 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 12:31:50,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:50,391 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, 1, 1, 1] [2022-01-19 12:31:50,391 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:50,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:50,396 INFO L85 PathProgramCache]: Analyzing trace with hash -930805020, now seen corresponding path program 1 times [2022-01-19 12:31:50,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463625359] [2022-01-19 12:31:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:50,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:50,771 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 12:31:50,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:50,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463625359] [2022-01-19 12:31:50,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463625359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:50,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:50,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 12:31:50,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273838464] [2022-01-19 12:31:50,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:50,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 12:31:50,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:50,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 12:31:50,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 12:31:50,816 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183 [2022-01-19 12:31:50,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 181 transitions, 365 flow. Second operand has 8 states, 8 states have (on average 146.5) internal successors, (1172), 8 states have internal predecessors, (1172), 0 states have call successors, (0), 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 12:31:50,824 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:50,824 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183 [2022-01-19 12:31:50,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:51,216 INFO L129 PetriNetUnfolder]: 95/1143 cut-off events. [2022-01-19 12:31:51,216 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 12:31:51,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1143 events. 95/1143 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7387 event pairs, 25 based on Foata normal form. 93/1163 useless extension candidates. Maximal degree in co-relation 1332. Up to 89 conditions per place. [2022-01-19 12:31:51,223 INFO L132 encePairwiseOnDemand]: 161/183 looper letters, 52 selfloop transitions, 38 changer transitions 11/239 dead transitions. [2022-01-19 12:31:51,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 239 transitions, 673 flow [2022-01-19 12:31:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 12:31:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 12:31:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2885 transitions. [2022-01-19 12:31:51,243 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8297382801265458 [2022-01-19 12:31:51,243 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2885 transitions. [2022-01-19 12:31:51,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2885 transitions. [2022-01-19 12:31:51,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:51,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2885 transitions. [2022-01-19 12:31:51,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 151.8421052631579) internal successors, (2885), 19 states have internal predecessors, (2885), 0 states have call successors, (0), 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 12:31:51,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 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 12:31:51,270 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 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 12:31:51,271 INFO L186 Difference]: Start difference. First operand has 177 places, 181 transitions, 365 flow. Second operand 19 states and 2885 transitions. [2022-01-19 12:31:51,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 239 transitions, 673 flow [2022-01-19 12:31:51,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 239 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 12:31:51,280 INFO L242 Difference]: Finished difference. Result has 196 places, 197 transitions, 514 flow [2022-01-19 12:31:51,281 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=514, PETRI_PLACES=196, PETRI_TRANSITIONS=197} [2022-01-19 12:31:51,284 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 19 predicate places. [2022-01-19 12:31:51,284 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 514 flow [2022-01-19 12:31:51,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 146.5) internal successors, (1172), 8 states have internal predecessors, (1172), 0 states have call successors, (0), 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 12:31:51,285 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:51,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:31:51,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 12:31:51,286 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:51,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1816353862, now seen corresponding path program 1 times [2022-01-19 12:31:51,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:51,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133782381] [2022-01-19 12:31:51,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:51,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:51,411 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 12:31:51,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:51,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133782381] [2022-01-19 12:31:51,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133782381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:51,412 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:51,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:31:51,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645268263] [2022-01-19 12:31:51,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:51,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:31:51,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:51,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:31:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:31:51,416 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 183 [2022-01-19 12:31:51,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 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 12:31:51,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:51,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 183 [2022-01-19 12:31:51,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:51,554 INFO L129 PetriNetUnfolder]: 19/584 cut-off events. [2022-01-19 12:31:51,554 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-01-19 12:31:51,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 584 events. 19/584 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2345 event pairs, 6 based on Foata normal form. 8/573 useless extension candidates. Maximal degree in co-relation 735. Up to 36 conditions per place. [2022-01-19 12:31:51,557 INFO L132 encePairwiseOnDemand]: 175/183 looper letters, 24 selfloop transitions, 8 changer transitions 0/180 dead transitions. [2022-01-19 12:31:51,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 180 transitions, 487 flow [2022-01-19 12:31:51,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 12:31:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 12:31:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 765 transitions. [2022-01-19 12:31:51,582 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8360655737704918 [2022-01-19 12:31:51,583 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 765 transitions. [2022-01-19 12:31:51,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 765 transitions. [2022-01-19 12:31:51,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:51,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 765 transitions. [2022-01-19 12:31:51,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 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 12:31:51,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 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 12:31:51,587 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 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 12:31:51,587 INFO L186 Difference]: Start difference. First operand has 196 places, 197 transitions, 514 flow. Second operand 5 states and 765 transitions. [2022-01-19 12:31:51,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 180 transitions, 487 flow [2022-01-19 12:31:51,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 180 transitions, 479 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-01-19 12:31:51,597 INFO L242 Difference]: Finished difference. Result has 183 places, 174 transitions, 427 flow [2022-01-19 12:31:51,598 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=183, PETRI_TRANSITIONS=174} [2022-01-19 12:31:51,598 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 6 predicate places. [2022-01-19 12:31:51,598 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 174 transitions, 427 flow [2022-01-19 12:31:51,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 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 12:31:51,599 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:51,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:31:51,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 12:31:51,600 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:51,601 INFO L85 PathProgramCache]: Analyzing trace with hash 621951114, now seen corresponding path program 1 times [2022-01-19 12:31:51,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:51,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804752681] [2022-01-19 12:31:51,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:51,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:51,763 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 12:31:51,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804752681] [2022-01-19 12:31:51,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804752681] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:51,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:51,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 12:31:51,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450489682] [2022-01-19 12:31:51,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:51,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 12:31:51,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 12:31:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 12:31:51,768 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 183 [2022-01-19 12:31:51,769 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 174 transitions, 427 flow. Second operand has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 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 12:31:51,769 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:51,769 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 183 [2022-01-19 12:31:51,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:51,902 INFO L129 PetriNetUnfolder]: 9/473 cut-off events. [2022-01-19 12:31:51,902 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-01-19 12:31:51,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 473 events. 9/473 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1489 event pairs, 0 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 604. Up to 58 conditions per place. [2022-01-19 12:31:51,904 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 29 selfloop transitions, 15 changer transitions 2/183 dead transitions. [2022-01-19 12:31:51,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 183 transitions, 533 flow [2022-01-19 12:31:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 12:31:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 12:31:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1495 transitions. [2022-01-19 12:31:51,907 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8169398907103825 [2022-01-19 12:31:51,907 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1495 transitions. [2022-01-19 12:31:51,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1495 transitions. [2022-01-19 12:31:51,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:51,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1495 transitions. [2022-01-19 12:31:51,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 149.5) internal successors, (1495), 10 states have internal predecessors, (1495), 0 states have call successors, (0), 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 12:31:51,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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 12:31:51,914 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 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 12:31:51,914 INFO L186 Difference]: Start difference. First operand has 183 places, 174 transitions, 427 flow. Second operand 10 states and 1495 transitions. [2022-01-19 12:31:51,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 183 transitions, 533 flow [2022-01-19 12:31:51,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 183 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 12:31:51,919 INFO L242 Difference]: Finished difference. Result has 192 places, 174 transitions, 468 flow [2022-01-19 12:31:51,919 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=468, PETRI_PLACES=192, PETRI_TRANSITIONS=174} [2022-01-19 12:31:51,920 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 15 predicate places. [2022-01-19 12:31:51,920 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 174 transitions, 468 flow [2022-01-19 12:31:51,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 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 12:31:51,921 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:51,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:51,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 12:31:51,921 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash 280756634, now seen corresponding path program 1 times [2022-01-19 12:31:51,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:51,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281787292] [2022-01-19 12:31:51,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:51,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:52,104 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 12:31:52,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:52,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281787292] [2022-01-19 12:31:52,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281787292] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:52,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:52,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 12:31:52,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658245896] [2022-01-19 12:31:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:52,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 12:31:52,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:52,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 12:31:52,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-01-19 12:31:52,113 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 183 [2022-01-19 12:31:52,115 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 174 transitions, 468 flow. Second operand has 13 states, 13 states have (on average 132.15384615384616) internal successors, (1718), 13 states have internal predecessors, (1718), 0 states have call successors, (0), 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 12:31:52,115 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:52,115 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 183 [2022-01-19 12:31:52,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:52,553 INFO L129 PetriNetUnfolder]: 42/496 cut-off events. [2022-01-19 12:31:52,554 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-01-19 12:31:52,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 496 events. 42/496 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1747 event pairs, 0 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 739. Up to 38 conditions per place. [2022-01-19 12:31:52,556 INFO L132 encePairwiseOnDemand]: 164/183 looper letters, 70 selfloop transitions, 25 changer transitions 0/218 dead transitions. [2022-01-19 12:31:52,556 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 218 transitions, 782 flow [2022-01-19 12:31:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 12:31:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 12:31:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2306 transitions. [2022-01-19 12:31:52,561 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7412407585985213 [2022-01-19 12:31:52,561 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2306 transitions. [2022-01-19 12:31:52,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2306 transitions. [2022-01-19 12:31:52,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:52,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2306 transitions. [2022-01-19 12:31:52,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 135.64705882352942) internal successors, (2306), 17 states have internal predecessors, (2306), 0 states have call successors, (0), 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 12:31:52,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 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 12:31:52,573 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 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 12:31:52,573 INFO L186 Difference]: Start difference. First operand has 192 places, 174 transitions, 468 flow. Second operand 17 states and 2306 transitions. [2022-01-19 12:31:52,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 218 transitions, 782 flow [2022-01-19 12:31:52,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 218 transitions, 757 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 12:31:52,581 INFO L242 Difference]: Finished difference. Result has 207 places, 183 transitions, 576 flow [2022-01-19 12:31:52,581 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=576, PETRI_PLACES=207, PETRI_TRANSITIONS=183} [2022-01-19 12:31:52,582 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 30 predicate places. [2022-01-19 12:31:52,582 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 183 transitions, 576 flow [2022-01-19 12:31:52,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 132.15384615384616) internal successors, (1718), 13 states have internal predecessors, (1718), 0 states have call successors, (0), 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 12:31:52,583 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:52,583 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:52,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 12:31:52,584 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:52,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:52,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1867276529, now seen corresponding path program 1 times [2022-01-19 12:31:52,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:52,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725896429] [2022-01-19 12:31:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:52,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:52,707 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 12:31:52,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:52,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725896429] [2022-01-19 12:31:52,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725896429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:52,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:52,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 12:31:52,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869143270] [2022-01-19 12:31:52,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:52,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 12:31:52,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 12:31:52,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 12:31:52,711 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 183 [2022-01-19 12:31:52,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 183 transitions, 576 flow. Second operand has 8 states, 8 states have (on average 142.375) internal successors, (1139), 8 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:52,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:52,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 183 [2022-01-19 12:31:52,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:52,888 INFO L129 PetriNetUnfolder]: 12/462 cut-off events. [2022-01-19 12:31:52,888 INFO L130 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-01-19 12:31:52,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 462 events. 12/462 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1429 event pairs, 0 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 699. Up to 32 conditions per place. [2022-01-19 12:31:52,890 INFO L132 encePairwiseOnDemand]: 171/183 looper letters, 48 selfloop transitions, 18 changer transitions 0/198 dead transitions. [2022-01-19 12:31:52,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 198 transitions, 740 flow [2022-01-19 12:31:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 12:31:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 12:31:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1607 transitions. [2022-01-19 12:31:52,894 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7983109786388475 [2022-01-19 12:31:52,894 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1607 transitions. [2022-01-19 12:31:52,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1607 transitions. [2022-01-19 12:31:52,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:52,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1607 transitions. [2022-01-19 12:31:52,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 146.0909090909091) internal successors, (1607), 11 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:52,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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 12:31:52,902 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 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 12:31:52,902 INFO L186 Difference]: Start difference. First operand has 207 places, 183 transitions, 576 flow. Second operand 11 states and 1607 transitions. [2022-01-19 12:31:52,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 198 transitions, 740 flow [2022-01-19 12:31:52,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 198 transitions, 714 flow, removed 4 selfloop flow, removed 8 redundant places. [2022-01-19 12:31:52,909 INFO L242 Difference]: Finished difference. Result has 207 places, 181 transitions, 578 flow [2022-01-19 12:31:52,909 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=578, PETRI_PLACES=207, PETRI_TRANSITIONS=181} [2022-01-19 12:31:52,912 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 30 predicate places. [2022-01-19 12:31:52,912 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 181 transitions, 578 flow [2022-01-19 12:31:52,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 142.375) internal successors, (1139), 8 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:52,912 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:52,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:52,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 12:31:52,913 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash -590826818, now seen corresponding path program 1 times [2022-01-19 12:31:52,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:52,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902782811] [2022-01-19 12:31:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:52,914 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:53,074 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 12:31:53,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:53,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902782811] [2022-01-19 12:31:53,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902782811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:53,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:53,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 12:31:53,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664320281] [2022-01-19 12:31:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:53,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 12:31:53,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:53,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 12:31:53,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-01-19 12:31:53,079 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 183 [2022-01-19 12:31:53,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 181 transitions, 578 flow. Second operand has 13 states, 13 states have (on average 136.46153846153845) internal successors, (1774), 13 states have internal predecessors, (1774), 0 states have call successors, (0), 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 12:31:53,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:53,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 183 [2022-01-19 12:31:53,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:53,410 INFO L129 PetriNetUnfolder]: 36/545 cut-off events. [2022-01-19 12:31:53,410 INFO L130 PetriNetUnfolder]: For 221/221 co-relation queries the response was YES. [2022-01-19 12:31:53,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 974 conditions, 545 events. 36/545 cut-off events. For 221/221 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2014 event pairs, 13 based on Foata normal form. 1/537 useless extension candidates. Maximal degree in co-relation 906. Up to 85 conditions per place. [2022-01-19 12:31:53,412 INFO L132 encePairwiseOnDemand]: 165/183 looper letters, 38 selfloop transitions, 10 changer transitions 26/200 dead transitions. [2022-01-19 12:31:53,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 200 transitions, 762 flow [2022-01-19 12:31:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 12:31:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 12:31:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2210 transitions. [2022-01-19 12:31:53,417 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7547814207650273 [2022-01-19 12:31:53,417 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2210 transitions. [2022-01-19 12:31:53,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2210 transitions. [2022-01-19 12:31:53,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:53,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2210 transitions. [2022-01-19 12:31:53,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 138.125) internal successors, (2210), 16 states have internal predecessors, (2210), 0 states have call successors, (0), 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 12:31:53,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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 12:31:53,427 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 183.0) internal successors, (3111), 17 states have internal predecessors, (3111), 0 states have call successors, (0), 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 12:31:53,427 INFO L186 Difference]: Start difference. First operand has 207 places, 181 transitions, 578 flow. Second operand 16 states and 2210 transitions. [2022-01-19 12:31:53,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 200 transitions, 762 flow [2022-01-19 12:31:53,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 200 transitions, 704 flow, removed 9 selfloop flow, removed 11 redundant places. [2022-01-19 12:31:53,432 INFO L242 Difference]: Finished difference. Result has 221 places, 170 transitions, 497 flow [2022-01-19 12:31:53,433 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=497, PETRI_PLACES=221, PETRI_TRANSITIONS=170} [2022-01-19 12:31:53,433 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 44 predicate places. [2022-01-19 12:31:53,433 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 170 transitions, 497 flow [2022-01-19 12:31:53,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 136.46153846153845) internal successors, (1774), 13 states have internal predecessors, (1774), 0 states have call successors, (0), 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 12:31:53,434 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:53,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:53,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 12:31:53,434 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:53,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2141442280, now seen corresponding path program 1 times [2022-01-19 12:31:53,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:53,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907069202] [2022-01-19 12:31:53,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:53,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:53,627 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 12:31:53,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:53,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907069202] [2022-01-19 12:31:53,627 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907069202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:53,631 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:53,631 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 12:31:53,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451949275] [2022-01-19 12:31:53,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:53,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 12:31:53,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:53,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 12:31:53,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-19 12:31:53,633 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 183 [2022-01-19 12:31:53,634 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 170 transitions, 497 flow. Second operand has 8 states, 8 states have (on average 143.125) internal successors, (1145), 8 states have internal predecessors, (1145), 0 states have call successors, (0), 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 12:31:53,634 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:53,634 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 183 [2022-01-19 12:31:53,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:53,749 INFO L129 PetriNetUnfolder]: 15/339 cut-off events. [2022-01-19 12:31:53,750 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-01-19 12:31:53,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 339 events. 15/339 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 790 event pairs, 7 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 559. Up to 30 conditions per place. [2022-01-19 12:31:53,752 INFO L132 encePairwiseOnDemand]: 176/183 looper letters, 29 selfloop transitions, 7 changer transitions 5/170 dead transitions. [2022-01-19 12:31:53,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 170 transitions, 547 flow [2022-01-19 12:31:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:31:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:31:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 876 transitions. [2022-01-19 12:31:53,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7978142076502732 [2022-01-19 12:31:53,754 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 876 transitions. [2022-01-19 12:31:53,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 876 transitions. [2022-01-19 12:31:53,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:53,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 876 transitions. [2022-01-19 12:31:53,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 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 12:31:53,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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 12:31:53,758 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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 12:31:53,758 INFO L186 Difference]: Start difference. First operand has 221 places, 170 transitions, 497 flow. Second operand 6 states and 876 transitions. [2022-01-19 12:31:53,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 170 transitions, 547 flow [2022-01-19 12:31:53,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 170 transitions, 477 flow, removed 14 selfloop flow, removed 22 redundant places. [2022-01-19 12:31:53,762 INFO L242 Difference]: Finished difference. Result has 182 places, 161 transitions, 386 flow [2022-01-19 12:31:53,762 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=182, PETRI_TRANSITIONS=161} [2022-01-19 12:31:53,763 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 5 predicate places. [2022-01-19 12:31:53,763 INFO L470 AbstractCegarLoop]: Abstraction has has 182 places, 161 transitions, 386 flow [2022-01-19 12:31:53,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 143.125) internal successors, (1145), 8 states have internal predecessors, (1145), 0 states have call successors, (0), 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 12:31:53,764 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:53,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:53,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 12:31:53,764 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash -645913404, now seen corresponding path program 1 times [2022-01-19 12:31:53,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:53,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870198049] [2022-01-19 12:31:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:53,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:53,877 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 12:31:53,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870198049] [2022-01-19 12:31:53,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870198049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:53,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:53,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 12:31:53,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2959983] [2022-01-19 12:31:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:53,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 12:31:53,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 12:31:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 12:31:53,880 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 183 [2022-01-19 12:31:53,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 161 transitions, 386 flow. Second operand has 8 states, 8 states have (on average 142.875) internal successors, (1143), 8 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:53,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:53,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 183 [2022-01-19 12:31:53,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:54,015 INFO L129 PetriNetUnfolder]: 12/360 cut-off events. [2022-01-19 12:31:54,015 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-01-19 12:31:54,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 360 events. 12/360 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 839 event pairs, 0 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 456. Up to 21 conditions per place. [2022-01-19 12:31:54,018 INFO L132 encePairwiseOnDemand]: 172/183 looper letters, 24 selfloop transitions, 10 changer transitions 0/165 dead transitions. [2022-01-19 12:31:54,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 165 transitions, 462 flow [2022-01-19 12:31:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 12:31:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 12:31:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1295 transitions. [2022-01-19 12:31:54,022 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7862780813600486 [2022-01-19 12:31:54,022 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1295 transitions. [2022-01-19 12:31:54,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1295 transitions. [2022-01-19 12:31:54,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:54,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1295 transitions. [2022-01-19 12:31:54,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.88888888888889) internal successors, (1295), 9 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:54,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:54,029 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:54,029 INFO L186 Difference]: Start difference. First operand has 182 places, 161 transitions, 386 flow. Second operand 9 states and 1295 transitions. [2022-01-19 12:31:54,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 165 transitions, 462 flow [2022-01-19 12:31:54,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 165 transitions, 428 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-01-19 12:31:54,032 INFO L242 Difference]: Finished difference. Result has 174 places, 159 transitions, 368 flow [2022-01-19 12:31:54,032 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=368, PETRI_PLACES=174, PETRI_TRANSITIONS=159} [2022-01-19 12:31:54,033 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, -3 predicate places. [2022-01-19 12:31:54,033 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 159 transitions, 368 flow [2022-01-19 12:31:54,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 142.875) internal successors, (1143), 8 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:54,034 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:54,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:54,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 12:31:54,034 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:54,035 INFO L85 PathProgramCache]: Analyzing trace with hash 194878886, now seen corresponding path program 1 times [2022-01-19 12:31:54,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:54,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041959432] [2022-01-19 12:31:54,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:54,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:54,134 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 12:31:54,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:54,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041959432] [2022-01-19 12:31:54,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041959432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:54,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:54,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 12:31:54,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325374728] [2022-01-19 12:31:54,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:54,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 12:31:54,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 12:31:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-01-19 12:31:54,137 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 183 [2022-01-19 12:31:54,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 159 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 138.9090909090909) internal successors, (1528), 11 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:54,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:54,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 183 [2022-01-19 12:31:54,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:54,416 INFO L129 PetriNetUnfolder]: 29/348 cut-off events. [2022-01-19 12:31:54,416 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-19 12:31:54,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 348 events. 29/348 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 902 event pairs, 12 based on Foata normal form. 4/345 useless extension candidates. Maximal degree in co-relation 484. Up to 44 conditions per place. [2022-01-19 12:31:54,417 INFO L132 encePairwiseOnDemand]: 167/183 looper letters, 21 selfloop transitions, 14 changer transitions 20/178 dead transitions. [2022-01-19 12:31:54,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 178 transitions, 518 flow [2022-01-19 12:31:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 12:31:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 12:31:54,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2366 transitions. [2022-01-19 12:31:54,422 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7605271616843459 [2022-01-19 12:31:54,422 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2366 transitions. [2022-01-19 12:31:54,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2366 transitions. [2022-01-19 12:31:54,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:54,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2366 transitions. [2022-01-19 12:31:54,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 139.1764705882353) internal successors, (2366), 17 states have internal predecessors, (2366), 0 states have call successors, (0), 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 12:31:54,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 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 12:31:54,433 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 183.0) internal successors, (3294), 18 states have internal predecessors, (3294), 0 states have call successors, (0), 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 12:31:54,433 INFO L186 Difference]: Start difference. First operand has 174 places, 159 transitions, 368 flow. Second operand 17 states and 2366 transitions. [2022-01-19 12:31:54,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 178 transitions, 518 flow [2022-01-19 12:31:54,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 178 transitions, 490 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 12:31:54,437 INFO L242 Difference]: Finished difference. Result has 189 places, 158 transitions, 388 flow [2022-01-19 12:31:54,437 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=388, PETRI_PLACES=189, PETRI_TRANSITIONS=158} [2022-01-19 12:31:54,438 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, 12 predicate places. [2022-01-19 12:31:54,438 INFO L470 AbstractCegarLoop]: Abstraction has has 189 places, 158 transitions, 388 flow [2022-01-19 12:31:54,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 138.9090909090909) internal successors, (1528), 11 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:31:54,438 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:31:54,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:54,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 12:31:54,439 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-01-19 12:31:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:31:54,439 INFO L85 PathProgramCache]: Analyzing trace with hash 776535328, now seen corresponding path program 1 times [2022-01-19 12:31:54,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:31:54,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522731793] [2022-01-19 12:31:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:31:54,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:31:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:31:54,587 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 12:31:54,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:31:54,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522731793] [2022-01-19 12:31:54,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522731793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:31:54,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:31:54,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 12:31:54,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128519741] [2022-01-19 12:31:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:31:54,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 12:31:54,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:31:54,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 12:31:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 12:31:54,590 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 183 [2022-01-19 12:31:54,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 158 transitions, 388 flow. Second operand has 8 states, 8 states have (on average 143.75) internal successors, (1150), 8 states have internal predecessors, (1150), 0 states have call successors, (0), 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 12:31:54,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:31:54,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 183 [2022-01-19 12:31:54,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:31:54,678 INFO L129 PetriNetUnfolder]: 8/177 cut-off events. [2022-01-19 12:31:54,678 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-01-19 12:31:54,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 177 events. 8/177 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 150 event pairs, 0 based on Foata normal form. 5/180 useless extension candidates. Maximal degree in co-relation 262. Up to 23 conditions per place. [2022-01-19 12:31:54,678 INFO L132 encePairwiseOnDemand]: 178/183 looper letters, 0 selfloop transitions, 0 changer transitions 147/147 dead transitions. [2022-01-19 12:31:54,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 147 transitions, 426 flow [2022-01-19 12:31:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:31:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:31:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 878 transitions. [2022-01-19 12:31:54,680 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7996357012750456 [2022-01-19 12:31:54,680 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 878 transitions. [2022-01-19 12:31:54,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 878 transitions. [2022-01-19 12:31:54,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:31:54,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 878 transitions. [2022-01-19 12:31:54,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.33333333333334) internal successors, (878), 6 states have internal predecessors, (878), 0 states have call successors, (0), 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 12:31:54,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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 12:31:54,684 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 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 12:31:54,684 INFO L186 Difference]: Start difference. First operand has 189 places, 158 transitions, 388 flow. Second operand 6 states and 878 transitions. [2022-01-19 12:31:54,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 147 transitions, 426 flow [2022-01-19 12:31:54,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 147 transitions, 388 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-01-19 12:31:54,686 INFO L242 Difference]: Finished difference. Result has 159 places, 0 transitions, 0 flow [2022-01-19 12:31:54,686 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=159, PETRI_TRANSITIONS=0} [2022-01-19 12:31:54,687 INFO L334 CegarLoopForPetriNet]: 177 programPoint places, -18 predicate places. [2022-01-19 12:31:54,687 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 0 transitions, 0 flow [2022-01-19 12:31:54,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 143.75) internal successors, (1150), 8 states have internal predecessors, (1150), 0 states have call successors, (0), 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 12:31:54,689 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (6 of 7 remaining) [2022-01-19 12:31:54,689 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 12:31:54,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2022-01-19 12:31:54,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2022-01-19 12:31:54,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2022-01-19 12:31:54,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2022-01-19 12:31:54,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 12:31:54,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 12:31:54,693 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:31:54,696 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 12:31:54,696 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 12:31:54,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 12:31:54 BasicIcfg [2022-01-19 12:31:54,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 12:31:54,699 INFO L158 Benchmark]: Toolchain (without parser) took 5718.39ms. Allocated memory was 358.6MB in the beginning and 444.6MB in the end (delta: 86.0MB). Free memory was 307.0MB in the beginning and 164.2MB in the end (delta: 142.8MB). Peak memory consumption was 231.5MB. Max. memory is 16.0GB. [2022-01-19 12:31:54,699 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 358.6MB. Free memory is still 324.4MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 12:31:54,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.41ms. Allocated memory was 358.6MB in the beginning and 444.6MB in the end (delta: 86.0MB). Free memory was 306.8MB in the beginning and 409.2MB in the end (delta: -102.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.0GB. [2022-01-19 12:31:54,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.13ms. Allocated memory is still 444.6MB. Free memory was 409.2MB in the beginning and 407.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 12:31:54,700 INFO L158 Benchmark]: Boogie Preprocessor took 20.30ms. Allocated memory is still 444.6MB. Free memory was 407.1MB in the beginning and 405.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 12:31:54,700 INFO L158 Benchmark]: RCFGBuilder took 513.86ms. Allocated memory is still 444.6MB. Free memory was 405.0MB in the beginning and 388.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 12:31:54,700 INFO L158 Benchmark]: TraceAbstraction took 4658.60ms. Allocated memory is still 444.6MB. Free memory was 387.2MB in the beginning and 164.2MB in the end (delta: 223.0MB). Peak memory consumption was 225.1MB. Max. memory is 16.0GB. [2022-01-19 12:31:54,701 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 358.6MB. Free memory is still 324.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 481.41ms. Allocated memory was 358.6MB in the beginning and 444.6MB in the end (delta: 86.0MB). Free memory was 306.8MB in the beginning and 409.2MB in the end (delta: -102.4MB). Peak memory consumption was 13.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.13ms. Allocated memory is still 444.6MB. Free memory was 409.2MB in the beginning and 407.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.30ms. Allocated memory is still 444.6MB. Free memory was 407.1MB in the beginning and 405.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 513.86ms. Allocated memory is still 444.6MB. Free memory was 405.0MB in the beginning and 388.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 4658.60ms. Allocated memory is still 444.6MB. Free memory was 387.2MB in the beginning and 164.2MB in the end (delta: 223.0MB). Peak memory consumption was 225.1MB. 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 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 255 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 929 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 1406 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1181 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1112 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 242 mSDtfsCounter, 1112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=578occurred in iteration=5, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1042 ConstructedInterpolants, 0 QuantifiedInterpolants, 4815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-01-19 12:31:54,731 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...