/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:20:09,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:20:09,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:20:09,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:20:09,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:20:09,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:20:09,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:20:09,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:20:09,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:20:09,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:20:09,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:20:09,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:20:09,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:20:09,278 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:20:09,279 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:20:09,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:20:09,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:20:09,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:20:09,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:20:09,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:20:09,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:20:09,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:20:09,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:20:09,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:20:09,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:20:09,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:20:09,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:20:09,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:20:09,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:20:09,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:20:09,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:20:09,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:20:09,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:20:09,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:20:09,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:20:09,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:20:09,292 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:20:09,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:20:09,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:20:09,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:20:09,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:20:09,295 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 21:20:09,334 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:20:09,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:20:09,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:20:09,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:20:09,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:20:09,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:20:09,335 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:20:09,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:20:09,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:20:09,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:20:09,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:20:09,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:20:09,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:20:09,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:20:09,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:20:09,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:20:09,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:20:09,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:20:09,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:20:09,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:20:09,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:20:09,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:20:09,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:20:09,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:20:09,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:20:09,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:20:09,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:20:09,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:20:09,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:20:09,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:20:09,339 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:20:09,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:20:09,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:20:09,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:20:09,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:20:09,616 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:20:09,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-12 21:20:10,659 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:20:10,880 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:20:10,881 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2022-12-12 21:20:10,891 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493e0dec1/9f2c69e2d7b1489caba09c59aa03341d/FLAG3914ab69a [2022-12-12 21:20:10,904 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/493e0dec1/9f2c69e2d7b1489caba09c59aa03341d [2022-12-12 21:20:10,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:20:10,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:20:10,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:20:10,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:20:10,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:20:10,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:20:10" (1/1) ... [2022-12-12 21:20:10,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356141a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:10, skipping insertion in model container [2022-12-12 21:20:10,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:20:10" (1/1) ... [2022-12-12 21:20:10,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:20:10,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:20:11,247 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-12-12 21:20:11,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:20:11,289 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:20:11,314 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2022-12-12 21:20:11,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:20:11,364 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:20:11,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11 WrapperNode [2022-12-12 21:20:11,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:20:11,367 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:20:11,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:20:11,367 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:20:11,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,424 INFO L138 Inliner]: procedures = 277, calls = 38, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 148 [2022-12-12 21:20:11,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:20:11,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:20:11,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:20:11,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:20:11,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,455 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:20:11,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:20:11,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:20:11,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:20:11,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (1/1) ... [2022-12-12 21:20:11,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:20:11,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:20:11,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 21:20:11,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 21:20:11,533 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-12 21:20:11,533 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-12 21:20:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-12 21:20:11,534 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-12 21:20:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:20:11,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:20:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 21:20:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:20:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-12 21:20:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:20:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:20:11,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:20:11,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:20:11,539 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:20:11,640 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:20:11,656 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:20:11,864 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:20:11,870 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:20:11,870 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-12 21:20:11,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:20:11 BoogieIcfgContainer [2022-12-12 21:20:11,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:20:11,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:20:11,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:20:11,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:20:11,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:20:10" (1/3) ... [2022-12-12 21:20:11,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5145aaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:20:11, skipping insertion in model container [2022-12-12 21:20:11,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:20:11" (2/3) ... [2022-12-12 21:20:11,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5145aaf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:20:11, skipping insertion in model container [2022-12-12 21:20:11,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:20:11" (3/3) ... [2022-12-12 21:20:11,885 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2022-12-12 21:20:11,898 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:20:11,898 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:20:11,898 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:20:12,002 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 21:20:12,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 150 transitions, 316 flow [2022-12-12 21:20:12,093 INFO L130 PetriNetUnfolder]: 10/148 cut-off events. [2022-12-12 21:20:12,093 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 21:20:12,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 10/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 353 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-12 21:20:12,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 150 transitions, 316 flow [2022-12-12 21:20:12,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 139 transitions, 287 flow [2022-12-12 21:20:12,110 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:20:12,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-12 21:20:12,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 139 transitions, 287 flow [2022-12-12 21:20:12,189 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-12 21:20:12,189 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 21:20:12,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 139 events. 10/139 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 307 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 110. Up to 3 conditions per place. [2022-12-12 21:20:12,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 139 transitions, 287 flow [2022-12-12 21:20:12,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 6382 [2022-12-12 21:20:16,311 INFO L241 LiptonReduction]: Total number of compositions: 116 [2022-12-12 21:20:16,321 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:20:16,326 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;@2b49b0a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:20:16,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:20:16,347 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-12 21:20:16,347 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-12 21:20:16,347 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:16,348 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-12 21:20:16,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1688471119, now seen corresponding path program 1 times [2022-12-12 21:20:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:16,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951920002] [2022-12-12 21:20:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:16,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:16,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951920002] [2022-12-12 21:20:16,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951920002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:16,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:20:16,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:20:16,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559544652] [2022-12-12 21:20:16,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:16,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:20:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:16,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:20:16,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:20:16,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-12 21:20:16,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:16,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:16,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-12 21:20:16,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:17,718 INFO L130 PetriNetUnfolder]: 12108/20257 cut-off events. [2022-12-12 21:20:17,719 INFO L131 PetriNetUnfolder]: For 196/196 co-relation queries the response was YES. [2022-12-12 21:20:17,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39810 conditions, 20257 events. 12108/20257 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 148702 event pairs, 5729 based on Foata normal form. 0/6684 useless extension candidates. Maximal degree in co-relation 39251. Up to 12849 conditions per place. [2022-12-12 21:20:17,775 INFO L137 encePairwiseOnDemand]: 89/110 looper letters, 149 selfloop transitions, 8 changer transitions 2/171 dead transitions. [2022-12-12 21:20:17,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 171 transitions, 675 flow [2022-12-12 21:20:17,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:20:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:20:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2022-12-12 21:20:17,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2022-12-12 21:20:17,787 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2022-12-12 21:20:17,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 171 transitions, 675 flow [2022-12-12 21:20:17,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 169 transitions, 667 flow [2022-12-12 21:20:17,870 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 169 transitions, 667 flow [2022-12-12 21:20:17,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:17,870 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:17,871 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:17,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:20:17,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:17,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash 603354056, now seen corresponding path program 1 times [2022-12-12 21:20:17,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:17,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911284010] [2022-12-12 21:20:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:17,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:17,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911284010] [2022-12-12 21:20:17,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911284010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:17,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:20:17,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:20:17,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982848907] [2022-12-12 21:20:17,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:17,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:20:17,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:20:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:20:17,983 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 110 [2022-12-12 21:20:17,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 169 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:17,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:17,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 110 [2022-12-12 21:20:17,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:19,077 INFO L130 PetriNetUnfolder]: 13768/22494 cut-off events. [2022-12-12 21:20:19,077 INFO L131 PetriNetUnfolder]: For 680/724 co-relation queries the response was YES. [2022-12-12 21:20:19,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64522 conditions, 22494 events. 13768/22494 cut-off events. For 680/724 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 162562 event pairs, 5703 based on Foata normal form. 0/8135 useless extension candidates. Maximal degree in co-relation 63741. Up to 19242 conditions per place. [2022-12-12 21:20:19,122 INFO L137 encePairwiseOnDemand]: 101/110 looper letters, 206 selfloop transitions, 12 changer transitions 0/239 dead transitions. [2022-12-12 21:20:19,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 239 transitions, 1384 flow [2022-12-12 21:20:19,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:20:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:20:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-12-12 21:20:19,124 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2022-12-12 21:20:19,124 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2022-12-12 21:20:19,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 239 transitions, 1384 flow [2022-12-12 21:20:19,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 239 transitions, 1384 flow [2022-12-12 21:20:19,161 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 239 transitions, 1384 flow [2022-12-12 21:20:19,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:19,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:19,161 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:19,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:20:19,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash 85783273, now seen corresponding path program 1 times [2022-12-12 21:20:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:19,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330263724] [2022-12-12 21:20:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:19,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:19,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:19,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330263724] [2022-12-12 21:20:19,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330263724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:20:19,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312919941] [2022-12-12 21:20:19,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:19,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:20:19,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:20:19,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:20:19,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 21:20:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:19,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-12 21:20:19,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:20:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:19,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 21:20:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:19,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312919941] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 21:20:19,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 21:20:19,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-12 21:20:19,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625924297] [2022-12-12 21:20:19,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 21:20:19,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 21:20:19,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:19,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 21:20:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-12 21:20:19,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-12 21:20:19,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 239 transitions, 1384 flow. Second operand has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:19,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:19,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-12 21:20:19,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:22,752 INFO L130 PetriNetUnfolder]: 30444/49480 cut-off events. [2022-12-12 21:20:22,752 INFO L131 PetriNetUnfolder]: For 2556/2638 co-relation queries the response was YES. [2022-12-12 21:20:22,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189224 conditions, 49480 events. 30444/49480 cut-off events. For 2556/2638 co-relation queries the response was YES. Maximal size of possible extension queue 1882. Compared 389980 event pairs, 4603 based on Foata normal form. 152/18575 useless extension candidates. Maximal degree in co-relation 186884. Up to 41550 conditions per place. [2022-12-12 21:20:22,921 INFO L137 encePairwiseOnDemand]: 88/110 looper letters, 625 selfloop transitions, 90 changer transitions 174/902 dead transitions. [2022-12-12 21:20:22,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 902 transitions, 7077 flow [2022-12-12 21:20:22,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 21:20:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 21:20:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 989 transitions. [2022-12-12 21:20:22,927 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47320574162679424 [2022-12-12 21:20:22,928 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2022-12-12 21:20:22,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 902 transitions, 7077 flow [2022-12-12 21:20:23,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 728 transitions, 5716 flow [2022-12-12 21:20:23,048 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 728 transitions, 5716 flow [2022-12-12 21:20:23,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.4) internal successors, (154), 10 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:23,048 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:23,048 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:23,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 21:20:23,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:20:23,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:23,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:23,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1181834336, now seen corresponding path program 1 times [2022-12-12 21:20:23,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:23,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888676279] [2022-12-12 21:20:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:23,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:23,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:23,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888676279] [2022-12-12 21:20:23,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888676279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:23,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:20:23,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:20:23,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666687920] [2022-12-12 21:20:23,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:23,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:20:23,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:23,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:20:23,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:20:23,380 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 110 [2022-12-12 21:20:23,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 728 transitions, 5716 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:23,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:23,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 110 [2022-12-12 21:20:23,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:24,723 INFO L130 PetriNetUnfolder]: 8670/14977 cut-off events. [2022-12-12 21:20:24,723 INFO L131 PetriNetUnfolder]: For 2352/2352 co-relation queries the response was YES. [2022-12-12 21:20:24,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72306 conditions, 14977 events. 8670/14977 cut-off events. For 2352/2352 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 105656 event pairs, 298 based on Foata normal form. 18/6014 useless extension candidates. Maximal degree in co-relation 70204. Up to 13295 conditions per place. [2022-12-12 21:20:24,752 INFO L137 encePairwiseOnDemand]: 88/110 looper letters, 278 selfloop transitions, 29 changer transitions 168/500 dead transitions. [2022-12-12 21:20:24,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 500 transitions, 4870 flow [2022-12-12 21:20:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:20:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:20:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-12-12 21:20:24,754 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2022-12-12 21:20:24,754 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-12-12 21:20:24,754 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 500 transitions, 4870 flow [2022-12-12 21:20:24,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 332 transitions, 3237 flow [2022-12-12 21:20:24,779 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 332 transitions, 3237 flow [2022-12-12 21:20:24,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:24,779 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:24,779 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:24,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:20:24,779 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1704635106, now seen corresponding path program 1 times [2022-12-12 21:20:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:24,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423926817] [2022-12-12 21:20:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:24,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:24,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423926817] [2022-12-12 21:20:24,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423926817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:24,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:20:24,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:20:24,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475315527] [2022-12-12 21:20:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:24,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:20:24,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:24,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:20:24,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:20:24,821 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-12 21:20:24,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 332 transitions, 3237 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:24,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:24,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-12 21:20:24,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:25,265 INFO L130 PetriNetUnfolder]: 3576/6456 cut-off events. [2022-12-12 21:20:25,265 INFO L131 PetriNetUnfolder]: For 1637/1637 co-relation queries the response was YES. [2022-12-12 21:20:25,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36337 conditions, 6456 events. 3576/6456 cut-off events. For 1637/1637 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 40382 event pairs, 103 based on Foata normal form. 23/3635 useless extension candidates. Maximal degree in co-relation 34827. Up to 5464 conditions per place. [2022-12-12 21:20:25,291 INFO L137 encePairwiseOnDemand]: 104/110 looper letters, 364 selfloop transitions, 8 changer transitions 5/388 dead transitions. [2022-12-12 21:20:25,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 388 transitions, 4561 flow [2022-12-12 21:20:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:20:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:20:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-12-12 21:20:25,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2022-12-12 21:20:25,292 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -37 predicate places. [2022-12-12 21:20:25,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 388 transitions, 4561 flow [2022-12-12 21:20:25,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 383 transitions, 4498 flow [2022-12-12 21:20:25,315 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 383 transitions, 4498 flow [2022-12-12 21:20:25,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:25,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:25,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:25,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:20:25,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:25,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:25,316 INFO L85 PathProgramCache]: Analyzing trace with hash 3699687, now seen corresponding path program 1 times [2022-12-12 21:20:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:25,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739783178] [2022-12-12 21:20:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:25,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:25,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739783178] [2022-12-12 21:20:25,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739783178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:25,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:20:25,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 21:20:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011708583] [2022-12-12 21:20:25,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:25,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 21:20:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 21:20:25,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-12 21:20:25,804 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 110 [2022-12-12 21:20:25,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 383 transitions, 4498 flow. Second operand has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:25,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:25,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 110 [2022-12-12 21:20:25,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:27,398 INFO L130 PetriNetUnfolder]: 7560/13580 cut-off events. [2022-12-12 21:20:27,398 INFO L131 PetriNetUnfolder]: For 7317/7317 co-relation queries the response was YES. [2022-12-12 21:20:27,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88206 conditions, 13580 events. 7560/13580 cut-off events. For 7317/7317 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 93632 event pairs, 96 based on Foata normal form. 0/7515 useless extension candidates. Maximal degree in co-relation 84407. Up to 12243 conditions per place. [2022-12-12 21:20:27,461 INFO L137 encePairwiseOnDemand]: 101/110 looper letters, 714 selfloop transitions, 24 changer transitions 59/823 dead transitions. [2022-12-12 21:20:27,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 823 transitions, 11430 flow [2022-12-12 21:20:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 21:20:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 21:20:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 348 transitions. [2022-12-12 21:20:27,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31636363636363635 [2022-12-12 21:20:27,464 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -28 predicate places. [2022-12-12 21:20:27,464 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 823 transitions, 11430 flow [2022-12-12 21:20:27,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 764 transitions, 10611 flow [2022-12-12 21:20:27,516 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 764 transitions, 10611 flow [2022-12-12 21:20:27,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:27,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:27,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:27,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:20:27,517 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:27,517 INFO L85 PathProgramCache]: Analyzing trace with hash -66498153, now seen corresponding path program 2 times [2022-12-12 21:20:27,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:27,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347507635] [2022-12-12 21:20:27,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:27,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:27,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:27,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347507635] [2022-12-12 21:20:27,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347507635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:27,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:20:27,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-12 21:20:27,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146293923] [2022-12-12 21:20:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:27,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-12 21:20:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:27,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-12 21:20:27,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-12 21:20:27,937 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 110 [2022-12-12 21:20:27,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 764 transitions, 10611 flow. Second operand has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:27,938 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:27,938 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 110 [2022-12-12 21:20:27,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:30,996 INFO L130 PetriNetUnfolder]: 10697/19381 cut-off events. [2022-12-12 21:20:30,996 INFO L131 PetriNetUnfolder]: For 16161/16161 co-relation queries the response was YES. [2022-12-12 21:20:31,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142860 conditions, 19381 events. 10697/19381 cut-off events. For 16161/16161 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 144269 event pairs, 156 based on Foata normal form. 0/10731 useless extension candidates. Maximal degree in co-relation 137699. Up to 17773 conditions per place. [2022-12-12 21:20:31,101 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 1012 selfloop transitions, 34 changer transitions 67/1139 dead transitions. [2022-12-12 21:20:31,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 1139 transitions, 18147 flow [2022-12-12 21:20:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 21:20:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 21:20:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 344 transitions. [2022-12-12 21:20:31,103 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31272727272727274 [2022-12-12 21:20:31,103 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -21 predicate places. [2022-12-12 21:20:31,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 1139 transitions, 18147 flow [2022-12-12 21:20:31,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 1072 transitions, 17042 flow [2022-12-12 21:20:31,187 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 1072 transitions, 17042 flow [2022-12-12 21:20:31,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.727272727272727) internal successors, (195), 11 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:31,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:31,187 INFO L214 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] [2022-12-12 21:20:31,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:20:31,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:31,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1320916582, now seen corresponding path program 1 times [2022-12-12 21:20:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:31,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070039238] [2022-12-12 21:20:31,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:31,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070039238] [2022-12-12 21:20:31,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070039238] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:20:31,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484590996] [2022-12-12 21:20:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:31,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:20:31,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:20:31,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:20:31,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 21:20:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:31,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 21:20:31,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:20:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 21:20:31,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 21:20:31,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484590996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:31,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 21:20:31,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-12 21:20:31,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303145098] [2022-12-12 21:20:31,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:31,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:20:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:20:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 21:20:31,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-12 21:20:31,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 1072 transitions, 17042 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:31,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:31,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-12 21:20:31,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:34,183 INFO L130 PetriNetUnfolder]: 10442/18319 cut-off events. [2022-12-12 21:20:34,183 INFO L131 PetriNetUnfolder]: For 16991/16991 co-relation queries the response was YES. [2022-12-12 21:20:34,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153135 conditions, 18319 events. 10442/18319 cut-off events. For 16991/16991 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 128752 event pairs, 156 based on Foata normal form. 29/10283 useless extension candidates. Maximal degree in co-relation 147406. Up to 16951 conditions per place. [2022-12-12 21:20:34,267 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 1193 selfloop transitions, 30 changer transitions 5/1237 dead transitions. [2022-12-12 21:20:34,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1237 transitions, 22123 flow [2022-12-12 21:20:34,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:20:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:20:34,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2022-12-12 21:20:34,269 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.31212121212121213 [2022-12-12 21:20:34,269 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, -16 predicate places. [2022-12-12 21:20:34,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 1237 transitions, 22123 flow [2022-12-12 21:20:34,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 1232 transitions, 22030 flow [2022-12-12 21:20:34,352 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 1232 transitions, 22030 flow [2022-12-12 21:20:34,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:34,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:34,353 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-12-12 21:20:34,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 21:20:34,557 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,SelfDestructingSolverStorable7 [2022-12-12 21:20:34,558 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:34,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1297883625, now seen corresponding path program 2 times [2022-12-12 21:20:34,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:34,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765184489] [2022-12-12 21:20:34,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:34,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:34,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765184489] [2022-12-12 21:20:34,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765184489] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:20:34,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969909249] [2022-12-12 21:20:34,654 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 21:20:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:20:34,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:20:34,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:20:34,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 21:20:34,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 21:20:34,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 21:20:34,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 21:20:34,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:20:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:34,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 21:20:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:20:34,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969909249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 21:20:34,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 21:20:34,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-12-12 21:20:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227861166] [2022-12-12 21:20:34,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 21:20:34,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-12 21:20:34,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:34,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-12 21:20:34,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-12 21:20:34,904 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-12 21:20:34,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 1232 transitions, 22030 flow. Second operand has 18 states, 18 states have (on average 15.444444444444445) internal successors, (278), 18 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:34,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:34,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-12 21:20:34,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:40,299 INFO L130 PetriNetUnfolder]: 16656/28975 cut-off events. [2022-12-12 21:20:40,299 INFO L131 PetriNetUnfolder]: For 24817/24817 co-relation queries the response was YES. [2022-12-12 21:20:40,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271085 conditions, 28975 events. 16656/28975 cut-off events. For 24817/24817 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 199174 event pairs, 156 based on Foata normal form. 0/15980 useless extension candidates. Maximal degree in co-relation 260376. Up to 27257 conditions per place. [2022-12-12 21:20:40,635 INFO L137 encePairwiseOnDemand]: 104/110 looper letters, 1915 selfloop transitions, 48 changer transitions 0/1972 dead transitions. [2022-12-12 21:20:40,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 1972 transitions, 39312 flow [2022-12-12 21:20:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 21:20:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 21:20:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 590 transitions. [2022-12-12 21:20:40,638 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3155080213903743 [2022-12-12 21:20:40,639 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-12-12 21:20:40,639 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 1972 transitions, 39312 flow [2022-12-12 21:20:40,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 1972 transitions, 39312 flow [2022-12-12 21:20:40,767 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 1972 transitions, 39312 flow [2022-12-12 21:20:40,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 15.444444444444445) internal successors, (278), 18 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:40,768 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:40,768 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:40,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 21:20:40,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:20:40,973 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1299010412, now seen corresponding path program 1 times [2022-12-12 21:20:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:40,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643844027] [2022-12-12 21:20:40,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:40,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 21:20:41,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:41,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643844027] [2022-12-12 21:20:41,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643844027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:20:41,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:20:41,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-12 21:20:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15170753] [2022-12-12 21:20:41,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:20:41,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 21:20:41,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:20:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 21:20:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-12-12 21:20:41,473 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 21:20:41,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 1972 transitions, 39312 flow. Second operand has 15 states, 15 states have (on average 11.866666666666667) internal successors, (178), 15 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:41,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:20:41,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 21:20:41,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:20:55,723 INFO L130 PetriNetUnfolder]: 26302/45817 cut-off events. [2022-12-12 21:20:55,723 INFO L131 PetriNetUnfolder]: For 42034/42034 co-relation queries the response was YES. [2022-12-12 21:20:55,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472143 conditions, 45817 events. 26302/45817 cut-off events. For 42034/42034 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 340754 event pairs, 189 based on Foata normal form. 0/25332 useless extension candidates. Maximal degree in co-relation 453189. Up to 43395 conditions per place. [2022-12-12 21:20:55,976 INFO L137 encePairwiseOnDemand]: 94/110 looper letters, 3800 selfloop transitions, 329 changer transitions 136/4274 dead transitions. [2022-12-12 21:20:55,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 4274 transitions, 93647 flow [2022-12-12 21:20:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-12 21:20:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-12 21:20:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 617 transitions. [2022-12-12 21:20:55,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1934169278996865 [2022-12-12 21:20:55,979 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 28 predicate places. [2022-12-12 21:20:55,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 4274 transitions, 93647 flow [2022-12-12 21:20:56,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 4138 transitions, 90586 flow [2022-12-12 21:20:56,213 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 4138 transitions, 90586 flow [2022-12-12 21:20:56,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.866666666666667) internal successors, (178), 15 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:20:56,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:20:56,213 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:20:56,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:20:56,214 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:20:56,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:20:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash -808645022, now seen corresponding path program 2 times [2022-12-12 21:20:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:20:56,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977293003] [2022-12-12 21:20:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:20:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:20:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:20:56,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 21:20:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:20:56,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977293003] [2022-12-12 21:20:56,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977293003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:20:56,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384773539] [2022-12-12 21:20:56,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 21:20:56,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:20:56,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:20:56,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:20:56,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 21:20:56,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-12 21:20:56,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 21:20:56,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-12 21:20:56,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:20:57,003 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 21:20:57,004 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 15 treesize of output 15 [2022-12-12 21:20:57,225 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 22 treesize of output 17 [2022-12-12 21:20:57,275 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 59 treesize of output 54 [2022-12-12 21:20:57,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-12 21:21:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 21:21:01,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 21:21:01,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 21:21:01,954 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 29 treesize of output 30 [2022-12-12 21:21:01,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 21:21:01,961 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 49 treesize of output 52 [2022-12-12 21:21:01,964 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 28 treesize of output 22 [2022-12-12 21:21:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 21:21:02,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384773539] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 21:21:02,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 21:21:02,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2022-12-12 21:21:02,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50635551] [2022-12-12 21:21:02,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 21:21:02,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-12-12 21:21:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:21:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-12-12 21:21:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1741, Unknown=7, NotChecked=0, Total=1892 [2022-12-12 21:21:02,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 21:21:02,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 4138 transitions, 90586 flow. Second operand has 44 states, 44 states have (on average 11.909090909090908) internal successors, (524), 44 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:21:02,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:21:02,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 21:21:02,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:22:01,596 INFO L130 PetriNetUnfolder]: 33546/58666 cut-off events. [2022-12-12 21:22:01,597 INFO L131 PetriNetUnfolder]: For 60633/60633 co-relation queries the response was YES. [2022-12-12 21:22:01,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658119 conditions, 58666 events. 33546/58666 cut-off events. For 60633/60633 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 447119 event pairs, 401 based on Foata normal form. 0/32700 useless extension candidates. Maximal degree in co-relation 633242. Up to 55522 conditions per place. [2022-12-12 21:22:01,953 INFO L137 encePairwiseOnDemand]: 94/110 looper letters, 5306 selfloop transitions, 424 changer transitions 0/5739 dead transitions. [2022-12-12 21:22:01,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 5739 transitions, 136916 flow [2022-12-12 21:22:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-12 21:22:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-12 21:22:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 698 transitions. [2022-12-12 21:22:01,956 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.19829545454545455 [2022-12-12 21:22:01,957 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 59 predicate places. [2022-12-12 21:22:01,957 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 5739 transitions, 136916 flow [2022-12-12 21:22:02,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 5739 transitions, 136916 flow [2022-12-12 21:22:02,293 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 5739 transitions, 136916 flow [2022-12-12 21:22:02,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 11.909090909090908) internal successors, (524), 44 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:22:02,293 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:22:02,293 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:22:02,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 21:22:02,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:22:02,498 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:22:02,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:22:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -679061408, now seen corresponding path program 2 times [2022-12-12 21:22:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:22:02,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553008180] [2022-12-12 21:22:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:22:02,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:22:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:22:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 21:22:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:22:02,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553008180] [2022-12-12 21:22:02,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553008180] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:22:02,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086857208] [2022-12-12 21:22:02,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 21:22:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:22:02,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:22:02,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:22:02,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 21:22:02,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 21:22:02,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 21:22:02,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-12 21:22:02,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:22:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 21:22:02,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 21:22:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 21:22:02,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086857208] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 21:22:02,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 21:22:02,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-12-12 21:22:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109640103] [2022-12-12 21:22:02,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 21:22:02,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 21:22:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:22:02,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 21:22:02,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-12-12 21:22:02,819 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 110 [2022-12-12 21:22:02,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 5739 transitions, 136916 flow. Second operand has 16 states, 16 states have (on average 16.4375) internal successors, (263), 16 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:22:02,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:22:02,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 110 [2022-12-12 21:22:02,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:22:48,410 INFO L130 PetriNetUnfolder]: 36649/64165 cut-off events. [2022-12-12 21:22:48,411 INFO L131 PetriNetUnfolder]: For 66763/66763 co-relation queries the response was YES. [2022-12-12 21:22:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781861 conditions, 64165 events. 36649/64165 cut-off events. For 66763/66763 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 498836 event pairs, 181 based on Foata normal form. 0/35844 useless extension candidates. Maximal degree in co-relation 750573. Up to 60815 conditions per place. [2022-12-12 21:22:48,845 INFO L137 encePairwiseOnDemand]: 102/110 looper letters, 6199 selfloop transitions, 297 changer transitions 0/6505 dead transitions. [2022-12-12 21:22:48,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 6505 transitions, 168301 flow [2022-12-12 21:22:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 21:22:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 21:22:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 481 transitions. [2022-12-12 21:22:48,851 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2572192513368984 [2022-12-12 21:22:48,852 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 75 predicate places. [2022-12-12 21:22:48,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 6505 transitions, 168301 flow [2022-12-12 21:22:49,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 6505 transitions, 168301 flow [2022-12-12 21:22:49,286 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 6505 transitions, 168301 flow [2022-12-12 21:22:49,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.4375) internal successors, (263), 16 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:22:49,286 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:22:49,286 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:22:49,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-12 21:22:49,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-12 21:22:49,491 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:22:49,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:22:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1394710335, now seen corresponding path program 1 times [2022-12-12 21:22:49,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:22:49,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452294024] [2022-12-12 21:22:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:22:49,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:22:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:22:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:22:51,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:22:51,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452294024] [2022-12-12 21:22:51,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452294024] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:22:51,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253011298] [2022-12-12 21:22:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:22:51,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:22:51,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:22:51,919 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:22:51,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 21:22:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:22:52,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-12 21:22:52,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:22:52,346 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 22 treesize of output 17 [2022-12-12 21:22:52,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 21:22:52,817 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 72 treesize of output 43 [2022-12-12 21:22:53,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-12 21:23:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:23:06,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 21:23:08,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-12-12 21:23:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:23:08,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253011298] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 21:23:08,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 21:23:08,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 61 [2022-12-12 21:23:08,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452850686] [2022-12-12 21:23:08,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 21:23:08,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-12 21:23:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:23:08,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-12 21:23:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=3460, Unknown=0, NotChecked=0, Total=3782 [2022-12-12 21:23:08,710 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 21:23:08,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 6505 transitions, 168301 flow. Second operand has 62 states, 62 states have (on average 11.790322580645162) internal successors, (731), 62 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:23:08,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:23:08,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 21:23:08,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:23:17,509 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] [2022-12-12 21:23:26,514 WARN L233 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 137 DAG size of output: 134 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 21:23:38,440 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] [2022-12-12 21:23:40,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:23:43,033 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] [2022-12-12 21:23:50,419 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] [2022-12-12 21:23:52,566 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] [2022-12-12 21:23:54,715 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] [2022-12-12 21:23:57,030 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] [2022-12-12 21:24:04,039 WARN L233 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 249 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 21:24:13,749 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] [2022-12-12 21:24:20,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:24:22,853 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] [2022-12-12 21:24:28,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:24:30,674 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] [2022-12-12 21:24:32,816 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] [2022-12-12 21:24:35,077 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] [2022-12-12 21:24:39,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:24:41,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:24:44,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:24:52,675 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] [2022-12-12 21:24:54,840 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] [2022-12-12 21:24:57,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:25:05,020 WARN L233 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 252 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 21:25:09,423 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] [2022-12-12 21:25:14,061 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] [2022-12-12 21:25:16,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:25:18,569 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] [2022-12-12 21:25:28,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:25:31,228 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] [2022-12-12 21:25:33,387 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] [2022-12-12 21:25:39,557 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] [2022-12-12 21:25:41,701 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] [2022-12-12 21:25:43,787 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] [2022-12-12 21:25:48,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:25:50,466 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] [2022-12-12 21:25:52,491 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] [2022-12-12 21:25:54,513 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] [2022-12-12 21:25:56,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:25:59,441 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] [2022-12-12 21:26:01,613 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] [2022-12-12 21:26:08,133 WARN L233 SmtUtils]: Spent 5.09s on a formula simplification. DAG size of input: 150 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 21:26:10,389 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] [2022-12-12 21:26:12,538 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] [2022-12-12 21:26:14,720 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] [2022-12-12 21:26:25,228 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] [2022-12-12 21:26:27,264 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] [2022-12-12 21:26:29,291 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] [2022-12-12 21:26:31,313 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] [2022-12-12 21:26:33,344 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] [2022-12-12 21:26:35,366 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] [2022-12-12 21:26:38,481 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] [2022-12-12 21:26:40,692 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] [2022-12-12 21:26:44,351 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] [2022-12-12 21:26:46,382 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] [2022-12-12 21:26:49,932 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] [2022-12-12 21:26:51,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:26:53,611 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] [2022-12-12 21:26:55,634 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] [2022-12-12 21:26:58,347 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] [2022-12-12 21:27:00,491 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] [2022-12-12 21:27:04,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:27:06,288 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] [2022-12-12 21:27:08,317 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] [2022-12-12 21:27:10,344 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] [2022-12-12 21:27:12,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:27:14,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:27:17,490 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] [2022-12-12 21:27:21,955 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] [2022-12-12 21:27:24,944 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] [2022-12-12 21:27:35,274 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] [2022-12-12 21:27:42,860 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] [2022-12-12 21:27:44,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:27:47,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:28:04,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:28:06,532 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] [2022-12-12 21:28:08,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:28:10,438 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] [2022-12-12 21:28:12,500 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] [2022-12-12 21:28:16,008 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] [2022-12-12 21:28:18,046 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] [2022-12-12 21:28:20,099 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] [2022-12-12 21:28:34,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:28:36,207 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] [2022-12-12 21:28:37,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:28:39,882 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] [2022-12-12 21:28:41,895 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] [2022-12-12 21:28:43,909 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] [2022-12-12 21:28:45,919 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] [2022-12-12 21:28:47,937 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] [2022-12-12 21:28:50,907 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] [2022-12-12 21:29:06,736 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] [2022-12-12 21:29:08,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 [0] [2022-12-12 21:29:10,772 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] [2022-12-12 21:29:12,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:29:14,834 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] [2022-12-12 21:29:16,855 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] [2022-12-12 21:29:19,108 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] [2022-12-12 21:29:21,127 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] [2022-12-12 21:29:23,931 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] [2022-12-12 21:29:27,718 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] [2022-12-12 21:29:29,751 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] [2022-12-12 21:29:31,782 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] [2022-12-12 21:29:33,822 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] [2022-12-12 21:29:35,841 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] [2022-12-12 21:29:37,863 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] [2022-12-12 21:29:39,883 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] [2022-12-12 21:29:41,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:29:43,131 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] [2022-12-12 21:29:45,169 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] [2022-12-12 21:29:48,479 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] [2022-12-12 21:29:51,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:29:53,489 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] [2022-12-12 21:29:55,501 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] [2022-12-12 21:29:57,527 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] [2022-12-12 21:29:59,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:30:01,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:30:07,396 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] [2022-12-12 21:30:19,693 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] [2022-12-12 21:30:26,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:30:38,452 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] [2022-12-12 21:30:43,524 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] [2022-12-12 21:30:45,573 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] [2022-12-12 21:30:47,588 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] [2022-12-12 21:30:49,901 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] [2022-12-12 21:30:51,928 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] [2022-12-12 21:30:56,055 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] [2022-12-12 21:31:12,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:31:14,719 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] [2022-12-12 21:31:16,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:31:17,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 21:31:19,907 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] [2022-12-12 21:31:21,928 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] [2022-12-12 21:31:23,942 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] [2022-12-12 21:31:25,953 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] [2022-12-12 21:31:31,676 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] [2022-12-12 21:31:33,710 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] [2022-12-12 21:31:35,731 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] [2022-12-12 21:31:37,763 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] [2022-12-12 21:31:39,783 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] [2022-12-12 21:31:41,806 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] [2022-12-12 21:31:43,831 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] [2022-12-12 21:31:45,854 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] [2022-12-12 21:31:50,463 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] [2022-12-12 21:31:52,483 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] [2022-12-12 21:31:54,510 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] [2022-12-12 21:32:35,110 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] [2022-12-12 21:32:39,807 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] [2022-12-12 21:33:21,476 INFO L130 PetriNetUnfolder]: 66566/117311 cut-off events. [2022-12-12 21:33:21,477 INFO L131 PetriNetUnfolder]: For 141227/141227 co-relation queries the response was YES. [2022-12-12 21:33:21,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538701 conditions, 117311 events. 66566/117311 cut-off events. For 141227/141227 co-relation queries the response was YES. Maximal size of possible extension queue 1585. Compared 1003177 event pairs, 271 based on Foata normal form. 0/65833 useless extension candidates. Maximal degree in co-relation 1476845. Up to 111393 conditions per place. [2022-12-12 21:33:22,406 INFO L137 encePairwiseOnDemand]: 92/110 looper letters, 10707 selfloop transitions, 977 changer transitions 115/11808 dead transitions. [2022-12-12 21:33:22,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 11808 transitions, 328531 flow [2022-12-12 21:33:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-12-12 21:33:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2022-12-12 21:33:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 2142 transitions. [2022-12-12 21:33:22,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.1987012987012987 [2022-12-12 21:33:22,425 INFO L295 CegarLoopForPetriNet]: 111 programPoint places, 172 predicate places. [2022-12-12 21:33:22,425 INFO L82 GeneralOperation]: Start removeDead. Operand has 283 places, 11808 transitions, 328531 flow [2022-12-12 21:33:23,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 283 places, 11693 transitions, 325242 flow [2022-12-12 21:33:23,529 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 11693 transitions, 325242 flow [2022-12-12 21:33:23,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 11.790322580645162) internal successors, (731), 62 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:23,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:33:23,531 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:33:23,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-12 21:33:23,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:33:23,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 21:33:23,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:33:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1296590399, now seen corresponding path program 2 times [2022-12-12 21:33:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:33:23,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352418226] [2022-12-12 21:33:23,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:33:23,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:33:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:33:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:25,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:33:25,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352418226] [2022-12-12 21:33:25,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352418226] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 21:33:25,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046299885] [2022-12-12 21:33:25,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 21:33:25,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:33:25,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:33:25,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 21:33:25,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 21:33:25,230 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 21:33:25,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 21:33:25,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-12 21:33:25,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 21:33:25,250 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 21:33:25,251 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 15 treesize of output 15 [2022-12-12 21:33:25,547 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 22 treesize of output 17 [2022-12-12 21:33:25,617 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 59 treesize of output 54 [2022-12-12 21:33:26,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 21:33:26,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 72 treesize of output 43 [2022-12-12 21:33:26,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 46 [2022-12-12 21:33:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:35,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 21:33:37,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 (Array Int Int))) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_561) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296)))) is different from false [2022-12-12 21:33:37,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 21:33:37,086 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 29 treesize of output 30 [2022-12-12 21:33:37,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 21:33:37,100 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 49 treesize of output 52 [2022-12-12 21:33:37,105 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 28 treesize of output 22 [2022-12-12 21:33:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 21:33:37,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046299885] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 21:33:37,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 21:33:37,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 20] total 66 [2022-12-12 21:33:37,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261957723] [2022-12-12 21:33:37,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 21:33:37,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-12 21:33:37,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:33:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-12 21:33:37,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=4170, Unknown=3, NotChecked=130, Total=4556 [2022-12-12 21:33:37,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 110 [2022-12-12 21:33:37,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 11693 transitions, 325242 flow. Second operand has 68 states, 68 states have (on average 11.632352941176471) internal successors, (791), 68 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 21:33:37,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:33:37,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 110 [2022-12-12 21:33:37,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 21:34:23,409 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 21:34:23,409 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 21:34:23,956 WARN L249 SmtUtils]: Removed 20 from assertion stack [2022-12-12 21:34:23,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-12 21:34:23,957 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:34:23,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-12 21:34:24,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 21:34:24,158 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 207 for 4415ms.. [2022-12-12 21:34:24,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-12 21:34:24,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:34:24,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-12 21:34:24,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-12 21:34:24,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:34:24,160 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-12-12 21:34:24,164 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:34:24,164 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:34:24,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:34:24 BasicIcfg [2022-12-12 21:34:24,166 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:34:24,166 INFO L158 Benchmark]: Toolchain (without parser) took 853252.52ms. Allocated memory was 204.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 178.1MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-12 21:34:24,166 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 204.5MB. Free memory is still 181.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:34:24,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.25ms. Allocated memory is still 204.5MB. Free memory was 177.8MB in the beginning and 148.8MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.53ms. Allocated memory is still 204.5MB. Free memory was 148.8MB in the beginning and 146.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,166 INFO L158 Benchmark]: Boogie Preprocessor took 32.98ms. Allocated memory is still 204.5MB. Free memory was 146.3MB in the beginning and 144.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,167 INFO L158 Benchmark]: RCFGBuilder took 412.93ms. Allocated memory is still 204.5MB. Free memory was 144.2MB in the beginning and 127.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-12 21:34:24,167 INFO L158 Benchmark]: TraceAbstraction took 852292.64ms. Allocated memory was 204.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 126.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-12 21:34:24,196 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.14ms. Allocated memory is still 204.5MB. Free memory is still 181.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 451.25ms. Allocated memory is still 204.5MB. Free memory was 177.8MB in the beginning and 148.8MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.53ms. Allocated memory is still 204.5MB. Free memory was 148.8MB in the beginning and 146.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.98ms. Allocated memory is still 204.5MB. Free memory was 146.3MB in the beginning and 144.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 412.93ms. Allocated memory is still 204.5MB. Free memory was 144.2MB in the beginning and 127.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 852292.64ms. Allocated memory was 204.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 126.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 136 PlacesBefore, 111 PlacesAfterwards, 139 TransitionsBefore, 110 TransitionsAfterwards, 6382 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 75 ConcurrentYvCompositions, 9 ChoiceCompositions, 116 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15903, independent: 15645, independent conditional: 15645, independent unconditional: 0, dependent: 258, dependent conditional: 258, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15903, independent: 15645, independent conditional: 0, independent unconditional: 15645, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15903, independent: 15645, independent conditional: 0, independent unconditional: 15645, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15903, independent: 15645, independent conditional: 0, independent unconditional: 15645, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6767, independent: 6679, independent conditional: 0, independent unconditional: 6679, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6767, independent: 6676, independent conditional: 0, independent unconditional: 6676, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 91, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 92, dependent conditional: 0, dependent unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15903, independent: 8966, independent conditional: 0, independent unconditional: 8966, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 6767, unknown conditional: 0, unknown unconditional: 6767] , Statistics on independence cache: Total cache size (in pairs): 19427, Positive cache size: 19339, Positive conditional cache size: 0, Positive unconditional cache size: 19339, Negative cache size: 88, Negative conditional cache size: 0, Negative unconditional cache size: 88, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 207 for 4415ms.. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 207 for 4415ms.. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 207 for 4415ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 207 for 4415ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 234 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 2.7s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 852.1s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 801.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 137 mSolverCounterUnknown, 9989 SdHoareTripleChecker+Valid, 334.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9989 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 329.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 194 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 657 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22744 IncrementalHoareTripleChecker+Invalid, 23732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 657 mSolverCounterUnsat, 10 mSDtfsCounter, 22744 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 270 SyntacticMatches, 7 SemanticMatches, 478 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 10516 ImplicationChecksByTransitivity, 253.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325242occurred in iteration=13, InterpolantAutomatonStates: 250, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 11432 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 40.6s InterpolantComputationTime, 513 NumberOfCodeBlocks, 506 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 659 ConstructedInterpolants, 11 QuantifiedInterpolants, 12503 SizeOfPredicates, 93 NumberOfNonLiveVariables, 1835 ConjunctsInSsa, 222 ConjunctsInUnsatCore, 27 InterpolantComputations, 8 PerfectInterpolantSequences, 47/262 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