/usr/bin/java -Xmx8000000000 -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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:47:42,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:47:42,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:47:42,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:47:42,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:47:42,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:47:42,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:47:42,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:47:42,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:47:42,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:47:42,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:47:42,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:47:42,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:47:42,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:47:42,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:47:42,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:47:42,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:47:42,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:47:42,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:47:42,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:47:42,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:47:42,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:47:42,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:47:42,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:47:42,850 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:47:42,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:47:42,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:47:42,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:47:42,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:47:42,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:47:42,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:47:42,859 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:47:42,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:47:42,861 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:47:42,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:47:42,862 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:47:42,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:47:42,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:47:42,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:47:42,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:47:42,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:47:42,864 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-SemanticLbe.epf [2022-12-05 20:47:42,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:47:42,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:47:42,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:47:42,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:47:42,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:47:42,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:47:42,896 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:47:42,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:47:42,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:47:42,896 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:47:42,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:47:42,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:47:42,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:47:42,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:47:42,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:47:42,898 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:47:42,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:47:42,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:47:42,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:47:42,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:47:42,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:47:42,899 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:47:42,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:47:42,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:47:42,899 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:47:42,899 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:47:42,899 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:47:42,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:47:42,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:47:42,900 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:47:42,900 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-12-05 20:47:43,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:47:43,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:47:43,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:47:43,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:47:43,212 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:47:43,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-12-05 20:47:44,268 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:47:44,516 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:47:44,517 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2022-12-05 20:47:44,536 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8e468be/d51425d9b20d4949980b2a93aa8cb7d5/FLAGd0a0a0f59 [2022-12-05 20:47:44,546 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8e468be/d51425d9b20d4949980b2a93aa8cb7d5 [2022-12-05 20:47:44,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:47:44,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:47:44,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:47:44,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:47:44,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:47:44,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:44,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282b6745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44, skipping insertion in model container [2022-12-05 20:47:44,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:44,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:47:44,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:47:44,718 WARN L237 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_21-traces-cluster-based_true.i[1092,1105] [2022-12-05 20:47:44,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:47:44,896 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:47:44,908 WARN L237 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_21-traces-cluster-based_true.i[1092,1105] [2022-12-05 20:47:44,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:47:44,990 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:47:44,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44 WrapperNode [2022-12-05 20:47:44,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:47:44,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:47:44,994 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:47:44,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:47:45,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,057 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 129 [2022-12-05 20:47:45,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:47:45,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:47:45,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:47:45,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:47:45,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,087 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:47:45,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:47:45,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:47:45,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:47:45,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (1/1) ... [2022-12-05 20:47:45,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:47:45,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:47:45,132 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-12-05 20:47:45,159 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-12-05 20:47:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-05 20:47:45,179 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-05 20:47:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:47:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 20:47:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:47:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:47:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2022-12-05 20:47:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2022-12-05 20:47:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-05 20:47:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-05 20:47:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:47:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:47:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:47:45,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:47:45,181 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:47:45,361 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:47:45,362 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:47:45,635 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:47:45,642 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:47:45,642 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:47:45,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:47:45 BoogieIcfgContainer [2022-12-05 20:47:45,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:47:45,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:47:45,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:47:45,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:47:45,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:47:44" (1/3) ... [2022-12-05 20:47:45,652 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a39a082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:47:45, skipping insertion in model container [2022-12-05 20:47:45,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:47:44" (2/3) ... [2022-12-05 20:47:45,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a39a082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:47:45, skipping insertion in model container [2022-12-05 20:47:45,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:47:45" (3/3) ... [2022-12-05 20:47:45,654 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2022-12-05 20:47:45,670 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:47:45,670 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-05 20:47:45,670 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:47:45,763 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:47:45,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 155 transitions, 325 flow [2022-12-05 20:47:45,885 INFO L130 PetriNetUnfolder]: 5/152 cut-off events. [2022-12-05 20:47:45,885 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:47:45,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 152 events. 5/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2022-12-05 20:47:45,892 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 155 transitions, 325 flow [2022-12-05 20:47:45,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 152 transitions, 313 flow [2022-12-05 20:47:45,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:47:45,920 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 152 transitions, 313 flow [2022-12-05 20:47:45,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 152 transitions, 313 flow [2022-12-05 20:47:45,960 INFO L130 PetriNetUnfolder]: 5/152 cut-off events. [2022-12-05 20:47:45,960 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:47:45,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 152 events. 5/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 240 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 118. Up to 2 conditions per place. [2022-12-05 20:47:45,967 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 152 transitions, 313 flow [2022-12-05 20:47:45,967 INFO L188 LiptonReduction]: Number of co-enabled transitions 8414 [2022-12-05 20:47:52,751 INFO L203 LiptonReduction]: Total number of compositions: 128 [2022-12-05 20:47:52,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:47:52,773 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e2755a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:47:52,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-05 20:47:52,779 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-05 20:47:52,779 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:47:52,780 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:47:52,780 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:47:52,780 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:47:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:47:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1062298431, now seen corresponding path program 1 times [2022-12-05 20:47:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:47:52,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086805257] [2022-12-05 20:47:52,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:47:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:47:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:47:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:47:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:47:53,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086805257] [2022-12-05 20:47:53,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086805257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:47:53,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:47:53,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:47:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392057152] [2022-12-05 20:47:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:47:53,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:47:53,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:47:53,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:47:53,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:47:53,193 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-05 20:47:53,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-05 20:47:53,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:47:53,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-05 20:47:53,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:47:55,862 INFO L130 PetriNetUnfolder]: 21267/30904 cut-off events. [2022-12-05 20:47:55,862 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-12-05 20:47:55,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60747 conditions, 30904 events. 21267/30904 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 202806 event pairs, 5995 based on Foata normal form. 0/21040 useless extension candidates. Maximal degree in co-relation 60736. Up to 12817 conditions per place. [2022-12-05 20:47:56,053 INFO L137 encePairwiseOnDemand]: 39/51 looper letters, 177 selfloop transitions, 10 changer transitions 0/193 dead transitions. [2022-12-05 20:47:56,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 193 transitions, 790 flow [2022-12-05 20:47:56,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:47:56,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:47:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 268 transitions. [2022-12-05 20:47:56,065 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6568627450980392 [2022-12-05 20:47:56,066 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 8 states and 268 transitions. [2022-12-05 20:47:56,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 193 transitions, 790 flow [2022-12-05 20:47:56,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 193 transitions, 780 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:47:56,073 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 167 flow [2022-12-05 20:47:56,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2022-12-05 20:47:56,078 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2022-12-05 20:47:56,078 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 167 flow [2022-12-05 20:47:56,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-05 20:47:56,079 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:47:56,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:47:56,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:47:56,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:47:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:47:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1799674934, now seen corresponding path program 1 times [2022-12-05 20:47:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:47:56,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923519073] [2022-12-05 20:47:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:47:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:47:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:47:56,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:47:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:47:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923519073] [2022-12-05 20:47:56,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923519073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:47:56,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:47:56,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:47:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369224420] [2022-12-05 20:47:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:47:56,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:47:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:47:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:47:56,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:47:56,219 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-05 20:47:56,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-05 20:47:56,219 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:47:56,219 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-05 20:47:56,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:47:58,680 INFO L130 PetriNetUnfolder]: 23464/33746 cut-off events. [2022-12-05 20:47:58,680 INFO L131 PetriNetUnfolder]: For 13608/13608 co-relation queries the response was YES. [2022-12-05 20:47:58,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78523 conditions, 33746 events. 23464/33746 cut-off events. For 13608/13608 co-relation queries the response was YES. Maximal size of possible extension queue 1181. Compared 216587 event pairs, 6422 based on Foata normal form. 0/24970 useless extension candidates. Maximal degree in co-relation 78507. Up to 15284 conditions per place. [2022-12-05 20:47:58,875 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 169 selfloop transitions, 20 changer transitions 0/195 dead transitions. [2022-12-05 20:47:58,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 195 transitions, 967 flow [2022-12-05 20:47:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:47:58,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:47:58,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 221 transitions. [2022-12-05 20:47:58,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-05 20:47:58,877 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 167 flow. Second operand 8 states and 221 transitions. [2022-12-05 20:47:58,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 195 transitions, 967 flow [2022-12-05 20:47:59,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 195 transitions, 967 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:47:59,063 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 350 flow [2022-12-05 20:47:59,064 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=350, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2022-12-05 20:47:59,064 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 19 predicate places. [2022-12-05 20:47:59,065 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 350 flow [2022-12-05 20:47:59,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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-12-05 20:47:59,065 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:47:59,065 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:47:59,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:47:59,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:47:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:47:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2094212975, now seen corresponding path program 1 times [2022-12-05 20:47:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:47:59,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041372706] [2022-12-05 20:47:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:47:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:47:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:47:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:47:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:47:59,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041372706] [2022-12-05 20:47:59,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041372706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:47:59,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:47:59,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:47:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876987232] [2022-12-05 20:47:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:47:59,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:47:59,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:47:59,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:47:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:47:59,176 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-05 20:47:59,177 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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-12-05 20:47:59,177 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:47:59,177 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-05 20:47:59,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:00,297 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L707-->t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (store |v_#pthreadsMutex_503| |v_~#A~0.base_165| (store (select |v_#pthreadsMutex_503| |v_~#A~0.base_165|) |v_~#A~0.offset_165| 0)) |v_#pthreadsMutex_502|) (= (ite (<= |v_t2_funThread1of1ForFork0_~y~0#1_33| |v_t2_funThread1of1ForFork0_~x~1#1_35|) 1 0) |v_t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_29|) (= |v_t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_29|) (= |v_t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_35|, #pthreadsMutex=|v_#pthreadsMutex_503|, ~#A~0.offset=|v_~#A~0.offset_165|, ~#A~0.base=|v_~#A~0.base_165|, t2_funThread1of1ForFork0_~y~0#1=|v_t2_funThread1of1ForFork0_~y~0#1_33|} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_35|, #pthreadsMutex=|v_#pthreadsMutex_502|, ~#A~0.offset=|v_~#A~0.offset_165|, t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, ~#A~0.base=|v_~#A~0.base_165|, t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_29|, t2_funThread1of1ForFork0_~y~0#1=|v_t2_funThread1of1ForFork0_~y~0#1_33|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1][77], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork2InUse, Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 2#ULTIMATE.startEXITtrue, 145#t2_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 155#t3_funEXITtrue, Black: 194#true, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 211#true, Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 177#true, Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 39#L693true, 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t3_funThread1of1ForFork1InUse, Black: 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)]) [2022-12-05 20:48:00,297 INFO L382 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,298 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,298 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,298 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,298 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][76], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, 105#L706true, 155#t3_funEXITtrue, 52#L694true, Black: 194#true, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 211#true, Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 177#true, Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t3_funThread1of1ForFork1InUse]) [2022-12-05 20:48:00,298 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,298 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,298 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,298 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,299 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([532] L707-->t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (store |v_#pthreadsMutex_503| |v_~#A~0.base_165| (store (select |v_#pthreadsMutex_503| |v_~#A~0.base_165|) |v_~#A~0.offset_165| 0)) |v_#pthreadsMutex_502|) (= (ite (<= |v_t2_funThread1of1ForFork0_~y~0#1_33| |v_t2_funThread1of1ForFork0_~x~1#1_35|) 1 0) |v_t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_29|) (= |v_t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1_37| |v_t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_29|) (= |v_t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1_37| 0)) InVars {t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_35|, #pthreadsMutex=|v_#pthreadsMutex_503|, ~#A~0.offset=|v_~#A~0.offset_165|, ~#A~0.base=|v_~#A~0.base_165|, t2_funThread1of1ForFork0_~y~0#1=|v_t2_funThread1of1ForFork0_~y~0#1_33|} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_35|, #pthreadsMutex=|v_#pthreadsMutex_502|, ~#A~0.offset=|v_~#A~0.offset_165|, t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1_37|, ~#A~0.base=|v_~#A~0.base_165|, t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_29|, t2_funThread1of1ForFork0_~y~0#1=|v_t2_funThread1of1ForFork0_~y~0#1_33|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t2_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1][77], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork2InUse, Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 2#ULTIMATE.startEXITtrue, 145#t2_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 194#true, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 211#true, Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 177#true, Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 27#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 39#L693true, 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t3_funThread1of1ForFork1InUse, Black: 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)]) [2022-12-05 20:48:00,299 INFO L382 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,299 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,299 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,299 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-05 20:48:00,299 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][76], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, 105#L706true, 52#L694true, Black: 194#true, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), 211#true, Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 177#true, Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 27#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), t3_funThread1of1ForFork1InUse]) [2022-12-05 20:48:00,299 INFO L382 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,299 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,300 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,300 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-05 20:48:00,343 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][76], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t_funThread1of1ForFork2InUse, 154#t2_funEXITtrue, 2#ULTIMATE.startEXITtrue, Black: 194#true, 52#L694true, 155#t3_funEXITtrue, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 211#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 177#true, Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t3_funThread1of1ForFork1InUse]) [2022-12-05 20:48:00,343 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,343 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,343 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,343 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,344 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([391] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][76], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t_funThread1of1ForFork2InUse, 154#t2_funEXITtrue, 2#ULTIMATE.startEXITtrue, Black: 194#true, 52#L694true, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 211#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 27#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 177#true, Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t3_funThread1of1ForFork1InUse]) [2022-12-05 20:48:00,344 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,344 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,344 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,344 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,370 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([391] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][76], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t_funThread1of1ForFork2InUse, 154#t2_funEXITtrue, 2#ULTIMATE.startEXITtrue, Black: 194#true, 52#L694true, 155#t3_funEXITtrue, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 211#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 177#true, Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t3_funThread1of1ForFork1InUse]) [2022-12-05 20:48:00,370 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,371 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,371 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,371 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,371 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,371 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([391] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][76], [Black: 180#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), t_funThread1of1ForFork2InUse, Black: 187#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), 154#t2_funEXITtrue, 2#ULTIMATE.startEXITtrue, Black: 194#true, 52#L694true, Black: 196#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), Black: 197#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 211#true, Black: 204#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 202#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 27#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 181#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 198#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 177#true, Black: 179#(<= ~h~0 ~g~0), t2_funThread1of1ForFork0InUse, Black: 185#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), t3_funThread1of1ForFork1InUse]) [2022-12-05 20:48:00,371 INFO L382 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,371 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,371 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,372 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,372 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-05 20:48:00,448 INFO L130 PetriNetUnfolder]: 8802/15595 cut-off events. [2022-12-05 20:48:00,449 INFO L131 PetriNetUnfolder]: For 10923/11197 co-relation queries the response was YES. [2022-12-05 20:48:00,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38091 conditions, 15595 events. 8802/15595 cut-off events. For 10923/11197 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 122733 event pairs, 4441 based on Foata normal form. 728/12308 useless extension candidates. Maximal degree in co-relation 38067. Up to 8688 conditions per place. [2022-12-05 20:48:00,527 INFO L137 encePairwiseOnDemand]: 35/51 looper letters, 51 selfloop transitions, 18 changer transitions 0/99 dead transitions. [2022-12-05 20:48:00,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 571 flow [2022-12-05 20:48:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:48:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:48:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-12-05 20:48:00,530 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6601307189542484 [2022-12-05 20:48:00,530 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 350 flow. Second operand 3 states and 101 transitions. [2022-12-05 20:48:00,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 571 flow [2022-12-05 20:48:00,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 99 transitions, 567 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-05 20:48:00,740 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 458 flow [2022-12-05 20:48:00,741 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2022-12-05 20:48:00,742 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 22 predicate places. [2022-12-05 20:48:00,742 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 458 flow [2022-12-05 20:48:00,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 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-12-05 20:48:00,743 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:48:00,743 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:00,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:48:00,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:48:00,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:48:00,743 INFO L85 PathProgramCache]: Analyzing trace with hash 335370419, now seen corresponding path program 1 times [2022-12-05 20:48:00,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:48:00,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270771382] [2022-12-05 20:48:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:48:00,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:48:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:48:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:48:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:48:00,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270771382] [2022-12-05 20:48:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270771382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:48:00,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:48:00,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:48:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386017582] [2022-12-05 20:48:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:48:00,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:48:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:48:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:48:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:48:00,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-05 20:48:00,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-05 20:48:00,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:48:00,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-05 20:48:00,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:02,669 INFO L130 PetriNetUnfolder]: 13077/20692 cut-off events. [2022-12-05 20:48:02,669 INFO L131 PetriNetUnfolder]: For 19790/19813 co-relation queries the response was YES. [2022-12-05 20:48:02,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65622 conditions, 20692 events. 13077/20692 cut-off events. For 19790/19813 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 136659 event pairs, 4815 based on Foata normal form. 23/16497 useless extension candidates. Maximal degree in co-relation 65596. Up to 10052 conditions per place. [2022-12-05 20:48:02,773 INFO L137 encePairwiseOnDemand]: 44/51 looper letters, 168 selfloop transitions, 29 changer transitions 8/214 dead transitions. [2022-12-05 20:48:02,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 214 transitions, 1592 flow [2022-12-05 20:48:02,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:48:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:48:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2022-12-05 20:48:02,775 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2022-12-05 20:48:02,775 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 458 flow. Second operand 8 states and 190 transitions. [2022-12-05 20:48:02,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 214 transitions, 1592 flow [2022-12-05 20:48:03,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 214 transitions, 1535 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:48:03,014 INFO L231 Difference]: Finished difference. Result has 93 places, 98 transitions, 719 flow [2022-12-05 20:48:03,014 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=719, PETRI_PLACES=93, PETRI_TRANSITIONS=98} [2022-12-05 20:48:03,015 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 34 predicate places. [2022-12-05 20:48:03,015 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 98 transitions, 719 flow [2022-12-05 20:48:03,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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-12-05 20:48:03,015 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:48:03,016 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:03,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:48:03,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:48:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:48:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1914650102, now seen corresponding path program 1 times [2022-12-05 20:48:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:48:03,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996304842] [2022-12-05 20:48:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:48:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:48:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:48:03,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:48:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:48:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996304842] [2022-12-05 20:48:03,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996304842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:48:03,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:48:03,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:48:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814460567] [2022-12-05 20:48:03,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:48:03,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:48:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:48:03,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:48:03,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:48:03,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-05 20:48:03,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 98 transitions, 719 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-12-05 20:48:03,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:48:03,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-05 20:48:03,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:05,496 INFO L130 PetriNetUnfolder]: 13723/22020 cut-off events. [2022-12-05 20:48:05,497 INFO L131 PetriNetUnfolder]: For 34282/34344 co-relation queries the response was YES. [2022-12-05 20:48:05,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70169 conditions, 22020 events. 13723/22020 cut-off events. For 34282/34344 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 152337 event pairs, 4869 based on Foata normal form. 344/18514 useless extension candidates. Maximal degree in co-relation 70136. Up to 9284 conditions per place. [2022-12-05 20:48:05,602 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 218 selfloop transitions, 33 changer transitions 0/260 dead transitions. [2022-12-05 20:48:05,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 260 transitions, 2043 flow [2022-12-05 20:48:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:48:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:48:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-12-05 20:48:05,605 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5770308123249299 [2022-12-05 20:48:05,605 INFO L175 Difference]: Start difference. First operand has 93 places, 98 transitions, 719 flow. Second operand 7 states and 206 transitions. [2022-12-05 20:48:05,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 260 transitions, 2043 flow [2022-12-05 20:48:05,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 260 transitions, 2037 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-05 20:48:05,898 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 825 flow [2022-12-05 20:48:05,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=825, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2022-12-05 20:48:05,899 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 44 predicate places. [2022-12-05 20:48:05,899 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 825 flow [2022-12-05 20:48:05,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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-12-05 20:48:05,899 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:48:05,899 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:05,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:48:05,899 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:48:05,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:48:05,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1696429791, now seen corresponding path program 1 times [2022-12-05 20:48:05,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:48:05,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210970257] [2022-12-05 20:48:05,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:48:05,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:48:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:48:06,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-12-05 20:48:06,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:48:06,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210970257] [2022-12-05 20:48:06,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210970257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:48:06,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:48:06,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:48:06,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53153494] [2022-12-05 20:48:06,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:48:06,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:48:06,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:48:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:48:06,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:48:06,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-05 20:48:06,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 825 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-05 20:48:06,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:48:06,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-05 20:48:06,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:06,858 INFO L130 PetriNetUnfolder]: 4185/7910 cut-off events. [2022-12-05 20:48:06,858 INFO L131 PetriNetUnfolder]: For 14939/15348 co-relation queries the response was YES. [2022-12-05 20:48:06,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24908 conditions, 7910 events. 4185/7910 cut-off events. For 14939/15348 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 58856 event pairs, 1172 based on Foata normal form. 438/6749 useless extension candidates. Maximal degree in co-relation 24870. Up to 4337 conditions per place. [2022-12-05 20:48:06,890 INFO L137 encePairwiseOnDemand]: 41/51 looper letters, 61 selfloop transitions, 16 changer transitions 4/124 dead transitions. [2022-12-05 20:48:06,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 124 transitions, 1068 flow [2022-12-05 20:48:06,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:48:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:48:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-12-05 20:48:06,891 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 20:48:06,892 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 825 flow. Second operand 4 states and 102 transitions. [2022-12-05 20:48:06,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 124 transitions, 1068 flow [2022-12-05 20:48:06,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 124 transitions, 1005 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-05 20:48:06,975 INFO L231 Difference]: Finished difference. Result has 101 places, 95 transitions, 722 flow [2022-12-05 20:48:06,976 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=722, PETRI_PLACES=101, PETRI_TRANSITIONS=95} [2022-12-05 20:48:06,977 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 42 predicate places. [2022-12-05 20:48:06,977 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 95 transitions, 722 flow [2022-12-05 20:48:06,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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-12-05 20:48:06,978 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:48:06,978 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:06,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:48:06,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:48:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:48:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1915419499, now seen corresponding path program 1 times [2022-12-05 20:48:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:48:06,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798010158] [2022-12-05 20:48:06,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:48:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:48:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:48:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:48:07,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:48:07,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798010158] [2022-12-05 20:48:07,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798010158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:48:07,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:48:07,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:48:07,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423822704] [2022-12-05 20:48:07,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:48:07,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:48:07,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:48:07,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:48:07,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:48:07,090 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-05 20:48:07,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 95 transitions, 722 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-05 20:48:07,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:48:07,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-05 20:48:07,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:08,158 INFO L130 PetriNetUnfolder]: 4642/8383 cut-off events. [2022-12-05 20:48:08,158 INFO L131 PetriNetUnfolder]: For 16586/16638 co-relation queries the response was YES. [2022-12-05 20:48:08,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28707 conditions, 8383 events. 4642/8383 cut-off events. For 16586/16638 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 58529 event pairs, 1052 based on Foata normal form. 267/7619 useless extension candidates. Maximal degree in co-relation 28670. Up to 2791 conditions per place. [2022-12-05 20:48:08,187 INFO L137 encePairwiseOnDemand]: 43/51 looper letters, 241 selfloop transitions, 39 changer transitions 14/303 dead transitions. [2022-12-05 20:48:08,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 303 transitions, 2372 flow [2022-12-05 20:48:08,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 20:48:08,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 20:48:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 297 transitions. [2022-12-05 20:48:08,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4479638009049774 [2022-12-05 20:48:08,189 INFO L175 Difference]: Start difference. First operand has 101 places, 95 transitions, 722 flow. Second operand 13 states and 297 transitions. [2022-12-05 20:48:08,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 303 transitions, 2372 flow [2022-12-05 20:48:08,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 303 transitions, 2300 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:48:08,267 INFO L231 Difference]: Finished difference. Result has 114 places, 101 transitions, 891 flow [2022-12-05 20:48:08,267 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=891, PETRI_PLACES=114, PETRI_TRANSITIONS=101} [2022-12-05 20:48:08,267 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 55 predicate places. [2022-12-05 20:48:08,267 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 101 transitions, 891 flow [2022-12-05 20:48:08,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-05 20:48:08,268 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:48:08,268 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:08,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:48:08,268 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:48:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:48:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1735281718, now seen corresponding path program 1 times [2022-12-05 20:48:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:48:08,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034114784] [2022-12-05 20:48:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:48:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:48:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:48:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:48:08,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:48:08,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034114784] [2022-12-05 20:48:08,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034114784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:48:08,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:48:08,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:48:08,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472692088] [2022-12-05 20:48:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:48:08,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:48:08,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:48:08,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:48:08,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:48:08,355 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-05 20:48:08,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 101 transitions, 891 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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-12-05 20:48:08,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:48:08,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-05 20:48:08,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:09,313 INFO L130 PetriNetUnfolder]: 4475/8238 cut-off events. [2022-12-05 20:48:09,313 INFO L131 PetriNetUnfolder]: For 20859/20909 co-relation queries the response was YES. [2022-12-05 20:48:09,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29602 conditions, 8238 events. 4475/8238 cut-off events. For 20859/20909 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 57831 event pairs, 958 based on Foata normal form. 272/7502 useless extension candidates. Maximal degree in co-relation 29560. Up to 2454 conditions per place. [2022-12-05 20:48:09,350 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 220 selfloop transitions, 32 changer transitions 43/304 dead transitions. [2022-12-05 20:48:09,351 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 304 transitions, 2709 flow [2022-12-05 20:48:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-05 20:48:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-05 20:48:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 275 transitions. [2022-12-05 20:48:09,352 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41478129713423834 [2022-12-05 20:48:09,352 INFO L175 Difference]: Start difference. First operand has 114 places, 101 transitions, 891 flow. Second operand 13 states and 275 transitions. [2022-12-05 20:48:09,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 304 transitions, 2709 flow [2022-12-05 20:48:09,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 304 transitions, 2543 flow, removed 38 selfloop flow, removed 10 redundant places. [2022-12-05 20:48:09,447 INFO L231 Difference]: Finished difference. Result has 119 places, 106 transitions, 904 flow [2022-12-05 20:48:09,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=904, PETRI_PLACES=119, PETRI_TRANSITIONS=106} [2022-12-05 20:48:09,448 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 60 predicate places. [2022-12-05 20:48:09,448 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 106 transitions, 904 flow [2022-12-05 20:48:09,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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-12-05 20:48:09,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:48:09,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:09,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:48:09,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:48:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:48:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 379482498, now seen corresponding path program 1 times [2022-12-05 20:48:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:48:09,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052818166] [2022-12-05 20:48:09,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:48:09,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:48:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:48:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:48:09,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:48:09,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052818166] [2022-12-05 20:48:09,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052818166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:48:09,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:48:09,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:48:09,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903042755] [2022-12-05 20:48:09,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:48:09,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:48:09,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:48:09,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:48:09,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:48:09,595 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-05 20:48:09,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 106 transitions, 904 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-05 20:48:09,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:48:09,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-05 20:48:09,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:09,943 INFO L130 PetriNetUnfolder]: 1471/3402 cut-off events. [2022-12-05 20:48:09,944 INFO L131 PetriNetUnfolder]: For 5620/5714 co-relation queries the response was YES. [2022-12-05 20:48:09,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10638 conditions, 3402 events. 1471/3402 cut-off events. For 5620/5714 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 25323 event pairs, 639 based on Foata normal form. 114/3025 useless extension candidates. Maximal degree in co-relation 10595. Up to 1549 conditions per place. [2022-12-05 20:48:09,956 INFO L137 encePairwiseOnDemand]: 40/51 looper letters, 29 selfloop transitions, 14 changer transitions 20/87 dead transitions. [2022-12-05 20:48:09,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 87 transitions, 693 flow [2022-12-05 20:48:09,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:48:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:48:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-05 20:48:09,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2022-12-05 20:48:09,957 INFO L175 Difference]: Start difference. First operand has 119 places, 106 transitions, 904 flow. Second operand 4 states and 93 transitions. [2022-12-05 20:48:09,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 87 transitions, 693 flow [2022-12-05 20:48:09,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 87 transitions, 584 flow, removed 15 selfloop flow, removed 19 redundant places. [2022-12-05 20:48:09,979 INFO L231 Difference]: Finished difference. Result has 96 places, 58 transitions, 347 flow [2022-12-05 20:48:09,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=96, PETRI_TRANSITIONS=58} [2022-12-05 20:48:09,980 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 37 predicate places. [2022-12-05 20:48:09,980 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 58 transitions, 347 flow [2022-12-05 20:48:09,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 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-12-05 20:48:09,980 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:48:09,980 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:48:09,981 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-05 20:48:09,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:48:09,981 INFO L85 PathProgramCache]: Analyzing trace with hash -925216029, now seen corresponding path program 1 times [2022-12-05 20:48:09,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:48:09,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755174638] [2022-12-05 20:48:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:48:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:48:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:48:10,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:48:10,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:48:10,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755174638] [2022-12-05 20:48:10,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755174638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:48:10,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:48:10,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:48:10,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231335195] [2022-12-05 20:48:10,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:48:10,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:48:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:48:10,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:48:10,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:48:10,063 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 51 [2022-12-05 20:48:10,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 58 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-05 20:48:10,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:48:10,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 51 [2022-12-05 20:48:10,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:48:10,306 INFO L130 PetriNetUnfolder]: 582/1329 cut-off events. [2022-12-05 20:48:10,306 INFO L131 PetriNetUnfolder]: For 1385/1385 co-relation queries the response was YES. [2022-12-05 20:48:10,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4177 conditions, 1329 events. 582/1329 cut-off events. For 1385/1385 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7334 event pairs, 277 based on Foata normal form. 54/1284 useless extension candidates. Maximal degree in co-relation 4161. Up to 562 conditions per place. [2022-12-05 20:48:10,310 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 0 selfloop transitions, 0 changer transitions 92/92 dead transitions. [2022-12-05 20:48:10,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 644 flow [2022-12-05 20:48:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:48:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:48:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-12-05 20:48:10,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3277310924369748 [2022-12-05 20:48:10,312 INFO L175 Difference]: Start difference. First operand has 96 places, 58 transitions, 347 flow. Second operand 7 states and 117 transitions. [2022-12-05 20:48:10,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 644 flow [2022-12-05 20:48:10,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 92 transitions, 578 flow, removed 5 selfloop flow, removed 10 redundant places. [2022-12-05 20:48:10,316 INFO L231 Difference]: Finished difference. Result has 83 places, 0 transitions, 0 flow [2022-12-05 20:48:10,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=83, PETRI_TRANSITIONS=0} [2022-12-05 20:48:10,316 INFO L294 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2022-12-05 20:48:10,317 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 0 transitions, 0 flow [2022-12-05 20:48:10,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-05 20:48:10,319 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-12-05 20:48:10,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-12-05 20:48:10,320 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-12-05 20:48:10,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2022-12-05 20:48:10,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-12-05 20:48:10,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-12-05 20:48:10,324 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-12-05 20:48:10,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-12-05 20:48:10,325 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-12-05 20:48:10,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:48:10,325 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:48:10,330 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:48:10,330 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:48:10,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:48:10 BasicIcfg [2022-12-05 20:48:10,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:48:10,341 INFO L158 Benchmark]: Toolchain (without parser) took 25791.34ms. Allocated memory was 186.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 161.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-05 20:48:10,341 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:48:10,341 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.08ms. Allocated memory is still 186.6MB. Free memory was 160.8MB in the beginning and 140.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-05 20:48:10,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.53ms. Allocated memory is still 186.6MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:48:10,343 INFO L158 Benchmark]: Boogie Preprocessor took 31.51ms. Allocated memory is still 186.6MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:48:10,343 INFO L158 Benchmark]: RCFGBuilder took 539.66ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 118.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-05 20:48:10,344 INFO L158 Benchmark]: TraceAbstraction took 24694.48ms. Allocated memory was 186.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 117.8MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 979.9MB. Max. memory is 8.0GB. [2022-12-05 20:48:10,345 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.13ms. Allocated memory is still 186.6MB. Free memory is still 163.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 442.08ms. Allocated memory is still 186.6MB. Free memory was 160.8MB in the beginning and 140.8MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.53ms. Allocated memory is still 186.6MB. Free memory was 140.8MB in the beginning and 138.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.51ms. Allocated memory is still 186.6MB. Free memory was 138.7MB in the beginning and 136.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.66ms. Allocated memory is still 186.6MB. Free memory was 136.6MB in the beginning and 118.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 24694.48ms. Allocated memory was 186.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 117.8MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 979.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 157 PlacesBefore, 59 PlacesAfterwards, 152 TransitionsBefore, 51 TransitionsAfterwards, 8414 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 13 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 76 ConcurrentYvCompositions, 3 ChoiceCompositions, 128 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7850, independent: 7629, independent conditional: 7629, independent unconditional: 0, dependent: 221, dependent conditional: 221, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7850, independent: 7629, independent conditional: 0, independent unconditional: 7629, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7850, independent: 7629, independent conditional: 0, independent unconditional: 7629, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7850, independent: 7629, independent conditional: 0, independent unconditional: 7629, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5558, independent: 5491, independent conditional: 0, independent unconditional: 5491, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5558, independent: 5250, independent conditional: 0, independent unconditional: 5250, dependent: 308, dependent conditional: 0, dependent unconditional: 308, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 308, independent: 241, independent conditional: 0, independent unconditional: 241, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 278, independent: 148, independent conditional: 0, independent unconditional: 148, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7850, independent: 2138, independent conditional: 0, independent unconditional: 2138, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 5558, unknown conditional: 0, unknown unconditional: 5558] , Statistics on independence cache: Total cache size (in pairs): 11676, Positive cache size: 11609, Positive conditional cache size: 0, Positive unconditional cache size: 11609, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - 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 - 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 7 procedures, 221 locations, 9 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: 24.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1093 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2590 IncrementalHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 36 mSDtfsCounter, 2590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=8, InterpolantAutomatonStates: 75, 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 563 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 20:48:10,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...