/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 23:22:37,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 23:22:37,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 23:22:37,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 23:22:37,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 23:22:37,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 23:22:37,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 23:22:37,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 23:22:37,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 23:22:37,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 23:22:37,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 23:22:37,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 23:22:37,854 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 23:22:37,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 23:22:37,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 23:22:37,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 23:22:37,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 23:22:37,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 23:22:37,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 23:22:37,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 23:22:37,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 23:22:37,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 23:22:37,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 23:22:37,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 23:22:37,870 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 23:22:37,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 23:22:37,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 23:22:37,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 23:22:37,872 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 23:22:37,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 23:22:37,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 23:22:37,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 23:22:37,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 23:22:37,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 23:22:37,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 23:22:37,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 23:22:37,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 23:22:37,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 23:22:37,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 23:22:37,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 23:22:37,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 23:22:37,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 23:22:37,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 23:22:37,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 23:22:37,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 23:22:37,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 23:22:37,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 23:22:37,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 23:22:37,905 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 23:22:37,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 23:22:37,905 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 23:22:37,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 23:22:37,906 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 23:22:37,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 23:22:37,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 23:22:37,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 23:22:37,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 23:22:37,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 23:22:37,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:22:37,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 23:22:37,907 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 23:22:37,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 23:22:37,908 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 23:22:37,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 23:22:37,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 23:22:37,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 23:22:37,908 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-11 23:22:38,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 23:22:38,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 23:22:38,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 23:22:38,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 23:22:38,262 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 23:22:38,263 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2022-12-11 23:22:39,226 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 23:22:39,542 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 23:22:39,543 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2022-12-11 23:22:39,561 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd787d88/d32e158450ee4fb188ea8048bb0ac963/FLAG96579a814 [2022-12-11 23:22:39,573 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fd787d88/d32e158450ee4fb188ea8048bb0ac963 [2022-12-11 23:22:39,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 23:22:39,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 23:22:39,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 23:22:39,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 23:22:39,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 23:22:39,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:22:39" (1/1) ... [2022-12-11 23:22:39,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a952ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:39, skipping insertion in model container [2022-12-11 23:22:39,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 11:22:39" (1/1) ... [2022-12-11 23:22:39,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 23:22:39,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 23:22:39,929 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2022-12-11 23:22:39,935 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2022-12-11 23:22:39,939 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2022-12-11 23:22:39,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:22:39,952 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 23:22:39,991 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43296,43309] [2022-12-11 23:22:39,992 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43503,43516] [2022-12-11 23:22:39,994 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i[43783,43796] [2022-12-11 23:22:39,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 23:22:40,042 INFO L208 MainTranslator]: Completed translation [2022-12-11 23:22:40,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40 WrapperNode [2022-12-11 23:22:40,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 23:22:40,044 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 23:22:40,044 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 23:22:40,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 23:22:40,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,105 INFO L138 Inliner]: procedures = 274, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2022-12-11 23:22:40,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 23:22:40,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 23:22:40,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 23:22:40,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 23:22:40,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,143 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 23:22:40,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 23:22:40,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 23:22:40,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 23:22:40,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (1/1) ... [2022-12-11 23:22:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 23:22:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 23:22:40,186 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-11 23:22:40,228 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-11 23:22:40,241 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-11 23:22:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-11 23:22:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-11 23:22:40,242 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-11 23:22:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 23:22:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 23:22:40,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 23:22:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 23:22:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-11 23:22:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 23:22:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 23:22:40,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 23:22:40,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 23:22:40,244 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 23:22:40,399 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 23:22:40,400 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 23:22:40,734 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 23:22:40,741 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 23:22:40,741 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-11 23:22:40,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:22:40 BoogieIcfgContainer [2022-12-11 23:22:40,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 23:22:40,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 23:22:40,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 23:22:40,746 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 23:22:40,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 11:22:39" (1/3) ... [2022-12-11 23:22:40,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e178273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:22:40, skipping insertion in model container [2022-12-11 23:22:40,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 11:22:40" (2/3) ... [2022-12-11 23:22:40,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e178273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 11:22:40, skipping insertion in model container [2022-12-11 23:22:40,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 11:22:40" (3/3) ... [2022-12-11 23:22:40,748 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2022-12-11 23:22:40,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 23:22:40,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-11 23:22:40,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 23:22:40,874 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 23:22:40,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 256 transitions, 528 flow [2022-12-11 23:22:40,990 INFO L130 PetriNetUnfolder]: 15/254 cut-off events. [2022-12-11 23:22:40,990 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 23:22:40,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 254 events. 15/254 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 363 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-12-11 23:22:40,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 256 transitions, 528 flow [2022-12-11 23:22:40,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 237 places, 245 transitions, 499 flow [2022-12-11 23:22:41,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 23:22:41,010 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;@24aa46a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 23:22:41,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 23:22:41,018 INFO L130 PetriNetUnfolder]: 1/56 cut-off events. [2022-12-11 23:22:41,018 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 23:22:41,019 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:41,019 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:41,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:41,023 INFO L85 PathProgramCache]: Analyzing trace with hash 812412170, now seen corresponding path program 1 times [2022-12-11 23:22:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:41,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132548204] [2022-12-11 23:22:41,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:41,206 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-11 23:22:41,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:41,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132548204] [2022-12-11 23:22:41,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132548204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:41,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:41,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 23:22:41,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942595563] [2022-12-11 23:22:41,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:41,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-11 23:22:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:41,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-11 23:22:41,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-11 23:22:41,237 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 256 [2022-12-11 23:22:41,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 245 transitions, 499 flow. Second operand has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 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-11 23:22:41,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:41,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 256 [2022-12-11 23:22:41,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:41,290 INFO L130 PetriNetUnfolder]: 10/234 cut-off events. [2022-12-11 23:22:41,290 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-11 23:22:41,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 234 events. 10/234 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 280 event pairs, 0 based on Foata normal form. 7/229 useless extension candidates. Maximal degree in co-relation 176. Up to 4 conditions per place. [2022-12-11 23:22:41,293 INFO L137 encePairwiseOnDemand]: 251/256 looper letters, 3 selfloop transitions, 0 changer transitions 0/234 dead transitions. [2022-12-11 23:22:41,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 234 transitions, 483 flow [2022-12-11 23:22:41,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-11 23:22:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-11 23:22:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 494 transitions. [2022-12-11 23:22:41,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.96484375 [2022-12-11 23:22:41,305 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, -5 predicate places. [2022-12-11 23:22:41,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 232 places, 234 transitions, 483 flow [2022-12-11 23:22:41,308 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 232 places, 234 transitions, 483 flow [2022-12-11 23:22:41,308 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 234 transitions, 483 flow [2022-12-11 23:22:41,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 243.5) internal successors, (487), 2 states have internal predecessors, (487), 0 states have call successors, (0), 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-11 23:22:41,309 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:41,309 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:41,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 23:22:41,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:41,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash -510713771, now seen corresponding path program 1 times [2022-12-11 23:22:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:41,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723098067] [2022-12-11 23:22:41,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:41,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:41,987 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-11 23:22:41,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723098067] [2022-12-11 23:22:41,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723098067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:41,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:41,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 23:22:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083518355] [2022-12-11 23:22:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:41,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 23:22:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 23:22:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-11 23:22:41,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 256 [2022-12-11 23:22:41,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 234 transitions, 483 flow. Second operand has 12 states, 12 states have (on average 181.75) internal successors, (2181), 12 states have internal predecessors, (2181), 0 states have call successors, (0), 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-11 23:22:41,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:41,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 256 [2022-12-11 23:22:41,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:42,782 INFO L130 PetriNetUnfolder]: 995/3867 cut-off events. [2022-12-11 23:22:42,783 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-12-11 23:22:42,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5428 conditions, 3867 events. 995/3867 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 31436 event pairs, 789 based on Foata normal form. 0/3596 useless extension candidates. Maximal degree in co-relation 5219. Up to 1435 conditions per place. [2022-12-11 23:22:42,800 INFO L137 encePairwiseOnDemand]: 243/256 looper letters, 52 selfloop transitions, 12 changer transitions 0/230 dead transitions. [2022-12-11 23:22:42,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 230 transitions, 603 flow [2022-12-11 23:22:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 23:22:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 23:22:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2392 transitions. [2022-12-11 23:22:42,810 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.71875 [2022-12-11 23:22:42,814 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 4 predicate places. [2022-12-11 23:22:42,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 230 transitions, 603 flow [2022-12-11 23:22:42,825 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 230 transitions, 603 flow [2022-12-11 23:22:42,825 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 230 transitions, 603 flow [2022-12-11 23:22:42,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 181.75) internal successors, (2181), 12 states have internal predecessors, (2181), 0 states have call successors, (0), 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-11 23:22:42,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:42,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:42,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 23:22:42,827 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:42,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash 662506766, now seen corresponding path program 1 times [2022-12-11 23:22:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:42,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771495025] [2022-12-11 23:22:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:42,913 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-11 23:22:42,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:42,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771495025] [2022-12-11 23:22:42,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771495025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:42,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:42,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 23:22:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454760165] [2022-12-11 23:22:42,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:42,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 23:22:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 23:22:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 23:22:42,916 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 256 [2022-12-11 23:22:42,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 230 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 0 states have call successors, (0), 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-11 23:22:42,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:42,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 256 [2022-12-11 23:22:42,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:43,236 INFO L130 PetriNetUnfolder]: 996/3856 cut-off events. [2022-12-11 23:22:43,236 INFO L131 PetriNetUnfolder]: For 299/299 co-relation queries the response was YES. [2022-12-11 23:22:43,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 3856 events. 996/3856 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 31321 event pairs, 785 based on Foata normal form. 0/3600 useless extension candidates. Maximal degree in co-relation 5392. Up to 1445 conditions per place. [2022-12-11 23:22:43,291 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 9 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2022-12-11 23:22:43,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 230 transitions, 645 flow [2022-12-11 23:22:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-11 23:22:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-11 23:22:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 943 transitions. [2022-12-11 23:22:43,293 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9208984375 [2022-12-11 23:22:43,293 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 6 predicate places. [2022-12-11 23:22:43,294 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 230 transitions, 645 flow [2022-12-11 23:22:43,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 230 transitions, 645 flow [2022-12-11 23:22:43,305 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 230 transitions, 645 flow [2022-12-11 23:22:43,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 233.75) internal successors, (935), 4 states have internal predecessors, (935), 0 states have call successors, (0), 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-11 23:22:43,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:43,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:43,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 23:22:43,306 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:43,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 314833467, now seen corresponding path program 1 times [2022-12-11 23:22:43,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:43,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344661165] [2022-12-11 23:22:43,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:43,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:43,423 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-11 23:22:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:43,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344661165] [2022-12-11 23:22:43,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344661165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:43,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:43,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 23:22:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210584503] [2022-12-11 23:22:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:43,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:22:43,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:43,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:22:43,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:22:43,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 256 [2022-12-11 23:22:43,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 230 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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-11 23:22:43,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:43,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 256 [2022-12-11 23:22:43,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:43,693 INFO L130 PetriNetUnfolder]: 567/2547 cut-off events. [2022-12-11 23:22:43,693 INFO L131 PetriNetUnfolder]: For 715/715 co-relation queries the response was YES. [2022-12-11 23:22:43,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3918 conditions, 2547 events. 567/2547 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 16630 event pairs, 437 based on Foata normal form. 0/2407 useless extension candidates. Maximal degree in co-relation 3565. Up to 891 conditions per place. [2022-12-11 23:22:43,701 INFO L137 encePairwiseOnDemand]: 252/256 looper letters, 13 selfloop transitions, 3 changer transitions 0/235 dead transitions. [2022-12-11 23:22:43,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 235 transitions, 714 flow [2022-12-11 23:22:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:22:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:22:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2022-12-11 23:22:43,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9440104166666666 [2022-12-11 23:22:43,703 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 8 predicate places. [2022-12-11 23:22:43,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 235 transitions, 714 flow [2022-12-11 23:22:43,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 235 transitions, 714 flow [2022-12-11 23:22:43,708 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 235 transitions, 714 flow [2022-12-11 23:22:43,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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-11 23:22:43,708 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:43,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:43,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 23:22:43,709 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1038158996, now seen corresponding path program 1 times [2022-12-11 23:22:43,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:43,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285448776] [2022-12-11 23:22:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:43,754 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-11 23:22:43,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285448776] [2022-12-11 23:22:43,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285448776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:43,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:43,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 23:22:43,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843603429] [2022-12-11 23:22:43,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:43,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 23:22:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:43,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 23:22:43,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 23:22:43,757 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 256 [2022-12-11 23:22:43,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 235 transitions, 714 flow. Second operand has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:22:43,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:43,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 256 [2022-12-11 23:22:43,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:44,179 INFO L130 PetriNetUnfolder]: 1088/4777 cut-off events. [2022-12-11 23:22:44,180 INFO L131 PetriNetUnfolder]: For 2008/2008 co-relation queries the response was YES. [2022-12-11 23:22:44,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7508 conditions, 4777 events. 1088/4777 cut-off events. For 2008/2008 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 39054 event pairs, 829 based on Foata normal form. 0/4515 useless extension candidates. Maximal degree in co-relation 6860. Up to 1693 conditions per place. [2022-12-11 23:22:44,200 INFO L137 encePairwiseOnDemand]: 251/256 looper letters, 24 selfloop transitions, 5 changer transitions 0/247 dead transitions. [2022-12-11 23:22:44,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 247 transitions, 884 flow [2022-12-11 23:22:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 23:22:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 23:22:44,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1191 transitions. [2022-12-11 23:22:44,202 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.93046875 [2022-12-11 23:22:44,203 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 12 predicate places. [2022-12-11 23:22:44,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 247 transitions, 884 flow [2022-12-11 23:22:44,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 247 transitions, 884 flow [2022-12-11 23:22:44,214 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 884 flow [2022-12-11 23:22:44,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 235.75) internal successors, (943), 4 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 23:22:44,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:44,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:44,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 23:22:44,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:44,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:44,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1520880418, now seen corresponding path program 1 times [2022-12-11 23:22:44,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:44,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671305856] [2022-12-11 23:22:44,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:44,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:45,028 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-11 23:22:45,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:45,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671305856] [2022-12-11 23:22:45,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671305856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:45,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:45,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-11 23:22:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155894244] [2022-12-11 23:22:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:45,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-11 23:22:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-11 23:22:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-11 23:22:45,032 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 256 [2022-12-11 23:22:45,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 884 flow. Second operand has 17 states, 17 states have (on average 169.41176470588235) internal successors, (2880), 17 states have internal predecessors, (2880), 0 states have call successors, (0), 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-11 23:22:45,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:45,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 256 [2022-12-11 23:22:45,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:46,365 INFO L130 PetriNetUnfolder]: 1699/6773 cut-off events. [2022-12-11 23:22:46,365 INFO L131 PetriNetUnfolder]: For 4009/4027 co-relation queries the response was YES. [2022-12-11 23:22:46,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13088 conditions, 6773 events. 1699/6773 cut-off events. For 4009/4027 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 59269 event pairs, 1273 based on Foata normal form. 0/6389 useless extension candidates. Maximal degree in co-relation 12310. Up to 2703 conditions per place. [2022-12-11 23:22:46,391 INFO L137 encePairwiseOnDemand]: 240/256 looper letters, 92 selfloop transitions, 20 changer transitions 0/269 dead transitions. [2022-12-11 23:22:46,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 269 transitions, 1193 flow [2022-12-11 23:22:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:22:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:22:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2606 transitions. [2022-12-11 23:22:46,396 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6786458333333333 [2022-12-11 23:22:46,398 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 26 predicate places. [2022-12-11 23:22:46,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 269 transitions, 1193 flow [2022-12-11 23:22:46,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 269 transitions, 1193 flow [2022-12-11 23:22:46,413 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 269 transitions, 1193 flow [2022-12-11 23:22:46,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 169.41176470588235) internal successors, (2880), 17 states have internal predecessors, (2880), 0 states have call successors, (0), 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-11 23:22:46,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:46,415 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:46,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 23:22:46,415 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:46,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1493657272, now seen corresponding path program 1 times [2022-12-11 23:22:46,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:46,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309159188] [2022-12-11 23:22:46,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:48,419 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-11 23:22:48,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:48,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309159188] [2022-12-11 23:22:48,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309159188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:48,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:48,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-12-11 23:22:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545260115] [2022-12-11 23:22:48,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:48,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-11 23:22:48,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:48,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-11 23:22:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-12-11 23:22:48,425 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 256 [2022-12-11 23:22:48,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 269 transitions, 1193 flow. Second operand has 27 states, 27 states have (on average 155.92592592592592) internal successors, (4210), 27 states have internal predecessors, (4210), 0 states have call successors, (0), 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-11 23:22:48,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:48,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 256 [2022-12-11 23:22:48,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:51,235 INFO L130 PetriNetUnfolder]: 1895/7270 cut-off events. [2022-12-11 23:22:51,236 INFO L131 PetriNetUnfolder]: For 7050/7086 co-relation queries the response was YES. [2022-12-11 23:22:51,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16761 conditions, 7270 events. 1895/7270 cut-off events. For 7050/7086 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 64699 event pairs, 1422 based on Foata normal form. 2/6871 useless extension candidates. Maximal degree in co-relation 15849. Up to 2813 conditions per place. [2022-12-11 23:22:51,333 INFO L137 encePairwiseOnDemand]: 225/256 looper letters, 103 selfloop transitions, 45 changer transitions 0/299 dead transitions. [2022-12-11 23:22:51,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 299 transitions, 1640 flow [2022-12-11 23:22:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 23:22:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 23:22:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4292 transitions. [2022-12-11 23:22:51,340 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6209490740740741 [2022-12-11 23:22:51,341 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 52 predicate places. [2022-12-11 23:22:51,341 INFO L82 GeneralOperation]: Start removeDead. Operand has 289 places, 299 transitions, 1640 flow [2022-12-11 23:22:51,362 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 299 transitions, 1640 flow [2022-12-11 23:22:51,362 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 299 transitions, 1640 flow [2022-12-11 23:22:51,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 155.92592592592592) internal successors, (4210), 27 states have internal predecessors, (4210), 0 states have call successors, (0), 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-11 23:22:51,364 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:51,364 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:51,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 23:22:51,364 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:51,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2011179461, now seen corresponding path program 1 times [2022-12-11 23:22:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:51,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979899073] [2022-12-11 23:22:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:52,332 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-11 23:22:52,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:52,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979899073] [2022-12-11 23:22:52,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979899073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:52,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:52,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-12-11 23:22:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454137503] [2022-12-11 23:22:52,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:52,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 23:22:52,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 23:22:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-12-11 23:22:52,335 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 256 [2022-12-11 23:22:52,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 299 transitions, 1640 flow. Second operand has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 0 states have call successors, (0), 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-11 23:22:52,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:52,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 256 [2022-12-11 23:22:52,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:53,668 INFO L130 PetriNetUnfolder]: 1887/7242 cut-off events. [2022-12-11 23:22:53,669 INFO L131 PetriNetUnfolder]: For 10280/10330 co-relation queries the response was YES. [2022-12-11 23:22:53,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19548 conditions, 7242 events. 1887/7242 cut-off events. For 10280/10330 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 64972 event pairs, 804 based on Foata normal form. 0/6845 useless extension candidates. Maximal degree in co-relation 18499. Up to 2800 conditions per place. [2022-12-11 23:22:53,699 INFO L137 encePairwiseOnDemand]: 239/256 looper letters, 123 selfloop transitions, 24 changer transitions 0/306 dead transitions. [2022-12-11 23:22:53,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 306 transitions, 2053 flow [2022-12-11 23:22:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 23:22:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 23:22:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2467 transitions. [2022-12-11 23:22:53,703 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424479166666667 [2022-12-11 23:22:53,704 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 64 predicate places. [2022-12-11 23:22:53,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 306 transitions, 2053 flow [2022-12-11 23:22:53,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 306 transitions, 2053 flow [2022-12-11 23:22:53,722 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 306 transitions, 2053 flow [2022-12-11 23:22:53,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 0 states have call successors, (0), 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-11 23:22:53,723 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:53,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:53,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 23:22:53,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash 206860257, now seen corresponding path program 1 times [2022-12-11 23:22:53,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:53,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658217162] [2022-12-11 23:22:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:53,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:53,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:55,726 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-11 23:22:55,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:55,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658217162] [2022-12-11 23:22:55,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658217162] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:55,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:55,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-11 23:22:55,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466886071] [2022-12-11 23:22:55,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:55,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-11 23:22:55,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-11 23:22:55,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-12-11 23:22:55,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 256 [2022-12-11 23:22:55,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 306 transitions, 2053 flow. Second operand has 29 states, 29 states have (on average 147.06896551724137) internal successors, (4265), 29 states have internal predecessors, (4265), 0 states have call successors, (0), 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-11 23:22:55,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:55,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 256 [2022-12-11 23:22:55,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:58,500 INFO L130 PetriNetUnfolder]: 1011/3783 cut-off events. [2022-12-11 23:22:58,501 INFO L131 PetriNetUnfolder]: For 8169/8347 co-relation queries the response was YES. [2022-12-11 23:22:58,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12116 conditions, 3783 events. 1011/3783 cut-off events. For 8169/8347 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27819 event pairs, 402 based on Foata normal form. 0/3569 useless extension candidates. Maximal degree in co-relation 11397. Up to 1503 conditions per place. [2022-12-11 23:22:58,522 INFO L137 encePairwiseOnDemand]: 227/256 looper letters, 139 selfloop transitions, 44 changer transitions 1/317 dead transitions. [2022-12-11 23:22:58,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 317 transitions, 2680 flow [2022-12-11 23:22:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 23:22:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 23:22:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4055 transitions. [2022-12-11 23:22:58,528 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866608796296297 [2022-12-11 23:22:58,528 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 82 predicate places. [2022-12-11 23:22:58,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 319 places, 317 transitions, 2680 flow [2022-12-11 23:22:58,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 316 transitions, 2668 flow [2022-12-11 23:22:58,544 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 316 transitions, 2668 flow [2022-12-11 23:22:58,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 147.06896551724137) internal successors, (4265), 29 states have internal predecessors, (4265), 0 states have call successors, (0), 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-11 23:22:58,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:58,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:58,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 23:22:58,545 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:58,546 INFO L85 PathProgramCache]: Analyzing trace with hash -67959762, now seen corresponding path program 1 times [2022-12-11 23:22:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:58,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383962897] [2022-12-11 23:22:58,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:22:58,632 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-11 23:22:58,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:22:58,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383962897] [2022-12-11 23:22:58,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383962897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:22:58,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:22:58,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 23:22:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824230578] [2022-12-11 23:22:58,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:22:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 23:22:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:22:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 23:22:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 23:22:58,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 256 [2022-12-11 23:22:58,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 316 transitions, 2668 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-11 23:22:58,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:22:58,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 256 [2022-12-11 23:22:58,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:22:58,788 INFO L130 PetriNetUnfolder]: 382/1570 cut-off events. [2022-12-11 23:22:58,788 INFO L131 PetriNetUnfolder]: For 6535/6559 co-relation queries the response was YES. [2022-12-11 23:22:58,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 1570 events. 382/1570 cut-off events. For 6535/6559 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8419 event pairs, 25 based on Foata normal form. 21/1528 useless extension candidates. Maximal degree in co-relation 5337. Up to 677 conditions per place. [2022-12-11 23:22:58,795 INFO L137 encePairwiseOnDemand]: 250/256 looper letters, 41 selfloop transitions, 6 changer transitions 2/322 dead transitions. [2022-12-11 23:22:58,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 322 transitions, 2904 flow [2022-12-11 23:22:58,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 23:22:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 23:22:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2022-12-11 23:22:58,796 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.92578125 [2022-12-11 23:22:58,798 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 84 predicate places. [2022-12-11 23:22:58,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 321 places, 322 transitions, 2904 flow [2022-12-11 23:22:58,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 320 transitions, 2854 flow [2022-12-11 23:22:58,804 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 320 transitions, 2854 flow [2022-12-11 23:22:58,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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-11 23:22:58,804 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:22:58,804 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:22:58,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 23:22:58,804 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:22:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:22:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash -853986226, now seen corresponding path program 1 times [2022-12-11 23:22:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:22:58,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673606806] [2022-12-11 23:22:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:22:58,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:22:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:23:00,698 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-11 23:23:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:23:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673606806] [2022-12-11 23:23:00,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673606806] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:23:00,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:23:00,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-12-11 23:23:00,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40158878] [2022-12-11 23:23:00,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:23:00,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-11 23:23:00,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:23:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-11 23:23:00,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2022-12-11 23:23:00,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 256 [2022-12-11 23:23:00,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 320 transitions, 2854 flow. Second operand has 29 states, 29 states have (on average 151.68965517241378) internal successors, (4399), 29 states have internal predecessors, (4399), 0 states have call successors, (0), 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-11 23:23:00,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:23:00,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 256 [2022-12-11 23:23:00,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:23:03,179 INFO L130 PetriNetUnfolder]: 537/2273 cut-off events. [2022-12-11 23:23:03,180 INFO L131 PetriNetUnfolder]: For 11381/11490 co-relation queries the response was YES. [2022-12-11 23:23:03,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10030 conditions, 2273 events. 537/2273 cut-off events. For 11381/11490 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13938 event pairs, 37 based on Foata normal form. 5/2173 useless extension candidates. Maximal degree in co-relation 8958. Up to 1002 conditions per place. [2022-12-11 23:23:03,190 INFO L137 encePairwiseOnDemand]: 221/256 looper letters, 210 selfloop transitions, 69 changer transitions 0/412 dead transitions. [2022-12-11 23:23:03,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 412 transitions, 4796 flow [2022-12-11 23:23:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-11 23:23:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-11 23:23:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4963 transitions. [2022-12-11 23:23:03,195 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6058349609375 [2022-12-11 23:23:03,195 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 115 predicate places. [2022-12-11 23:23:03,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 352 places, 412 transitions, 4796 flow [2022-12-11 23:23:03,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 352 places, 412 transitions, 4796 flow [2022-12-11 23:23:03,203 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 412 transitions, 4796 flow [2022-12-11 23:23:03,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 151.68965517241378) internal successors, (4399), 29 states have internal predecessors, (4399), 0 states have call successors, (0), 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-11 23:23:03,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:23:03,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:23:03,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 23:23:03,205 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:23:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:23:03,205 INFO L85 PathProgramCache]: Analyzing trace with hash 522133514, now seen corresponding path program 2 times [2022-12-11 23:23:03,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:23:03,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090963054] [2022-12-11 23:23:03,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:23:03,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:23:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:23:04,805 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-11 23:23:04,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:23:04,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090963054] [2022-12-11 23:23:04,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090963054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:23:04,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:23:04,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-12-11 23:23:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105783437] [2022-12-11 23:23:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:23:04,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-11 23:23:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:23:04,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-11 23:23:04,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2022-12-11 23:23:04,808 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 256 [2022-12-11 23:23:04,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 412 transitions, 4796 flow. Second operand has 30 states, 30 states have (on average 157.4) internal successors, (4722), 30 states have internal predecessors, (4722), 0 states have call successors, (0), 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-11 23:23:04,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:23:04,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 256 [2022-12-11 23:23:04,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:23:06,497 INFO L130 PetriNetUnfolder]: 439/1849 cut-off events. [2022-12-11 23:23:06,497 INFO L131 PetriNetUnfolder]: For 10998/11099 co-relation queries the response was YES. [2022-12-11 23:23:06,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9259 conditions, 1849 events. 439/1849 cut-off events. For 10998/11099 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10350 event pairs, 17 based on Foata normal form. 4/1781 useless extension candidates. Maximal degree in co-relation 8363. Up to 820 conditions per place. [2022-12-11 23:23:06,535 INFO L137 encePairwiseOnDemand]: 224/256 looper letters, 210 selfloop transitions, 64 changer transitions 0/413 dead transitions. [2022-12-11 23:23:06,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 413 transitions, 5341 flow [2022-12-11 23:23:06,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 23:23:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 23:23:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4335 transitions. [2022-12-11 23:23:06,542 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6271701388888888 [2022-12-11 23:23:06,544 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 141 predicate places. [2022-12-11 23:23:06,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 378 places, 413 transitions, 5341 flow [2022-12-11 23:23:06,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 378 places, 413 transitions, 5341 flow [2022-12-11 23:23:06,551 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 413 transitions, 5341 flow [2022-12-11 23:23:06,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 157.4) internal successors, (4722), 30 states have internal predecessors, (4722), 0 states have call successors, (0), 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-11 23:23:06,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:23:06,559 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:23:06,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 23:23:06,559 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:23:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:23:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash -143184009, now seen corresponding path program 1 times [2022-12-11 23:23:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:23:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499494399] [2022-12-11 23:23:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:23:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:23:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:23:10,393 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-11 23:23:10,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:23:10,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499494399] [2022-12-11 23:23:10,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499494399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:23:10,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:23:10,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-12-11 23:23:10,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909466871] [2022-12-11 23:23:10,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:23:10,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-11 23:23:10,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:23:10,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-11 23:23:10,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-12-11 23:23:10,398 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 256 [2022-12-11 23:23:10,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 413 transitions, 5341 flow. Second operand has 35 states, 35 states have (on average 144.4) internal successors, (5054), 35 states have internal predecessors, (5054), 0 states have call successors, (0), 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-11 23:23:10,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:23:10,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 256 [2022-12-11 23:23:10,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:23:13,176 INFO L130 PetriNetUnfolder]: 558/2291 cut-off events. [2022-12-11 23:23:13,176 INFO L131 PetriNetUnfolder]: For 18302/18419 co-relation queries the response was YES. [2022-12-11 23:23:13,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12331 conditions, 2291 events. 558/2291 cut-off events. For 18302/18419 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 13357 event pairs, 30 based on Foata normal form. 4/2203 useless extension candidates. Maximal degree in co-relation 10436. Up to 999 conditions per place. [2022-12-11 23:23:13,188 INFO L137 encePairwiseOnDemand]: 220/256 looper letters, 293 selfloop transitions, 61 changer transitions 0/491 dead transitions. [2022-12-11 23:23:13,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 491 transitions, 7518 flow [2022-12-11 23:23:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-11 23:23:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-11 23:23:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 5026 transitions. [2022-12-11 23:23:13,215 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5774356617647058 [2022-12-11 23:23:13,216 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 174 predicate places. [2022-12-11 23:23:13,216 INFO L82 GeneralOperation]: Start removeDead. Operand has 411 places, 491 transitions, 7518 flow [2022-12-11 23:23:13,227 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 411 places, 491 transitions, 7518 flow [2022-12-11 23:23:13,227 INFO L495 AbstractCegarLoop]: Abstraction has has 411 places, 491 transitions, 7518 flow [2022-12-11 23:23:13,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 144.4) internal successors, (5054), 35 states have internal predecessors, (5054), 0 states have call successors, (0), 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-11 23:23:13,238 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:23:13,238 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:23:13,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 23:23:13,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:23:13,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:23:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1520533144, now seen corresponding path program 1 times [2022-12-11 23:23:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:23:13,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667766449] [2022-12-11 23:23:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:23:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:23:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 23:23:18,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 23:23:18,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 23:23:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667766449] [2022-12-11 23:23:18,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667766449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 23:23:18,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 23:23:18,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-12-11 23:23:18,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415945322] [2022-12-11 23:23:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 23:23:18,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-11 23:23:18,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 23:23:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-11 23:23:18,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2022-12-11 23:23:18,282 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 256 [2022-12-11 23:23:18,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 491 transitions, 7518 flow. Second operand has 47 states, 47 states have (on average 117.31914893617021) internal successors, (5514), 47 states have internal predecessors, (5514), 0 states have call successors, (0), 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-11 23:23:18,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 23:23:18,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 256 [2022-12-11 23:23:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 23:23:33,503 INFO L130 PetriNetUnfolder]: 6364/14815 cut-off events. [2022-12-11 23:23:33,504 INFO L131 PetriNetUnfolder]: For 122955/123094 co-relation queries the response was YES. [2022-12-11 23:23:33,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75316 conditions, 14815 events. 6364/14815 cut-off events. For 122955/123094 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 115353 event pairs, 1273 based on Foata normal form. 9/13737 useless extension candidates. Maximal degree in co-relation 69842. Up to 5691 conditions per place. [2022-12-11 23:23:33,573 INFO L137 encePairwiseOnDemand]: 197/256 looper letters, 815 selfloop transitions, 195 changer transitions 76/1200 dead transitions. [2022-12-11 23:23:33,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1200 transitions, 17473 flow [2022-12-11 23:23:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-12-11 23:23:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-12-11 23:23:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 10551 transitions. [2022-12-11 23:23:33,581 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48488051470588234 [2022-12-11 23:23:33,581 INFO L295 CegarLoopForPetriNet]: 237 programPoint places, 258 predicate places. [2022-12-11 23:23:33,582 INFO L82 GeneralOperation]: Start removeDead. Operand has 495 places, 1200 transitions, 17473 flow [2022-12-11 23:23:33,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 495 places, 1124 transitions, 16025 flow [2022-12-11 23:23:33,628 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 1124 transitions, 16025 flow [2022-12-11 23:23:33,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 117.31914893617021) internal successors, (5514), 47 states have internal predecessors, (5514), 0 states have call successors, (0), 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-11 23:23:33,629 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 23:23:33,629 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 23:23:33,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 23:23:33,629 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 23:23:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 23:23:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1771181584, now seen corresponding path program 2 times [2022-12-11 23:23:33,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 23:23:33,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534285380] [2022-12-11 23:23:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 23:23:33,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 23:23:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-12-11 23:36:15,680 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 23:36:15,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 23:36:15,711 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-11 23:36:15,715 INFO L158 Benchmark]: Toolchain (without parser) took 816138.49ms. Allocated memory was 246.4MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 220.9MB in the beginning and 719.4MB in the end (delta: -498.5MB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2022-12-11 23:36:15,715 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 246.4MB. Free memory was 222.5MB in the beginning and 222.4MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 23:36:15,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.24ms. Allocated memory is still 246.4MB. Free memory was 220.4MB in the beginning and 190.5MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-11 23:36:15,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.72ms. Allocated memory is still 246.4MB. Free memory was 190.5MB in the beginning and 187.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 23:36:15,716 INFO L158 Benchmark]: Boogie Preprocessor took 50.94ms. Allocated memory is still 246.4MB. Free memory was 187.4MB in the beginning and 185.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 23:36:15,716 INFO L158 Benchmark]: RCFGBuilder took 585.47ms. Allocated memory is still 246.4MB. Free memory was 184.8MB in the beginning and 161.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-11 23:36:15,716 INFO L158 Benchmark]: TraceAbstraction took 814969.58ms. Allocated memory was 246.4MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 160.1MB in the beginning and 719.4MB in the end (delta: -559.3MB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2022-12-11 23:36:15,717 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.11ms. Allocated memory is still 246.4MB. Free memory was 222.5MB in the beginning and 222.4MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.24ms. Allocated memory is still 246.4MB. Free memory was 220.4MB in the beginning and 190.5MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.72ms. Allocated memory is still 246.4MB. Free memory was 190.5MB in the beginning and 187.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.94ms. Allocated memory is still 246.4MB. Free memory was 187.4MB in the beginning and 185.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 585.47ms. Allocated memory is still 246.4MB. Free memory was 184.8MB in the beginning and 161.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 814969.58ms. Allocated memory was 246.4MB in the beginning and 5.1GB in the end (delta: 4.8GB). Free memory was 160.1MB in the beginning and 719.4MB in the end (delta: -559.3MB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown