/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:41:56,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:41:56,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:41:56,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:41:56,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:41:56,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:41:56,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:41:56,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:41:56,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:41:56,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:41:56,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:41:56,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:41:56,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:41:56,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:41:56,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:41:56,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:41:56,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:41:56,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:41:56,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:41:56,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:41:56,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:41:56,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:41:56,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:41:56,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:41:56,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:41:56,181 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:41:56,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:41:56,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:41:56,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:41:56,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:41:56,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:41:56,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:41:56,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:41:56,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:41:56,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:41:56,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:41:56,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:41:56,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:41:56,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:41:56,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:41:56,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:41:56,188 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-VariableLbe.epf [2023-01-27 21:41:56,211 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:41:56,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:41:56,212 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:41:56,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:41:56,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:41:56,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:41:56,213 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:41:56,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:41:56,213 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:41:56,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:41:56,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:41:56,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:41:56,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:41:56,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:41:56,216 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:41:56,216 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:41:56,216 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 21:41:56,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:41:56,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:41:56,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:41:56,416 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:41:56,416 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:41:56,417 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2023-01-27 21:41:57,274 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:41:57,488 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:41:57,488 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2023-01-27 21:41:57,500 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffaf9fecc/498b90f0640d4d55a63d0ce3aac3e49c/FLAGb1c9ac9d8 [2023-01-27 21:41:57,907 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffaf9fecc/498b90f0640d4d55a63d0ce3aac3e49c [2023-01-27 21:41:57,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:41:57,912 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:41:57,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:41:57,913 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:41:57,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:41:57,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:41:57" (1/1) ... [2023-01-27 21:41:57,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d957805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:57, skipping insertion in model container [2023-01-27 21:41:57,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:41:57" (1/1) ... [2023-01-27 21:41:57,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:41:57,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:41:58,060 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c[3424,3437] [2023-01-27 21:41:58,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:41:58,072 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:41:58,086 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c[3424,3437] [2023-01-27 21:41:58,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:41:58,095 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:41:58,095 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:41:58,100 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:41:58,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58 WrapperNode [2023-01-27 21:41:58,100 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:41:58,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:41:58,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:41:58,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:41:58,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,127 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 252 [2023-01-27 21:41:58,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:41:58,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:41:58,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:41:58,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:41:58,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,145 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:41:58,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:41:58,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:41:58,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:41:58,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (1/1) ... [2023-01-27 21:41:58,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:41:58,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:41:58,170 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) [2023-01-27 21:41:58,186 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 [2023-01-27 21:41:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:41:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:41:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:41:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:41:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:41:58,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:41:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:41:58,203 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:41:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 21:41:58,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 21:41:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:41:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:41:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:41:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 21:41:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:41:58,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:41:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:41:58,206 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 21:41:58,277 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:41:58,279 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:41:58,563 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:41:58,685 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:41:58,685 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-27 21:41:58,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:41:58 BoogieIcfgContainer [2023-01-27 21:41:58,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:41:58,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:41:58,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:41:58,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:41:58,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:41:57" (1/3) ... [2023-01-27 21:41:58,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d2cac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:41:58, skipping insertion in model container [2023-01-27 21:41:58,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:41:58" (2/3) ... [2023-01-27 21:41:58,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d2cac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:41:58, skipping insertion in model container [2023-01-27 21:41:58,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:41:58" (3/3) ... [2023-01-27 21:41:58,693 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2023-01-27 21:41:58,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:41:58,705 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:41:58,705 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:41:58,791 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-27 21:41:58,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 201 transitions, 426 flow [2023-01-27 21:41:58,913 INFO L130 PetriNetUnfolder]: 18/198 cut-off events. [2023-01-27 21:41:58,913 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:41:58,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 18/198 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 116 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2023-01-27 21:41:58,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 201 transitions, 426 flow [2023-01-27 21:41:58,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 188 transitions, 394 flow [2023-01-27 21:41:58,928 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:41:58,940 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 188 transitions, 394 flow [2023-01-27 21:41:58,943 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 188 transitions, 394 flow [2023-01-27 21:41:58,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 188 transitions, 394 flow [2023-01-27 21:41:58,972 INFO L130 PetriNetUnfolder]: 18/188 cut-off events. [2023-01-27 21:41:58,972 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:41:58,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 18/188 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2023-01-27 21:41:58,974 INFO L119 LiptonReduction]: Number of co-enabled transitions 1456 [2023-01-27 21:42:04,079 INFO L134 LiptonReduction]: Checked pairs total: 2169 [2023-01-27 21:42:04,079 INFO L136 LiptonReduction]: Total number of compositions: 199 [2023-01-27 21:42:04,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:42:04,117 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;@77614cbf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:42:04,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-27 21:42:04,129 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-01-27 21:42:04,129 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-27 21:42:04,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:42:04,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:42:04,141 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 1 more)] === [2023-01-27 21:42:04,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:42:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1991589664, now seen corresponding path program 1 times [2023-01-27 21:42:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:42:04,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488830371] [2023-01-27 21:42:04,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:42:04,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:42:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:42:04,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:42:04,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:42:04,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488830371] [2023-01-27 21:42:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488830371] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:42:04,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:42:04,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 21:42:04,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545606168] [2023-01-27 21:42:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:42:04,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-27 21:42:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:42:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-27 21:42:04,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-27 21:42:04,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 400 [2023-01-27 21:42:04,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:42:04,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 400 [2023-01-27 21:42:04,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:42:04,521 INFO L130 PetriNetUnfolder]: 321/458 cut-off events. [2023-01-27 21:42:04,521 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-01-27 21:42:04,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 458 events. 321/458 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1470 event pairs, 166 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 732. Up to 449 conditions per place. [2023-01-27 21:42:04,525 INFO L137 encePairwiseOnDemand]: 399/400 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-01-27 21:42:04,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2023-01-27 21:42:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-27 21:42:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-27 21:42:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 377 transitions. [2023-01-27 21:42:04,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47125 [2023-01-27 21:42:04,535 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 377 transitions. [2023-01-27 21:42:04,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 377 transitions. [2023-01-27 21:42:04,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:42:04,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 377 transitions. [2023-01-27 21:42:04,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.5) internal successors, (377), 2 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 400.0) internal successors, (1200), 3 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,544 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 400.0) internal successors, (1200), 3 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,545 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 2 states and 377 transitions. [2023-01-27 21:42:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 120 flow [2023-01-27 21:42:04,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-27 21:42:04,549 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 60 flow [2023-01-27 21:42:04,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-01-27 21:42:04,552 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-01-27 21:42:04,552 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 60 flow [2023-01-27 21:42:04,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:42:04,552 INFO L208 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] [2023-01-27 21:42:04,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:42:04,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:42:04,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:42:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1850484059, now seen corresponding path program 1 times [2023-01-27 21:42:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:42:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867305112] [2023-01-27 21:42:04,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:42:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:42:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:42:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:42:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:42:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867305112] [2023-01-27 21:42:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867305112] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:42:04,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:42:04,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:42:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825809201] [2023-01-27 21:42:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:42:04,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:42:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:42:04,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:42:04,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:42:04,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 400 [2023-01-27 21:42:04,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:42:04,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 400 [2023-01-27 21:42:04,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:42:04,834 INFO L130 PetriNetUnfolder]: 326/478 cut-off events. [2023-01-27 21:42:04,834 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 21:42:04,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 478 events. 326/478 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1521 event pairs, 167 based on Foata normal form. 16/336 useless extension candidates. Maximal degree in co-relation 962. Up to 449 conditions per place. [2023-01-27 21:42:04,837 INFO L137 encePairwiseOnDemand]: 394/400 looper letters, 23 selfloop transitions, 2 changer transitions 11/39 dead transitions. [2023-01-27 21:42:04,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 159 flow [2023-01-27 21:42:04,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:42:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:42:04,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2023-01-27 21:42:04,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.401875 [2023-01-27 21:42:04,843 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2023-01-27 21:42:04,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2023-01-27 21:42:04,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:42:04,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2023-01-27 21:42:04,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,851 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,852 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 60 flow. Second operand 4 states and 643 transitions. [2023-01-27 21:42:04,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 159 flow [2023-01-27 21:42:04,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 159 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 21:42:04,853 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 78 flow [2023-01-27 21:42:04,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-01-27 21:42:04,854 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-01-27 21:42:04,854 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 78 flow [2023-01-27 21:42:04,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:04,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:42:04,855 INFO L208 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] [2023-01-27 21:42:04,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:42:04,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:42:04,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:42:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1330974784, now seen corresponding path program 1 times [2023-01-27 21:42:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:42:04,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86795918] [2023-01-27 21:42:04,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:42:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:42:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:42:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:42:05,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:42:05,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86795918] [2023-01-27 21:42:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86795918] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:42:05,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:42:05,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:42:05,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242803926] [2023-01-27 21:42:05,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:42:05,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:42:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:42:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:42:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:42:05,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 400 [2023-01-27 21:42:05,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:42:05,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 400 [2023-01-27 21:42:05,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:42:05,127 INFO L130 PetriNetUnfolder]: 368/551 cut-off events. [2023-01-27 21:42:05,128 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2023-01-27 21:42:05,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 551 events. 368/551 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1947 event pairs, 194 based on Foata normal form. 24/403 useless extension candidates. Maximal degree in co-relation 1341. Up to 447 conditions per place. [2023-01-27 21:42:05,131 INFO L137 encePairwiseOnDemand]: 392/400 looper letters, 23 selfloop transitions, 3 changer transitions 12/41 dead transitions. [2023-01-27 21:42:05,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 190 flow [2023-01-27 21:42:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:42:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:42:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2023-01-27 21:42:05,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398 [2023-01-27 21:42:05,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 796 transitions. [2023-01-27 21:42:05,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 796 transitions. [2023-01-27 21:42:05,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:42:05,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 796 transitions. [2023-01-27 21:42:05,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,137 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 78 flow. Second operand 5 states and 796 transitions. [2023-01-27 21:42:05,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 190 flow [2023-01-27 21:42:05,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 186 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 21:42:05,139 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 96 flow [2023-01-27 21:42:05,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2023-01-27 21:42:05,141 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-01-27 21:42:05,143 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 96 flow [2023-01-27 21:42:05,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:42:05,144 INFO L208 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] [2023-01-27 21:42:05,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 21:42:05,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:42:05,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:42:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash 80366818, now seen corresponding path program 1 times [2023-01-27 21:42:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:42:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482834650] [2023-01-27 21:42:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:42:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:42:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:42:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:42:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:42:05,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482834650] [2023-01-27 21:42:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482834650] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:42:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:42:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 21:42:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707368564] [2023-01-27 21:42:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:42:05,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:42:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:42:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:42:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:42:05,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 400 [2023-01-27 21:42:05,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:42:05,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 400 [2023-01-27 21:42:05,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:42:05,386 INFO L130 PetriNetUnfolder]: 340/486 cut-off events. [2023-01-27 21:42:05,386 INFO L131 PetriNetUnfolder]: For 145/169 co-relation queries the response was YES. [2023-01-27 21:42:05,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 486 events. 340/486 cut-off events. For 145/169 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1458 event pairs, 48 based on Foata normal form. 10/329 useless extension candidates. Maximal degree in co-relation 1360. Up to 390 conditions per place. [2023-01-27 21:42:05,388 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-01-27 21:42:05,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 200 flow [2023-01-27 21:42:05,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:42:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:42:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-01-27 21:42:05,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2023-01-27 21:42:05,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-01-27 21:42:05,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-01-27 21:42:05,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:42:05,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-01-27 21:42:05,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,398 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 96 flow. Second operand 3 states and 552 transitions. [2023-01-27 21:42:05,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 200 flow [2023-01-27 21:42:05,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 194 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-27 21:42:05,400 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 115 flow [2023-01-27 21:42:05,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-01-27 21:42:05,402 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-01-27 21:42:05,402 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 115 flow [2023-01-27 21:42:05,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:05,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:42:05,402 INFO L208 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] [2023-01-27 21:42:05,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 21:42:05,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:42:05,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:42:05,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1541808918, now seen corresponding path program 2 times [2023-01-27 21:42:05,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:42:05,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311715415] [2023-01-27 21:42:05,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:42:05,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:42:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:42:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:42:06,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:42:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311715415] [2023-01-27 21:42:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311715415] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:42:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651959204] [2023-01-27 21:42:06,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:42:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:42:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:42:06,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:42:07,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 21:42:07,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-27 21:42:07,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:42:07,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-27 21:42:07,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:42:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:07,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:42:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:42:07,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 21:42:07,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651959204] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:42:07,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 21:42:07,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 18 [2023-01-27 21:42:07,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719898077] [2023-01-27 21:42:07,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:42:07,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 21:42:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:42:07,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 21:42:07,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2023-01-27 21:42:07,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 400 [2023-01-27 21:42:07,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 115 flow. Second operand has 9 states, 9 states have (on average 138.44444444444446) internal successors, (1246), 9 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:07,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:42:07,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 400 [2023-01-27 21:42:07,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:42:07,755 INFO L130 PetriNetUnfolder]: 282/446 cut-off events. [2023-01-27 21:42:07,755 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2023-01-27 21:42:07,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 446 events. 282/446 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1383 event pairs, 57 based on Foata normal form. 5/330 useless extension candidates. Maximal degree in co-relation 1388. Up to 360 conditions per place. [2023-01-27 21:42:07,758 INFO L137 encePairwiseOnDemand]: 389/400 looper letters, 36 selfloop transitions, 8 changer transitions 22/68 dead transitions. [2023-01-27 21:42:07,758 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 68 transitions, 349 flow [2023-01-27 21:42:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 21:42:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 21:42:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1154 transitions. [2023-01-27 21:42:07,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.360625 [2023-01-27 21:42:07,760 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1154 transitions. [2023-01-27 21:42:07,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1154 transitions. [2023-01-27 21:42:07,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:42:07,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1154 transitions. [2023-01-27 21:42:07,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.25) internal successors, (1154), 8 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:07,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:07,767 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:07,768 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 115 flow. Second operand 8 states and 1154 transitions. [2023-01-27 21:42:07,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 68 transitions, 349 flow [2023-01-27 21:42:07,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 329 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-27 21:42:07,771 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 168 flow [2023-01-27 21:42:07,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-01-27 21:42:07,773 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-01-27 21:42:07,773 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 168 flow [2023-01-27 21:42:07,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.44444444444446) internal successors, (1246), 9 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:07,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:42:07,773 INFO L208 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] [2023-01-27 21:42:07,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 21:42:07,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:42:07,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:42:07,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:42:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1719258706, now seen corresponding path program 3 times [2023-01-27 21:42:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:42:07,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089352586] [2023-01-27 21:42:07,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:42:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:42:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:42:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:42:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:42:09,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089352586] [2023-01-27 21:42:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089352586] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:42:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804447795] [2023-01-27 21:42:09,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:42:09,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:42:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:42:09,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:42:09,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 21:42:09,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-01-27 21:42:09,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:42:09,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-27 21:42:09,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:42:09,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:09,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:42:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:42:09,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 21:42:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804447795] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:42:09,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 21:42:09,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2023-01-27 21:42:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998658112] [2023-01-27 21:42:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:42:09,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-01-27 21:42:09,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:42:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-01-27 21:42:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-01-27 21:42:09,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 400 [2023-01-27 21:42:09,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 138.44444444444446) internal successors, (1246), 9 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:09,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:42:09,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 400 [2023-01-27 21:42:09,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:42:09,888 INFO L130 PetriNetUnfolder]: 297/503 cut-off events. [2023-01-27 21:42:09,888 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2023-01-27 21:42:09,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 503 events. 297/503 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1833 event pairs, 61 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1722. Up to 380 conditions per place. [2023-01-27 21:42:09,891 INFO L137 encePairwiseOnDemand]: 388/400 looper letters, 39 selfloop transitions, 8 changer transitions 25/74 dead transitions. [2023-01-27 21:42:09,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 439 flow [2023-01-27 21:42:09,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 21:42:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 21:42:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1153 transitions. [2023-01-27 21:42:09,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3603125 [2023-01-27 21:42:09,894 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1153 transitions. [2023-01-27 21:42:09,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1153 transitions. [2023-01-27 21:42:09,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:42:09,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1153 transitions. [2023-01-27 21:42:09,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 144.125) internal successors, (1153), 8 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:09,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:09,900 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:09,900 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 168 flow. Second operand 8 states and 1153 transitions. [2023-01-27 21:42:09,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 439 flow [2023-01-27 21:42:09,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 421 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-01-27 21:42:09,902 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 219 flow [2023-01-27 21:42:09,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-01-27 21:42:09,903 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2023-01-27 21:42:09,903 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 219 flow [2023-01-27 21:42:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.44444444444446) internal successors, (1246), 9 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:09,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:42:09,903 INFO L208 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] [2023-01-27 21:42:09,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-27 21:42:10,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-27 21:42:10,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:42:10,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:42:10,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1871079068, now seen corresponding path program 4 times [2023-01-27 21:42:10,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:42:10,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035728490] [2023-01-27 21:42:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:42:10,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:42:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:42:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:42:11,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:42:11,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035728490] [2023-01-27 21:42:11,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035728490] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:42:11,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909588589] [2023-01-27 21:42:11,413 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 21:42:11,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:42:11,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:42:11,414 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:42:11,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 21:42:11,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 21:42:11,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:42:11,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 81 conjunts are in the unsatisfiable core [2023-01-27 21:42:11,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:42:11,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:11,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:11,552 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2023-01-27 21:42:11,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 32 [2023-01-27 21:42:11,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 21:42:11,671 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-27 21:42:11,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:42:11,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:42:11,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:42:11,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:42:12,211 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 21:42:12,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 53 [2023-01-27 21:42:12,226 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-01-27 21:42:12,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2023-01-27 21:42:12,443 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:42:12,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:12,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 12 [2023-01-27 21:42:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:42:12,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:42:12,593 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (let ((.cse0 (* c_~t~0 2)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse1)) 1) c_~s~0)) (forall ((v_ArrVal_262 (Array Int Int))) (<= c_~s~0 (+ .cse0 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse1)))))))) is different from false [2023-01-27 21:42:12,761 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (or (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (not (= (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ .cse0 1))))) (<= c_~n2~0 c_~q2_front~0) (let ((.cse3 (+ c_~s~0 .cse0)) (.cse1 (* c_~t~0 2)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse1 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2))) .cse3)) (forall ((v_ArrVal_262 (Array Int Int))) (<= .cse3 (+ .cse1 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2)) 1))))) (< c_~q2_front~0 0))) is different from false [2023-01-27 21:42:12,799 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~q1~0.base)) (.cse1 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (or (< c_~q2_back~0 0) (forall ((~q1_back~0 Int)) (or (<= c_~n1~0 ~q1_back~0) (not (= (select .cse0 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (< ~q1_back~0 0))) (<= c_~n2~0 c_~q2_back~0) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (not (= (select .cse0 (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ .cse1 1))))) (<= c_~n2~0 c_~q2_front~0) (let ((.cse4 (+ c_~s~0 .cse1)) (.cse2 (* c_~t~0 2)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse3))) .cse4)) (forall ((v_ArrVal_262 (Array Int Int))) (<= .cse4 (+ .cse2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse3)) 1))))) (< c_~q2_front~0 0))) is different from false [2023-01-27 21:42:22,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:22,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 117 [2023-01-27 21:42:22,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:22,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3894 treesize of output 3822 [2023-01-27 21:42:22,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:22,413 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:22,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1172 treesize of output 992 [2023-01-27 21:42:22,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:22,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:22,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 956 treesize of output 884 [2023-01-27 21:42:22,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:22,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:22,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 848 treesize of output 806 [2023-01-27 21:42:22,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 82 [2023-01-27 21:42:27,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:27,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 116 [2023-01-27 21:42:27,761 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:42:27,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:27,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4442 treesize of output 4290 [2023-01-27 21:42:27,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:27,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:27,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 995 treesize of output 927 [2023-01-27 21:42:27,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:27,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:27,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 904 treesize of output 866 [2023-01-27 21:42:27,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:42:27,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:42:27,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 870 treesize of output 698 [2023-01-27 21:42:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:42:34,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909588589] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:42:34,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:42:34,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2023-01-27 21:42:34,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627579086] [2023-01-27 21:42:34,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:42:34,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-27 21:42:34,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:42:34,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-27 21:42:34,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=842, Unknown=5, NotChecked=180, Total=1122 [2023-01-27 21:42:34,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 400 [2023-01-27 21:42:34,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 219 flow. Second operand has 34 states, 34 states have (on average 103.73529411764706) internal successors, (3527), 34 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:42:34,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:42:34,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 400 [2023-01-27 21:42:34,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:42:41,635 WARN L222 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 177 DAG size of output: 169 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:42:43,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:42:52,771 WARN L222 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 138 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:43:09,077 WARN L222 SmtUtils]: Spent 13.12s on a formula simplification. DAG size of input: 290 DAG size of output: 247 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:43:23,422 WARN L222 SmtUtils]: Spent 13.62s on a formula simplification that was a NOOP. DAG size: 204 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:43:51,150 WARN L222 SmtUtils]: Spent 25.50s on a formula simplification. DAG size of input: 277 DAG size of output: 241 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:44:18,425 WARN L222 SmtUtils]: Spent 22.21s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:44:20,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:44:23,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:44:25,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 21:44:37,414 WARN L222 SmtUtils]: Spent 6.68s on a formula simplification that was a NOOP. DAG size: 269 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:11,807 WARN L222 SmtUtils]: Spent 25.40s on a formula simplification. DAG size of input: 278 DAG size of output: 239 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:42,352 WARN L222 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 273 DAG size of output: 231 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:45:44,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:45:46,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:45:48,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:45:50,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:45:52,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:45:54,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:46:24,524 WARN L222 SmtUtils]: Spent 19.09s on a formula simplification that was a NOOP. DAG size: 263 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:47:11,078 WARN L222 SmtUtils]: Spent 40.22s on a formula simplification. DAG size of input: 273 DAG size of output: 262 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:47:13,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:47:15,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:47:17,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:47:19,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:47:53,979 WARN L222 SmtUtils]: Spent 27.89s on a formula simplification. DAG size of input: 261 DAG size of output: 223 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:48:34,303 WARN L222 SmtUtils]: Spent 38.06s on a formula simplification. DAG size of input: 255 DAG size of output: 244 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:49:31,759 WARN L222 SmtUtils]: Spent 55.03s on a formula simplification. DAG size of input: 215 DAG size of output: 203 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:49:33,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:35,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:37,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:39,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:41,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:43,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:46,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:48,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:51,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:53,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:49:57,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:00,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:02,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:04,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:06,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:08,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:10,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:12,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:14,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:16,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:18,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:50:19,425 INFO L130 PetriNetUnfolder]: 763/1324 cut-off events. [2023-01-27 21:50:19,425 INFO L131 PetriNetUnfolder]: For 2296/2298 co-relation queries the response was YES. [2023-01-27 21:50:19,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4959 conditions, 1324 events. 763/1324 cut-off events. For 2296/2298 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6381 event pairs, 62 based on Foata normal form. 2/1041 useless extension candidates. Maximal degree in co-relation 4943. Up to 481 conditions per place. [2023-01-27 21:50:19,431 INFO L137 encePairwiseOnDemand]: 378/400 looper letters, 123 selfloop transitions, 62 changer transitions 96/283 dead transitions. [2023-01-27 21:50:19,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 283 transitions, 1843 flow [2023-01-27 21:50:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-27 21:50:19,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-01-27 21:50:19,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4360 transitions. [2023-01-27 21:50:19,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2725 [2023-01-27 21:50:19,441 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 4360 transitions. [2023-01-27 21:50:19,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 4360 transitions. [2023-01-27 21:50:19,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:50:19,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 4360 transitions. [2023-01-27 21:50:19,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 109.0) internal successors, (4360), 40 states have internal predecessors, (4360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:19,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 400.0) internal successors, (16400), 41 states have internal predecessors, (16400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:19,463 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 400.0) internal successors, (16400), 41 states have internal predecessors, (16400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:19,463 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 219 flow. Second operand 40 states and 4360 transitions. [2023-01-27 21:50:19,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 283 transitions, 1843 flow [2023-01-27 21:50:19,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 283 transitions, 1731 flow, removed 48 selfloop flow, removed 5 redundant places. [2023-01-27 21:50:19,472 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 818 flow [2023-01-27 21:50:19,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=818, PETRI_PLACES=108, PETRI_TRANSITIONS=97} [2023-01-27 21:50:19,473 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 76 predicate places. [2023-01-27 21:50:19,473 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 818 flow [2023-01-27 21:50:19,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 103.73529411764706) internal successors, (3527), 34 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:19,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:50:19,474 INFO L208 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] [2023-01-27 21:50:19,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 21:50:19,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:50:19,679 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:50:19,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:50:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1105249356, now seen corresponding path program 5 times [2023-01-27 21:50:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:50:19,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588341140] [2023-01-27 21:50:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:50:19,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:50:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:50:20,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:50:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:50:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588341140] [2023-01-27 21:50:20,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588341140] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:50:20,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981349278] [2023-01-27 21:50:20,883 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 21:50:20,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:50:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:50:20,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:50:20,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 21:50:20,969 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:50:20,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:50:20,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjunts are in the unsatisfiable core [2023-01-27 21:50:20,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:50:21,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:50:21,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:50:21,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:50:21,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:50:21,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:50:21,764 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 21:50:21,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 16 [2023-01-27 21:50:21,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:50:21,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:50:22,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:22,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1102 treesize of output 1034 [2023-01-27 21:50:22,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:22,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 554 treesize of output 462 [2023-01-27 21:50:22,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:22,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 358 treesize of output 332 [2023-01-27 21:50:39,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:50:39,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981349278] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:50:39,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:50:39,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2023-01-27 21:50:39,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857296334] [2023-01-27 21:50:39,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:50:39,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-27 21:50:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:50:39,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-27 21:50:39,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=930, Unknown=11, NotChecked=0, Total=1056 [2023-01-27 21:50:39,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 400 [2023-01-27 21:50:39,428 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 818 flow. Second operand has 33 states, 33 states have (on average 110.93939393939394) internal successors, (3661), 33 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:39,428 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:50:39,428 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 400 [2023-01-27 21:50:39,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:50:45,244 INFO L130 PetriNetUnfolder]: 1720/2756 cut-off events. [2023-01-27 21:50:45,244 INFO L131 PetriNetUnfolder]: For 16510/16512 co-relation queries the response was YES. [2023-01-27 21:50:45,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15395 conditions, 2756 events. 1720/2756 cut-off events. For 16510/16512 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14028 event pairs, 103 based on Foata normal form. 4/2275 useless extension candidates. Maximal degree in co-relation 15359. Up to 1021 conditions per place. [2023-01-27 21:50:45,263 INFO L137 encePairwiseOnDemand]: 385/400 looper letters, 217 selfloop transitions, 172 changer transitions 52/443 dead transitions. [2023-01-27 21:50:45,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 443 transitions, 5019 flow [2023-01-27 21:50:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-27 21:50:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-01-27 21:50:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4912 transitions. [2023-01-27 21:50:45,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2923809523809524 [2023-01-27 21:50:45,273 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4912 transitions. [2023-01-27 21:50:45,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4912 transitions. [2023-01-27 21:50:45,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:50:45,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4912 transitions. [2023-01-27 21:50:45,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 116.95238095238095) internal successors, (4912), 42 states have internal predecessors, (4912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:45,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 400.0) internal successors, (17200), 43 states have internal predecessors, (17200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:45,308 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 400.0) internal successors, (17200), 43 states have internal predecessors, (17200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:45,308 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 818 flow. Second operand 42 states and 4912 transitions. [2023-01-27 21:50:45,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 443 transitions, 5019 flow [2023-01-27 21:50:45,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 443 transitions, 3816 flow, removed 576 selfloop flow, removed 11 redundant places. [2023-01-27 21:50:45,345 INFO L231 Difference]: Finished difference. Result has 140 places, 245 transitions, 2512 flow [2023-01-27 21:50:45,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2512, PETRI_PLACES=140, PETRI_TRANSITIONS=245} [2023-01-27 21:50:45,347 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2023-01-27 21:50:45,347 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 245 transitions, 2512 flow [2023-01-27 21:50:45,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 110.93939393939394) internal successors, (3661), 33 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:45,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:50:45,348 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:50:45,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-27 21:50:45,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:50:45,553 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:50:45,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:50:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1562981495, now seen corresponding path program 6 times [2023-01-27 21:50:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:50:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690282045] [2023-01-27 21:50:45,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:50:45,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:50:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:50:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:50:47,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:50:47,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690282045] [2023-01-27 21:50:47,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690282045] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:50:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577368699] [2023-01-27 21:50:47,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 21:50:47,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:50:47,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:50:47,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:50:47,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 21:50:47,953 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-01-27 21:50:47,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:50:47,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-27 21:50:47,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:50:48,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:50:48,225 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-01-27 21:50:48,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2023-01-27 21:50:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:50:48,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 21:50:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577368699] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:50:48,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 21:50:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 20 [2023-01-27 21:50:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230298681] [2023-01-27 21:50:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:50:48,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:50:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:50:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:50:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2023-01-27 21:50:48,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 400 [2023-01-27 21:50:48,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 245 transitions, 2512 flow. Second operand has 10 states, 10 states have (on average 133.2) internal successors, (1332), 10 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:48,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:50:48,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 400 [2023-01-27 21:50:48,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:50:48,813 INFO L130 PetriNetUnfolder]: 1634/2596 cut-off events. [2023-01-27 21:50:48,813 INFO L131 PetriNetUnfolder]: For 19871/19881 co-relation queries the response was YES. [2023-01-27 21:50:48,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15254 conditions, 2596 events. 1634/2596 cut-off events. For 19871/19881 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12811 event pairs, 223 based on Foata normal form. 1/2368 useless extension candidates. Maximal degree in co-relation 15210. Up to 2376 conditions per place. [2023-01-27 21:50:48,832 INFO L137 encePairwiseOnDemand]: 390/400 looper letters, 235 selfloop transitions, 8 changer transitions 36/281 dead transitions. [2023-01-27 21:50:48,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 281 transitions, 3288 flow [2023-01-27 21:50:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 21:50:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 21:50:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1117 transitions. [2023-01-27 21:50:48,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3490625 [2023-01-27 21:50:48,834 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1117 transitions. [2023-01-27 21:50:48,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1117 transitions. [2023-01-27 21:50:48,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:50:48,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1117 transitions. [2023-01-27 21:50:48,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.625) internal successors, (1117), 8 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:48,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:48,838 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:48,838 INFO L175 Difference]: Start difference. First operand has 140 places, 245 transitions, 2512 flow. Second operand 8 states and 1117 transitions. [2023-01-27 21:50:48,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 281 transitions, 3288 flow [2023-01-27 21:50:48,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 281 transitions, 2704 flow, removed 271 selfloop flow, removed 13 redundant places. [2023-01-27 21:50:48,920 INFO L231 Difference]: Finished difference. Result has 130 places, 239 transitions, 1886 flow [2023-01-27 21:50:48,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1886, PETRI_PLACES=130, PETRI_TRANSITIONS=239} [2023-01-27 21:50:48,921 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2023-01-27 21:50:48,921 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 239 transitions, 1886 flow [2023-01-27 21:50:48,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 133.2) internal successors, (1332), 10 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:50:48,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:50:48,921 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:50:48,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-27 21:50:49,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:50:49,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:50:49,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:50:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1215612886, now seen corresponding path program 7 times [2023-01-27 21:50:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:50:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794824092] [2023-01-27 21:50:49,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:50:49,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:50:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:50:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:50:50,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:50:50,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794824092] [2023-01-27 21:50:50,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794824092] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:50:50,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627355282] [2023-01-27 21:50:50,492 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 21:50:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:50:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:50:50,493 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:50:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 21:50:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:50:50,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 68 conjunts are in the unsatisfiable core [2023-01-27 21:50:50,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:50:50,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:50:50,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:50:50,630 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2023-01-27 21:50:50,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 32 [2023-01-27 21:50:50,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 21:50:50,774 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-27 21:50:50,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:50:50,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:50:50,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:50:50,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:50:51,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:50:51,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:50:51,195 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 21:50:51,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 40 [2023-01-27 21:50:51,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-01-27 21:50:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:50:51,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:50:51,483 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_440 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439))) (let ((.cse0 (select (select .cse1 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (or (= (+ c_~s~0 .cse0) (+ (* c_~t~0 2) 2 (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) 2))) (not (= .cse0 (+ (select (select .cse1 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) 1))))))) is different from false [2023-01-27 21:50:51,866 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:51,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 120 [2023-01-27 21:50:51,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:51,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12518 treesize of output 12126 [2023-01-27 21:50:52,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:52,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3044 treesize of output 2950 [2023-01-27 21:50:52,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2022 treesize of output 1830 [2023-01-27 21:50:52,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:52,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2678 treesize of output 2506 [2023-01-27 21:50:52,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:50:52,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2380 treesize of output 1940 [2023-01-27 21:51:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:29,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627355282] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:51:29,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:51:29,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-01-27 21:51:29,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269939740] [2023-01-27 21:51:29,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:51:29,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-27 21:51:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:51:29,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-27 21:51:29,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1012, Unknown=15, NotChecked=64, Total=1190 [2023-01-27 21:51:29,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 400 [2023-01-27 21:51:29,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 239 transitions, 1886 flow. Second operand has 35 states, 35 states have (on average 103.77142857142857) internal successors, (3632), 35 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:29,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:51:29,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 400 [2023-01-27 21:51:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:51:36,322 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_439 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_440 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_439))) (let ((.cse1 (select (select .cse2 c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) (or (= (+ c_~s~0 .cse1) (+ (* c_~t~0 2) 2 (* (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_440) c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_front~0 4))) 2))) (not (= .cse1 (+ (select (select .cse2 c_~q2~0.base) (+ ~q2~0.offset (* c_~q2_back~0 4))) 1))))))))) (and (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (not (= (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_back~0 4) c_~q1~0.offset)) 0)) .cse0) .cse0)) is different from false [2023-01-27 21:51:44,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:51:46,134 INFO L130 PetriNetUnfolder]: 2039/3363 cut-off events. [2023-01-27 21:51:46,134 INFO L131 PetriNetUnfolder]: For 23176/23178 co-relation queries the response was YES. [2023-01-27 21:51:46,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17642 conditions, 3363 events. 2039/3363 cut-off events. For 23176/23178 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18628 event pairs, 274 based on Foata normal form. 41/3094 useless extension candidates. Maximal degree in co-relation 17601. Up to 2568 conditions per place. [2023-01-27 21:51:46,153 INFO L137 encePairwiseOnDemand]: 380/400 looper letters, 283 selfloop transitions, 146 changer transitions 87/518 dead transitions. [2023-01-27 21:51:46,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 518 transitions, 5199 flow [2023-01-27 21:51:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-27 21:51:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-01-27 21:51:46,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4882 transitions. [2023-01-27 21:51:46,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2712222222222222 [2023-01-27 21:51:46,157 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 4882 transitions. [2023-01-27 21:51:46,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 4882 transitions. [2023-01-27 21:51:46,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:51:46,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4882 transitions. [2023-01-27 21:51:46,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 108.4888888888889) internal successors, (4882), 45 states have internal predecessors, (4882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:46,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 400.0) internal successors, (18400), 46 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:46,175 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 400.0) internal successors, (18400), 46 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:46,175 INFO L175 Difference]: Start difference. First operand has 130 places, 239 transitions, 1886 flow. Second operand 45 states and 4882 transitions. [2023-01-27 21:51:46,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 518 transitions, 5199 flow [2023-01-27 21:51:46,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 518 transitions, 5005 flow, removed 78 selfloop flow, removed 7 redundant places. [2023-01-27 21:51:46,246 INFO L231 Difference]: Finished difference. Result has 185 places, 341 transitions, 3398 flow [2023-01-27 21:51:46,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=3398, PETRI_PLACES=185, PETRI_TRANSITIONS=341} [2023-01-27 21:51:46,247 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 153 predicate places. [2023-01-27 21:51:46,247 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 341 transitions, 3398 flow [2023-01-27 21:51:46,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 103.77142857142857) internal successors, (3632), 35 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:46,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:51:46,248 INFO L208 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] [2023-01-27 21:51:46,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 21:51:46,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:51:46,455 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:51:46,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:51:46,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1668641668, now seen corresponding path program 1 times [2023-01-27 21:51:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:51:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493809106] [2023-01-27 21:51:46,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:51:46,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:51:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:51:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:51:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493809106] [2023-01-27 21:51:46,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493809106] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:51:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673679700] [2023-01-27 21:51:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:51:46,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:51:46,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:51:46,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:51:46,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 21:51:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:51:46,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 21:51:46,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:51:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:46,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:51:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673679700] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:51:46,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:51:46,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-27 21:51:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269533302] [2023-01-27 21:51:46,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:51:46,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 21:51:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:51:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 21:51:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-27 21:51:46,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 400 [2023-01-27 21:51:46,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 341 transitions, 3398 flow. Second operand has 12 states, 12 states have (on average 152.66666666666666) internal successors, (1832), 12 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:46,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:51:46,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 400 [2023-01-27 21:51:46,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:51:47,181 INFO L130 PetriNetUnfolder]: 1051/1792 cut-off events. [2023-01-27 21:51:47,181 INFO L131 PetriNetUnfolder]: For 18207/18334 co-relation queries the response was YES. [2023-01-27 21:51:47,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10578 conditions, 1792 events. 1051/1792 cut-off events. For 18207/18334 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9026 event pairs, 254 based on Foata normal form. 212/1767 useless extension candidates. Maximal degree in co-relation 10517. Up to 1041 conditions per place. [2023-01-27 21:51:47,193 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 130 selfloop transitions, 6 changer transitions 70/209 dead transitions. [2023-01-27 21:51:47,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 209 transitions, 2455 flow [2023-01-27 21:51:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:51:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:51:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 949 transitions. [2023-01-27 21:51:47,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954166666666667 [2023-01-27 21:51:47,195 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 949 transitions. [2023-01-27 21:51:47,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 949 transitions. [2023-01-27 21:51:47,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:51:47,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 949 transitions. [2023-01-27 21:51:47,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,198 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,198 INFO L175 Difference]: Start difference. First operand has 185 places, 341 transitions, 3398 flow. Second operand 6 states and 949 transitions. [2023-01-27 21:51:47,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 209 transitions, 2455 flow [2023-01-27 21:51:47,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 209 transitions, 2059 flow, removed 170 selfloop flow, removed 25 redundant places. [2023-01-27 21:51:47,246 INFO L231 Difference]: Finished difference. Result has 133 places, 116 transitions, 984 flow [2023-01-27 21:51:47,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=984, PETRI_PLACES=133, PETRI_TRANSITIONS=116} [2023-01-27 21:51:47,246 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2023-01-27 21:51:47,246 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 116 transitions, 984 flow [2023-01-27 21:51:47,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 152.66666666666666) internal successors, (1832), 12 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:51:47,247 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:51:47,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 21:51:47,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:51:47,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:51:47,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:51:47,452 INFO L85 PathProgramCache]: Analyzing trace with hash 319404908, now seen corresponding path program 1 times [2023-01-27 21:51:47,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:51:47,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410395420] [2023-01-27 21:51:47,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:51:47,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:51:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:51:47,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:51:47,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:51:47,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410395420] [2023-01-27 21:51:47,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410395420] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:51:47,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:51:47,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:51:47,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43015240] [2023-01-27 21:51:47,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:51:47,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:51:47,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:51:47,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:51:47,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:51:47,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 400 [2023-01-27 21:51:47,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 116 transitions, 984 flow. Second operand has 4 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:51:47,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 400 [2023-01-27 21:51:47,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:51:47,794 INFO L130 PetriNetUnfolder]: 1397/2286 cut-off events. [2023-01-27 21:51:47,795 INFO L131 PetriNetUnfolder]: For 9417/9464 co-relation queries the response was YES. [2023-01-27 21:51:47,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11592 conditions, 2286 events. 1397/2286 cut-off events. For 9417/9464 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11284 event pairs, 163 based on Foata normal form. 88/1944 useless extension candidates. Maximal degree in co-relation 11547. Up to 894 conditions per place. [2023-01-27 21:51:47,811 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 130 selfloop transitions, 24 changer transitions 9/166 dead transitions. [2023-01-27 21:51:47,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 166 transitions, 1700 flow [2023-01-27 21:51:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:51:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:51:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 744 transitions. [2023-01-27 21:51:47,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465 [2023-01-27 21:51:47,812 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 744 transitions. [2023-01-27 21:51:47,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 744 transitions. [2023-01-27 21:51:47,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:51:47,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 744 transitions. [2023-01-27 21:51:47,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,814 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,815 INFO L175 Difference]: Start difference. First operand has 133 places, 116 transitions, 984 flow. Second operand 4 states and 744 transitions. [2023-01-27 21:51:47,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 166 transitions, 1700 flow [2023-01-27 21:51:47,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 166 transitions, 1570 flow, removed 57 selfloop flow, removed 15 redundant places. [2023-01-27 21:51:47,840 INFO L231 Difference]: Finished difference. Result has 107 places, 119 transitions, 1052 flow [2023-01-27 21:51:47,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1052, PETRI_PLACES=107, PETRI_TRANSITIONS=119} [2023-01-27 21:51:47,841 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 75 predicate places. [2023-01-27 21:51:47,841 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 119 transitions, 1052 flow [2023-01-27 21:51:47,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 177.5) internal successors, (710), 4 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:47,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:51:47,841 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:51:47,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-27 21:51:47,841 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:51:47,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:51:47,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1130956623, now seen corresponding path program 8 times [2023-01-27 21:51:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:51:47,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540402737] [2023-01-27 21:51:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:51:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:51:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:51:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:51:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:51:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540402737] [2023-01-27 21:51:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540402737] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:51:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141304901] [2023-01-27 21:51:49,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:51:49,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:51:49,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:51:49,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:51:49,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 21:51:49,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-27 21:51:49,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:51:49,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 37 conjunts are in the unsatisfiable core [2023-01-27 21:51:49,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:51:50,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:51:50,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:51:50,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:51:50,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:51:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 21:51:50,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 21:51:50,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141304901] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:51:50,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 21:51:50,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 20 [2023-01-27 21:51:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577997615] [2023-01-27 21:51:50,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:51:50,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-27 21:51:50,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:51:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-27 21:51:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2023-01-27 21:51:50,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 400 [2023-01-27 21:51:50,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 119 transitions, 1052 flow. Second operand has 10 states, 10 states have (on average 135.2) internal successors, (1352), 10 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:50,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:51:50,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 400 [2023-01-27 21:51:50,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:51:50,681 INFO L130 PetriNetUnfolder]: 1222/2019 cut-off events. [2023-01-27 21:51:50,681 INFO L131 PetriNetUnfolder]: For 9073/9073 co-relation queries the response was YES. [2023-01-27 21:51:50,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10705 conditions, 2019 events. 1222/2019 cut-off events. For 9073/9073 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 9571 event pairs, 131 based on Foata normal form. 21/1671 useless extension candidates. Maximal degree in co-relation 10669. Up to 1675 conditions per place. [2023-01-27 21:51:50,691 INFO L137 encePairwiseOnDemand]: 389/400 looper letters, 92 selfloop transitions, 12 changer transitions 46/152 dead transitions. [2023-01-27 21:51:50,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 152 transitions, 1579 flow [2023-01-27 21:51:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 21:51:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 21:51:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1129 transitions. [2023-01-27 21:51:50,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3528125 [2023-01-27 21:51:50,701 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1129 transitions. [2023-01-27 21:51:50,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1129 transitions. [2023-01-27 21:51:50,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:51:50,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1129 transitions. [2023-01-27 21:51:50,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 141.125) internal successors, (1129), 8 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:50,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:50,705 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:50,705 INFO L175 Difference]: Start difference. First operand has 107 places, 119 transitions, 1052 flow. Second operand 8 states and 1129 transitions. [2023-01-27 21:51:50,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 152 transitions, 1579 flow [2023-01-27 21:51:50,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 152 transitions, 1535 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-01-27 21:51:50,719 INFO L231 Difference]: Finished difference. Result has 110 places, 98 transitions, 830 flow [2023-01-27 21:51:50,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=830, PETRI_PLACES=110, PETRI_TRANSITIONS=98} [2023-01-27 21:51:50,719 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 78 predicate places. [2023-01-27 21:51:50,719 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 830 flow [2023-01-27 21:51:50,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.2) internal successors, (1352), 10 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:50,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:51:50,719 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:51:50,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 21:51:50,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-27 21:51:50,925 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:51:50,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:51:50,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1047166389, now seen corresponding path program 2 times [2023-01-27 21:51:50,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:51:50,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867418645] [2023-01-27 21:51:50,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:51:50,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:51:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:51:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:51:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867418645] [2023-01-27 21:51:51,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867418645] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:51:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617645913] [2023-01-27 21:51:51,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:51:51,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:51:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:51:51,241 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:51:51,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 21:51:51,447 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:51:51,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:51:51,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-27 21:51:51,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:51:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:51,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:51:51,666 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-01-27 21:51:51,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2023-01-27 21:51:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617645913] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:51:51,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:51:51,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-01-27 21:51:51,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193650420] [2023-01-27 21:51:51,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:51:51,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 21:51:51,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:51:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 21:51:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-01-27 21:51:51,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 400 [2023-01-27 21:51:51,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 98 transitions, 830 flow. Second operand has 23 states, 23 states have (on average 131.2608695652174) internal successors, (3019), 23 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:51,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:51:51,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 400 [2023-01-27 21:51:51,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:51:53,657 INFO L130 PetriNetUnfolder]: 7397/10808 cut-off events. [2023-01-27 21:51:53,657 INFO L131 PetriNetUnfolder]: For 48451/48451 co-relation queries the response was YES. [2023-01-27 21:51:53,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57439 conditions, 10808 events. 7397/10808 cut-off events. For 48451/48451 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58851 event pairs, 280 based on Foata normal form. 733/8972 useless extension candidates. Maximal degree in co-relation 57400. Up to 3437 conditions per place. [2023-01-27 21:51:53,717 INFO L137 encePairwiseOnDemand]: 390/400 looper letters, 500 selfloop transitions, 197 changer transitions 12/711 dead transitions. [2023-01-27 21:51:53,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 711 transitions, 7689 flow [2023-01-27 21:51:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-27 21:51:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-27 21:51:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3760 transitions. [2023-01-27 21:51:53,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34814814814814815 [2023-01-27 21:51:53,720 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3760 transitions. [2023-01-27 21:51:53,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3760 transitions. [2023-01-27 21:51:53,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:51:53,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3760 transitions. [2023-01-27 21:51:53,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 139.25925925925927) internal successors, (3760), 27 states have internal predecessors, (3760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:53,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 400.0) internal successors, (11200), 28 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:53,729 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 400.0) internal successors, (11200), 28 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:53,729 INFO L175 Difference]: Start difference. First operand has 110 places, 98 transitions, 830 flow. Second operand 27 states and 3760 transitions. [2023-01-27 21:51:53,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 711 transitions, 7689 flow [2023-01-27 21:51:53,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 711 transitions, 7197 flow, removed 219 selfloop flow, removed 15 redundant places. [2023-01-27 21:51:53,848 INFO L231 Difference]: Finished difference. Result has 124 places, 313 transitions, 3572 flow [2023-01-27 21:51:53,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3572, PETRI_PLACES=124, PETRI_TRANSITIONS=313} [2023-01-27 21:51:53,848 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2023-01-27 21:51:53,849 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 313 transitions, 3572 flow [2023-01-27 21:51:53,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 131.2608695652174) internal successors, (3019), 23 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:53,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:51:53,849 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:51:53,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-27 21:51:54,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-27 21:51:54,054 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:51:54,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:51:54,055 INFO L85 PathProgramCache]: Analyzing trace with hash -849512615, now seen corresponding path program 3 times [2023-01-27 21:51:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:51:54,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260663056] [2023-01-27 21:51:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:51:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:51:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:51:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:51:54,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:51:54,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260663056] [2023-01-27 21:51:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260663056] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:51:54,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173240586] [2023-01-27 21:51:54,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:51:54,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:51:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:51:54,613 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:51:54,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 21:51:54,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 21:51:54,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:51:54,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjunts are in the unsatisfiable core [2023-01-27 21:51:54,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:51:54,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:51:54,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:51:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 21:51:54,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:51:54,898 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_695 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_695) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) is different from false [2023-01-27 21:51:54,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:51:54,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-01-27 21:51:54,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-01-27 21:51:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:51:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173240586] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:51:54,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:51:54,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2023-01-27 21:51:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757831901] [2023-01-27 21:51:54,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:51:54,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 21:51:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:51:54,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 21:51:54,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=298, Unknown=1, NotChecked=34, Total=380 [2023-01-27 21:51:54,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 400 [2023-01-27 21:51:54,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 313 transitions, 3572 flow. Second operand has 20 states, 20 states have (on average 127.8) internal successors, (2556), 20 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:54,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:51:54,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 400 [2023-01-27 21:51:54,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:51:58,601 INFO L130 PetriNetUnfolder]: 12026/17709 cut-off events. [2023-01-27 21:51:58,602 INFO L131 PetriNetUnfolder]: For 214474/214474 co-relation queries the response was YES. [2023-01-27 21:51:58,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119579 conditions, 17709 events. 12026/17709 cut-off events. For 214474/214474 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 106569 event pairs, 483 based on Foata normal form. 386/15748 useless extension candidates. Maximal degree in co-relation 119533. Up to 5676 conditions per place. [2023-01-27 21:51:58,727 INFO L137 encePairwiseOnDemand]: 389/400 looper letters, 443 selfloop transitions, 348 changer transitions 6/799 dead transitions. [2023-01-27 21:51:58,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 799 transitions, 10768 flow [2023-01-27 21:51:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-27 21:51:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-27 21:51:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2945 transitions. [2023-01-27 21:51:58,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3346590909090909 [2023-01-27 21:51:58,730 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2945 transitions. [2023-01-27 21:51:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2945 transitions. [2023-01-27 21:51:58,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:51:58,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2945 transitions. [2023-01-27 21:51:58,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 133.86363636363637) internal successors, (2945), 22 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:58,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 400.0) internal successors, (9200), 23 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:58,736 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 400.0) internal successors, (9200), 23 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:58,736 INFO L175 Difference]: Start difference. First operand has 124 places, 313 transitions, 3572 flow. Second operand 22 states and 2945 transitions. [2023-01-27 21:51:58,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 799 transitions, 10768 flow [2023-01-27 21:51:59,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 799 transitions, 10019 flow, removed 370 selfloop flow, removed 5 redundant places. [2023-01-27 21:51:59,843 INFO L231 Difference]: Finished difference. Result has 154 places, 516 transitions, 7072 flow [2023-01-27 21:51:59,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=3175, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7072, PETRI_PLACES=154, PETRI_TRANSITIONS=516} [2023-01-27 21:51:59,844 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 122 predicate places. [2023-01-27 21:51:59,844 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 516 transitions, 7072 flow [2023-01-27 21:51:59,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 127.8) internal successors, (2556), 20 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:51:59,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:51:59,844 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:51:59,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 21:52:00,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-27 21:52:00,048 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:52:00,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:52:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1449519811, now seen corresponding path program 9 times [2023-01-27 21:52:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:52:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137242639] [2023-01-27 21:52:00,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:52:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:52:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:52:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:52:01,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:52:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137242639] [2023-01-27 21:52:01,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137242639] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:52:01,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469034548] [2023-01-27 21:52:01,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:52:01,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:52:01,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:52:01,772 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:52:01,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 21:52:01,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-01-27 21:52:01,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:52:01,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 40 conjunts are in the unsatisfiable core [2023-01-27 21:52:01,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:52:02,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:52:02,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:52:02,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:52:02,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:52:02,390 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-27 21:52:02,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 36 [2023-01-27 21:52:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-01-27 21:52:02,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-27 21:52:02,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469034548] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:52:02,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-27 21:52:02,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 22 [2023-01-27 21:52:02,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771145541] [2023-01-27 21:52:02,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:52:02,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 21:52:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:52:02,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 21:52:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2023-01-27 21:52:02,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 400 [2023-01-27 21:52:02,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 516 transitions, 7072 flow. Second operand has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:02,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:52:02,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 400 [2023-01-27 21:52:02,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:52:05,392 INFO L130 PetriNetUnfolder]: 11988/17594 cut-off events. [2023-01-27 21:52:05,392 INFO L131 PetriNetUnfolder]: For 304580/304580 co-relation queries the response was YES. [2023-01-27 21:52:05,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132682 conditions, 17594 events. 11988/17594 cut-off events. For 304580/304580 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 104874 event pairs, 1861 based on Foata normal form. 1/15633 useless extension candidates. Maximal degree in co-relation 132624. Up to 17367 conditions per place. [2023-01-27 21:52:05,535 INFO L137 encePairwiseOnDemand]: 392/400 looper letters, 504 selfloop transitions, 9 changer transitions 24/539 dead transitions. [2023-01-27 21:52:05,535 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 539 transitions, 8249 flow [2023-01-27 21:52:05,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 21:52:05,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 21:52:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 961 transitions. [2023-01-27 21:52:05,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3432142857142857 [2023-01-27 21:52:05,537 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 961 transitions. [2023-01-27 21:52:05,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 961 transitions. [2023-01-27 21:52:05,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:52:05,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 961 transitions. [2023-01-27 21:52:05,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.28571428571428) internal successors, (961), 7 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:05,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 400.0) internal successors, (3200), 8 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:05,553 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 400.0) internal successors, (3200), 8 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:05,553 INFO L175 Difference]: Start difference. First operand has 154 places, 516 transitions, 7072 flow. Second operand 7 states and 961 transitions. [2023-01-27 21:52:05,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 539 transitions, 8249 flow [2023-01-27 21:52:07,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 539 transitions, 7784 flow, removed 201 selfloop flow, removed 9 redundant places. [2023-01-27 21:52:07,188 INFO L231 Difference]: Finished difference. Result has 151 places, 511 transitions, 6582 flow [2023-01-27 21:52:07,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=6607, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6582, PETRI_PLACES=151, PETRI_TRANSITIONS=511} [2023-01-27 21:52:07,188 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 119 predicate places. [2023-01-27 21:52:07,188 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 511 transitions, 6582 flow [2023-01-27 21:52:07,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:07,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:52:07,189 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:52:07,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 21:52:07,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-27 21:52:07,406 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:52:07,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:52:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1025777803, now seen corresponding path program 4 times [2023-01-27 21:52:07,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:52:07,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829472597] [2023-01-27 21:52:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:52:07,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:52:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:52:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:52:07,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:52:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829472597] [2023-01-27 21:52:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829472597] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:52:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364344539] [2023-01-27 21:52:07,871 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 21:52:07,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:52:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:52:07,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:52:07,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 21:52:07,992 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 21:52:07,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:52:07,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-27 21:52:07,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:52:08,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:52:08,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:52:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:52:08,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:52:08,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_822 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_822) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) is different from false [2023-01-27 21:52:08,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:52:08,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-01-27 21:52:08,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-01-27 21:52:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:52:08,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364344539] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:52:08,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:52:08,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-01-27 21:52:08,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20145574] [2023-01-27 21:52:08,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:52:08,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-27 21:52:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:52:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-27 21:52:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=559, Unknown=1, NotChecked=48, Total=702 [2023-01-27 21:52:08,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 400 [2023-01-27 21:52:08,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 511 transitions, 6582 flow. Second operand has 27 states, 27 states have (on average 119.25925925925925) internal successors, (3220), 27 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:08,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:52:08,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 400 [2023-01-27 21:52:08,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:52:15,619 INFO L130 PetriNetUnfolder]: 22867/33800 cut-off events. [2023-01-27 21:52:15,619 INFO L131 PetriNetUnfolder]: For 545806/545806 co-relation queries the response was YES. [2023-01-27 21:52:15,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243641 conditions, 33800 events. 22867/33800 cut-off events. For 545806/545806 co-relation queries the response was YES. Maximal size of possible extension queue 1612. Compared 227435 event pairs, 1643 based on Foata normal form. 307/30579 useless extension candidates. Maximal degree in co-relation 243584. Up to 10730 conditions per place. [2023-01-27 21:52:16,113 INFO L137 encePairwiseOnDemand]: 383/400 looper letters, 889 selfloop transitions, 738 changer transitions 2/1630 dead transitions. [2023-01-27 21:52:16,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 1630 transitions, 24467 flow [2023-01-27 21:52:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-27 21:52:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-27 21:52:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 3425 transitions. [2023-01-27 21:52:16,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31712962962962965 [2023-01-27 21:52:16,133 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 3425 transitions. [2023-01-27 21:52:16,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 3425 transitions. [2023-01-27 21:52:16,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:52:16,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 3425 transitions. [2023-01-27 21:52:16,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 126.85185185185185) internal successors, (3425), 27 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:16,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 400.0) internal successors, (11200), 28 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:16,159 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 400.0) internal successors, (11200), 28 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:16,159 INFO L175 Difference]: Start difference. First operand has 151 places, 511 transitions, 6582 flow. Second operand 27 states and 3425 transitions. [2023-01-27 21:52:16,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 1630 transitions, 24467 flow [2023-01-27 21:52:18,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 1630 transitions, 24123 flow, removed 162 selfloop flow, removed 7 redundant places. [2023-01-27 21:52:18,614 INFO L231 Difference]: Finished difference. Result has 180 places, 1083 transitions, 18258 flow [2023-01-27 21:52:18,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=6488, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=18258, PETRI_PLACES=180, PETRI_TRANSITIONS=1083} [2023-01-27 21:52:18,614 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 148 predicate places. [2023-01-27 21:52:18,614 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 1083 transitions, 18258 flow [2023-01-27 21:52:18,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 119.25925925925925) internal successors, (3220), 27 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:18,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:52:18,615 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:52:18,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-01-27 21:52:18,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-27 21:52:18,822 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:52:18,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:52:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2094903761, now seen corresponding path program 5 times [2023-01-27 21:52:18,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:52:18,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920650709] [2023-01-27 21:52:18,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:52:18,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:52:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:52:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:52:19,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:52:19,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920650709] [2023-01-27 21:52:19,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920650709] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:52:19,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284463535] [2023-01-27 21:52:19,675 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 21:52:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:52:19,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:52:19,685 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:52:19,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 21:52:19,807 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:52:19,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:52:19,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-27 21:52:19,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:52:20,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:52:20,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:52:20,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:52:20,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:52:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:52:20,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:52:20,215 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_883 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_884) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) is different from false [2023-01-27 21:52:20,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:52:20,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 72 [2023-01-27 21:52:20,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-01-27 21:52:20,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-01-27 21:52:20,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:52:20,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284463535] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:52:20,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:52:20,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2023-01-27 21:52:20,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282011845] [2023-01-27 21:52:20,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:52:20,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-27 21:52:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:52:20,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-27 21:52:20,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=859, Unknown=3, NotChecked=60, Total=1056 [2023-01-27 21:52:20,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 400 [2023-01-27 21:52:20,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 1083 transitions, 18258 flow. Second operand has 33 states, 33 states have (on average 109.96969696969697) internal successors, (3629), 33 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:20,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:52:20,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 400 [2023-01-27 21:52:20,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:52:23,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:25,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:52:37,053 INFO L130 PetriNetUnfolder]: 28353/41999 cut-off events. [2023-01-27 21:52:37,054 INFO L131 PetriNetUnfolder]: For 916700/916700 co-relation queries the response was YES. [2023-01-27 21:52:37,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361859 conditions, 41999 events. 28353/41999 cut-off events. For 916700/916700 co-relation queries the response was YES. Maximal size of possible extension queue 1998. Compared 291496 event pairs, 1618 based on Foata normal form. 195/37923 useless extension candidates. Maximal degree in co-relation 361790. Up to 13461 conditions per place. [2023-01-27 21:52:37,607 INFO L137 encePairwiseOnDemand]: 383/400 looper letters, 1148 selfloop transitions, 1369 changer transitions 3/2521 dead transitions. [2023-01-27 21:52:37,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 2521 transitions, 46642 flow [2023-01-27 21:52:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-27 21:52:37,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-27 21:52:37,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4415 transitions. [2023-01-27 21:52:37,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29046052631578945 [2023-01-27 21:52:37,611 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4415 transitions. [2023-01-27 21:52:37,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4415 transitions. [2023-01-27 21:52:37,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:52:37,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4415 transitions. [2023-01-27 21:52:37,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 116.1842105263158) internal successors, (4415), 38 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:37,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 400.0) internal successors, (15600), 39 states have internal predecessors, (15600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:37,622 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 400.0) internal successors, (15600), 39 states have internal predecessors, (15600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:37,622 INFO L175 Difference]: Start difference. First operand has 180 places, 1083 transitions, 18258 flow. Second operand 38 states and 4415 transitions. [2023-01-27 21:52:37,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 2521 transitions, 46642 flow [2023-01-27 21:52:47,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2521 transitions, 45052 flow, removed 789 selfloop flow, removed 4 redundant places. [2023-01-27 21:52:47,134 INFO L231 Difference]: Finished difference. Result has 235 places, 1790 transitions, 35575 flow [2023-01-27 21:52:47,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=17282, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1082, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=678, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=35575, PETRI_PLACES=235, PETRI_TRANSITIONS=1790} [2023-01-27 21:52:47,135 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 203 predicate places. [2023-01-27 21:52:47,135 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 1790 transitions, 35575 flow [2023-01-27 21:52:47,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 109.96969696969697) internal successors, (3629), 33 states have internal predecessors, (3629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:47,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:52:47,135 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:52:47,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-27 21:52:47,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-27 21:52:47,340 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:52:47,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:52:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash 578336049, now seen corresponding path program 1 times [2023-01-27 21:52:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:52:47,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948882219] [2023-01-27 21:52:47,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:52:47,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:52:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:52:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:52:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:52:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948882219] [2023-01-27 21:52:47,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948882219] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:52:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42895864] [2023-01-27 21:52:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:52:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:52:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:52:47,424 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:52:47,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-27 21:52:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:52:47,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 21:52:47,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:52:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:52:47,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:52:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:52:47,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42895864] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:52:47,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:52:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-27 21:52:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605215493] [2023-01-27 21:52:47,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:52:47,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 21:52:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:52:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 21:52:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-27 21:52:47,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 400 [2023-01-27 21:52:47,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 1790 transitions, 35575 flow. Second operand has 12 states, 12 states have (on average 152.0) internal successors, (1824), 12 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:52:47,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:52:47,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 400 [2023-01-27 21:52:47,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:53:06,715 INFO L130 PetriNetUnfolder]: 36054/54194 cut-off events. [2023-01-27 21:53:06,715 INFO L131 PetriNetUnfolder]: For 1423921/1424208 co-relation queries the response was YES. [2023-01-27 21:53:07,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500156 conditions, 54194 events. 36054/54194 cut-off events. For 1423921/1424208 co-relation queries the response was YES. Maximal size of possible extension queue 2773. Compared 403884 event pairs, 6806 based on Foata normal form. 2034/50507 useless extension candidates. Maximal degree in co-relation 500065. Up to 38973 conditions per place. [2023-01-27 21:53:07,721 INFO L137 encePairwiseOnDemand]: 393/400 looper letters, 1695 selfloop transitions, 15 changer transitions 1066/2785 dead transitions. [2023-01-27 21:53:07,721 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 2785 transitions, 60704 flow [2023-01-27 21:53:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 21:53:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 21:53:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1399 transitions. [2023-01-27 21:53:07,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38861111111111113 [2023-01-27 21:53:07,723 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1399 transitions. [2023-01-27 21:53:07,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1399 transitions. [2023-01-27 21:53:07,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:53:07,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1399 transitions. [2023-01-27 21:53:07,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 155.44444444444446) internal successors, (1399), 9 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:07,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 400.0) internal successors, (4000), 10 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:07,743 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 400.0) internal successors, (4000), 10 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:07,743 INFO L175 Difference]: Start difference. First operand has 235 places, 1790 transitions, 35575 flow. Second operand 9 states and 1399 transitions. [2023-01-27 21:53:07,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 2785 transitions, 60704 flow [2023-01-27 21:53:32,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 2785 transitions, 58852 flow, removed 913 selfloop flow, removed 7 redundant places. [2023-01-27 21:53:32,590 INFO L231 Difference]: Finished difference. Result has 239 places, 1678 transitions, 32771 flow [2023-01-27 21:53:32,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=34468, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1790, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1775, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=32771, PETRI_PLACES=239, PETRI_TRANSITIONS=1678} [2023-01-27 21:53:32,591 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2023-01-27 21:53:32,591 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 1678 transitions, 32771 flow [2023-01-27 21:53:32,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 152.0) internal successors, (1824), 12 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:32,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:53:32,592 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:53:32,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-27 21:53:32,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:53:32,800 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:53:32,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:53:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1671122384, now seen corresponding path program 6 times [2023-01-27 21:53:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:53:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399748815] [2023-01-27 21:53:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:53:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:53:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:53:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:53:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:53:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399748815] [2023-01-27 21:53:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399748815] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:53:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510163985] [2023-01-27 21:53:34,167 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 21:53:34,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:53:34,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:53:34,168 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:53:34,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-27 21:53:34,457 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 21:53:34,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:53:34,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 19 conjunts are in the unsatisfiable core [2023-01-27 21:53:34,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:53:34,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:53:34,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:53:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 21:53:34,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:53:34,645 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1005 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1005) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) is different from false [2023-01-27 21:53:34,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:53:34,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2023-01-27 21:53:34,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-01-27 21:53:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-27 21:53:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510163985] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:53:34,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:53:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 23 [2023-01-27 21:53:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684451387] [2023-01-27 21:53:34,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:53:34,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-27 21:53:34,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:53:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-27 21:53:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=447, Unknown=1, NotChecked=42, Total=552 [2023-01-27 21:53:34,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 400 [2023-01-27 21:53:34,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 1678 transitions, 32771 flow. Second operand has 24 states, 24 states have (on average 124.54166666666667) internal successors, (2989), 24 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:34,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:53:34,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 400 [2023-01-27 21:53:34,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:53:50,389 INFO L130 PetriNetUnfolder]: 29402/43454 cut-off events. [2023-01-27 21:53:50,389 INFO L131 PetriNetUnfolder]: For 1026765/1026769 co-relation queries the response was YES. [2023-01-27 21:53:50,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394268 conditions, 43454 events. 29402/43454 cut-off events. For 1026765/1026769 co-relation queries the response was YES. Maximal size of possible extension queue 2127. Compared 302645 event pairs, 2184 based on Foata normal form. 24/38889 useless extension candidates. Maximal degree in co-relation 394173. Up to 19638 conditions per place. [2023-01-27 21:53:51,306 INFO L137 encePairwiseOnDemand]: 389/400 looper letters, 1023 selfloop transitions, 1098 changer transitions 0/2124 dead transitions. [2023-01-27 21:53:51,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2124 transitions, 44693 flow [2023-01-27 21:53:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-27 21:53:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-27 21:53:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2177 transitions. [2023-01-27 21:53:51,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3201470588235294 [2023-01-27 21:53:51,308 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2177 transitions. [2023-01-27 21:53:51,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2177 transitions. [2023-01-27 21:53:51,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:53:51,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2177 transitions. [2023-01-27 21:53:51,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 128.05882352941177) internal successors, (2177), 17 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:51,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 400.0) internal successors, (7200), 18 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:51,313 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 400.0) internal successors, (7200), 18 states have internal predecessors, (7200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:53:51,313 INFO L175 Difference]: Start difference. First operand has 239 places, 1678 transitions, 32771 flow. Second operand 17 states and 2177 transitions. [2023-01-27 21:53:51,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2124 transitions, 44693 flow [2023-01-27 21:54:03,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 2124 transitions, 44100 flow, removed 278 selfloop flow, removed 10 redundant places. [2023-01-27 21:54:03,656 INFO L231 Difference]: Finished difference. Result has 248 places, 1835 transitions, 38983 flow [2023-01-27 21:54:03,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=32200, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=941, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=38983, PETRI_PLACES=248, PETRI_TRANSITIONS=1835} [2023-01-27 21:54:03,657 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 216 predicate places. [2023-01-27 21:54:03,657 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 1835 transitions, 38983 flow [2023-01-27 21:54:03,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 124.54166666666667) internal successors, (2989), 24 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:54:03,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:54:03,658 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:54:03,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-27 21:54:03,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:54:03,862 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:54:03,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:54:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash 768147710, now seen corresponding path program 7 times [2023-01-27 21:54:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:54:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724636364] [2023-01-27 21:54:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:54:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:54:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:54:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:54:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:54:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724636364] [2023-01-27 21:54:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724636364] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:54:04,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371504966] [2023-01-27 21:54:04,436 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 21:54:04,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:54:04,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:54:04,437 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:54:04,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-27 21:54:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:54:04,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-27 21:54:04,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:54:04,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:54:04,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:54:04,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:54:04,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 21:54:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-27 21:54:04,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:54:04,818 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1071) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) is different from false [2023-01-27 21:54:04,828 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (v_ArrVal_1070 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1070) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1071) c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)))) is different from false [2023-01-27 21:54:04,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:54:04,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 72 [2023-01-27 21:54:04,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2023-01-27 21:54:04,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-01-27 21:54:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2023-01-27 21:54:04,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371504966] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:54:04,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:54:04,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 28 [2023-01-27 21:54:04,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217019224] [2023-01-27 21:54:04,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:54:04,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-27 21:54:04,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:54:04,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-27 21:54:04,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=610, Unknown=2, NotChecked=102, Total=812 [2023-01-27 21:54:04,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 400 [2023-01-27 21:54:04,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 1835 transitions, 38983 flow. Second operand has 29 states, 29 states have (on average 116.13793103448276) internal successors, (3368), 29 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:54:04,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:54:04,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 400 [2023-01-27 21:54:04,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:54:21,737 INFO L130 PetriNetUnfolder]: 29526/43666 cut-off events. [2023-01-27 21:54:21,737 INFO L131 PetriNetUnfolder]: For 1127257/1127257 co-relation queries the response was YES. [2023-01-27 21:54:22,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408799 conditions, 43666 events. 29526/43666 cut-off events. For 1127257/1127257 co-relation queries the response was YES. Maximal size of possible extension queue 2117. Compared 304775 event pairs, 1383 based on Foata normal form. 16/39119 useless extension candidates. Maximal degree in co-relation 408702. Up to 14490 conditions per place. [2023-01-27 21:54:22,474 INFO L137 encePairwiseOnDemand]: 391/400 looper letters, 783 selfloop transitions, 1492 changer transitions 1/2277 dead transitions. [2023-01-27 21:54:22,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 2277 transitions, 50898 flow [2023-01-27 21:54:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-27 21:54:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-27 21:54:22,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2171 transitions. [2023-01-27 21:54:22,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3015277777777778 [2023-01-27 21:54:22,477 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2171 transitions. [2023-01-27 21:54:22,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2171 transitions. [2023-01-27 21:54:22,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:54:22,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2171 transitions. [2023-01-27 21:54:22,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 120.61111111111111) internal successors, (2171), 18 states have internal predecessors, (2171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:54:22,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 400.0) internal successors, (7600), 19 states have internal predecessors, (7600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:54:22,483 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 400.0) internal successors, (7600), 19 states have internal predecessors, (7600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:54:22,483 INFO L175 Difference]: Start difference. First operand has 248 places, 1835 transitions, 38983 flow. Second operand 18 states and 2171 transitions. [2023-01-27 21:54:22,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 2277 transitions, 50898 flow [2023-01-27 21:54:36,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 2277 transitions, 48891 flow, removed 35 selfloop flow, removed 15 redundant places. [2023-01-27 21:54:36,748 INFO L231 Difference]: Finished difference. Result has 249 places, 1980 transitions, 43296 flow [2023-01-27 21:54:36,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=36980, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1344, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=489, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=43296, PETRI_PLACES=249, PETRI_TRANSITIONS=1980} [2023-01-27 21:54:36,750 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 217 predicate places. [2023-01-27 21:54:36,750 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 1980 transitions, 43296 flow [2023-01-27 21:54:36,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 116.13793103448276) internal successors, (3368), 29 states have internal predecessors, (3368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:54:36,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:54:36,753 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:54:36,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-01-27 21:54:36,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:54:36,958 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-27 21:54:36,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:54:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2145049073, now seen corresponding path program 2 times [2023-01-27 21:54:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:54:36,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452486933] [2023-01-27 21:54:36,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:54:36,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:54:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:54:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:54:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:54:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452486933] [2023-01-27 21:54:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452486933] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:54:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465890437] [2023-01-27 21:54:37,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:54:37,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:54:37,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:54:37,803 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:54:37,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-27 21:54:37,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:54:37,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:54:37,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-27 21:54:37,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:54:37,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:54:37,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:54:37,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:54:37,986 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-01-27 21:54:37,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-01-27 21:54:38,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-01-27 21:54:38,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 21:54:38,138 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 21:54:38,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 21:54:38,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:54:38,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:54:38,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:54:38,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:54:38,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:54:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:54:38,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:54:39,445 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:54:39,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 118 [2023-01-27 21:54:39,547 INFO L321 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-01-27 21:54:39,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3594737 treesize of output 3463177 [2023-01-27 21:54:41,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:54:41,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7160 treesize of output 6832 [2023-01-27 21:54:41,721 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:54:41,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6893 treesize of output 5341 [2023-01-27 21:54:41,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:54:41,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5261 treesize of output 4525 [2023-01-27 21:54:42,058 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:54:42,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4347 treesize of output 4223 Received shutdown request... [2023-01-27 21:56:05,587 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 21:56:05,587 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 [2023-01-27 21:56:05,591 WARN L238 SmtUtils]: Removed 1 from assertion stack [2023-01-27 21:56:05,593 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-27 21:56:05,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-01-27 21:56:05,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:56:05,799 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-19-4-3-3-4-2-2-2-3-2-2-2-2-2-2-2-1 context. [2023-01-27 21:56:05,801 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-27 21:56:05,801 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-27 21:56:05,801 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-27 21:56:05,801 INFO L445 BasicCegarLoop]: Path program histogram: [9, 7, 2, 1, 1, 1, 1] [2023-01-27 21:56:05,804 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 21:56:05,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 21:56:05,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 09:56:05 BasicIcfg [2023-01-27 21:56:05,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 21:56:05,807 INFO L158 Benchmark]: Toolchain (without parser) took 847895.03ms. Allocated memory was 620.8MB in the beginning and 10.2GB in the end (delta: 9.6GB). Free memory was 580.9MB in the beginning and 2.6GB in the end (delta: -2.0GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-01-27 21:56:05,807 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 411.0MB. Free memory was 360.7MB in the beginning and 360.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 21:56:05,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.66ms. Allocated memory is still 620.8MB. Free memory was 580.2MB in the beginning and 568.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 21:56:05,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.36ms. Allocated memory is still 620.8MB. Free memory was 568.0MB in the beginning and 565.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:56:05,808 INFO L158 Benchmark]: Boogie Preprocessor took 20.41ms. Allocated memory is still 620.8MB. Free memory was 565.8MB in the beginning and 563.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:56:05,809 INFO L158 Benchmark]: RCFGBuilder took 539.05ms. Allocated memory is still 620.8MB. Free memory was 563.8MB in the beginning and 529.0MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-01-27 21:56:05,809 INFO L158 Benchmark]: TraceAbstraction took 847116.97ms. Allocated memory was 620.8MB in the beginning and 10.2GB in the end (delta: 9.6GB). Free memory was 529.0MB in the beginning and 2.6GB in the end (delta: -2.1GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-01-27 21:56:05,811 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 411.0MB. Free memory was 360.7MB in the beginning and 360.5MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 187.66ms. Allocated memory is still 620.8MB. Free memory was 580.2MB in the beginning and 568.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.36ms. Allocated memory is still 620.8MB. Free memory was 568.0MB in the beginning and 565.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.41ms. Allocated memory is still 620.8MB. Free memory was 565.8MB in the beginning and 563.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 539.05ms. Allocated memory is still 620.8MB. Free memory was 563.8MB in the beginning and 529.0MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 847116.97ms. Allocated memory was 620.8MB in the beginning and 10.2GB in the end (delta: 9.6GB). Free memory was 529.0MB in the beginning and 2.6GB in the end (delta: -2.1GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 180 PlacesBefore, 32 PlacesAfterwards, 188 TransitionsBefore, 28 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 7 FixpointIterations, 122 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 12 ConcurrentYvCompositions, 12 ChoiceCompositions, 199 TotalNumberOfCompositions, 2169 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1643, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 838, independent: 818, independent conditional: 0, independent unconditional: 818, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1643, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 838, unknown conditional: 0, unknown unconditional: 838] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-19-4-3-3-4-2-2-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-19-4-3-3-4-2-2-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-19-4-3-3-4-2-2-2-3-2-2-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 30 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-19-4-3-3-4-2-2-2-3-2-2-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 214 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 847.0s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 644.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 352 mSolverCounterUnknown, 2995 SdHoareTripleChecker+Valid, 94.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2995 mSDsluCounter, 562 SdHoareTripleChecker+Invalid, 93.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2373 IncrementalHoareTripleChecker+Unchecked, 518 mSDsCounter, 593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14887 IncrementalHoareTripleChecker+Invalid, 18205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 593 mSolverCounterUnsat, 44 mSDtfsCounter, 14887 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1083 GetRequests, 495 SyntacticMatches, 23 SemanticMatches, 565 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 422.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43296occurred in iteration=21, InterpolantAutomatonStates: 348, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 101.8s InterpolantComputationTime, 944 NumberOfCodeBlocks, 928 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 1184 ConstructedInterpolants, 88 QuantifiedInterpolants, 33634 SizeOfPredicates, 241 NumberOfNonLiveVariables, 4944 ConjunctsInSsa, 574 ConjunctsInUnsatCore, 48 InterpolantComputations, 10 PerfectInterpolantSequences, 110/244 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown