/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 08:31:17,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 08:31:17,138 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 08:31:17,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 08:31:17,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 08:31:17,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 08:31:17,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 08:31:17,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 08:31:17,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 08:31:17,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 08:31:17,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 08:31:17,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 08:31:17,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 08:31:17,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 08:31:17,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 08:31:17,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 08:31:17,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 08:31:17,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 08:31:17,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 08:31:17,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 08:31:17,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 08:31:17,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 08:31:17,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 08:31:17,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 08:31:17,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 08:31:17,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 08:31:17,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 08:31:17,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 08:31:17,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 08:31:17,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 08:31:17,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 08:31:17,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 08:31:17,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 08:31:17,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 08:31:17,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 08:31:17,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 08:31:17,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 08:31:17,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 08:31:17,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 08:31:17,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 08:31:17,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 08:31:17,208 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 08:31:17,228 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 08:31:17,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 08:31:17,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 08:31:17,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 08:31:17,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 08:31:17,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 08:31:17,230 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 08:31:17,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 08:31:17,230 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 08:31:17,230 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 08:31:17,231 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 08:31:17,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 08:31:17,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 08:31:17,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 08:31:17,233 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 08:31:17,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 08:31:17,233 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 08:31:17,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 08:31:17,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 08:31:17,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 08:31:17,459 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 08:31:17,459 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 08:31:17,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-01-28 08:31:18,319 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 08:31:18,518 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 08:31:18,519 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-01-28 08:31:18,523 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7152c94fc/791987aa55f249e68daa0e1b854a3a8c/FLAGb4484e4ec [2023-01-28 08:31:18,531 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7152c94fc/791987aa55f249e68daa0e1b854a3a8c [2023-01-28 08:31:18,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 08:31:18,534 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 08:31:18,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 08:31:18,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 08:31:18,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 08:31:18,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d365f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18, skipping insertion in model container [2023-01-28 08:31:18,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 08:31:18,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 08:31:18,663 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2023-01-28 08:31:18,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 08:31:18,673 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 08:31:18,691 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2023-01-28 08:31:18,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 08:31:18,704 INFO L208 MainTranslator]: Completed translation [2023-01-28 08:31:18,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18 WrapperNode [2023-01-28 08:31:18,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 08:31:18,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 08:31:18,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 08:31:18,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 08:31:18,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,732 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2023-01-28 08:31:18,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 08:31:18,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 08:31:18,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 08:31:18,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 08:31:18,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,756 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 08:31:18,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 08:31:18,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 08:31:18,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 08:31:18,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (1/1) ... [2023-01-28 08:31:18,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 08:31:18,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:31:18,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 08:31:18,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 08:31:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 08:31:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 08:31:18,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 08:31:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 08:31:18,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 08:31:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 08:31:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 08:31:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 08:31:18,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 08:31:18,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 08:31:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 08:31:18,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 08:31:18,812 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 08:31:18,866 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 08:31:18,867 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 08:31:18,986 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 08:31:18,990 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 08:31:18,990 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-01-28 08:31:18,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:31:18 BoogieIcfgContainer [2023-01-28 08:31:18,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 08:31:18,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 08:31:18,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 08:31:18,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 08:31:18,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 08:31:18" (1/3) ... [2023-01-28 08:31:18,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d432fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:31:18, skipping insertion in model container [2023-01-28 08:31:18,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:31:18" (2/3) ... [2023-01-28 08:31:18,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d432fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:31:18, skipping insertion in model container [2023-01-28 08:31:18,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:31:18" (3/3) ... [2023-01-28 08:31:18,997 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-01-28 08:31:19,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 08:31:19,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 08:31:19,032 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 08:31:19,090 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 08:31:19,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 77 transitions, 170 flow [2023-01-28 08:31:19,165 INFO L130 PetriNetUnfolder]: 6/75 cut-off events. [2023-01-28 08:31:19,166 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 08:31:19,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-01-28 08:31:19,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 77 transitions, 170 flow [2023-01-28 08:31:19,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2023-01-28 08:31:19,173 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:31:19,179 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2023-01-28 08:31:19,180 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2023-01-28 08:31:19,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2023-01-28 08:31:19,195 INFO L130 PetriNetUnfolder]: 6/67 cut-off events. [2023-01-28 08:31:19,195 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 08:31:19,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 67 events. 6/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-01-28 08:31:19,196 INFO L119 LiptonReduction]: Number of co-enabled transitions 252 [2023-01-28 08:31:20,668 INFO L134 LiptonReduction]: Checked pairs total: 297 [2023-01-28 08:31:20,668 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-01-28 08:31:20,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 08:31:20,682 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;@e2969fe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:31:20,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 08:31:20,686 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2023-01-28 08:31:20,686 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 08:31:20,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:31:20,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:31:20,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:31:20,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:31:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1136073076, now seen corresponding path program 1 times [2023-01-28 08:31:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:31:20,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492896870] [2023-01-28 08:31:20,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:31:20,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:31:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:31:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:21,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:31:21,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492896870] [2023-01-28 08:31:21,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492896870] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:31:21,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:31:21,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 08:31:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468419347] [2023-01-28 08:31:21,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:31:21,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:31:21,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:31:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:31:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:31:21,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 142 [2023-01-28 08:31:21,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:31:21,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 142 [2023-01-28 08:31:21,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:31:21,087 INFO L130 PetriNetUnfolder]: 41/77 cut-off events. [2023-01-28 08:31:21,088 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-01-28 08:31:21,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 165 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2023-01-28 08:31:21,089 INFO L137 encePairwiseOnDemand]: 138/142 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2023-01-28 08:31:21,089 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2023-01-28 08:31:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:31:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:31:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2023-01-28 08:31:21,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507042253521127 [2023-01-28 08:31:21,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2023-01-28 08:31:21,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2023-01-28 08:31:21,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:31:21,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2023-01-28 08:31:21,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,107 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 192 transitions. [2023-01-28 08:31:21,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2023-01-28 08:31:21,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 08:31:21,111 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2023-01-28 08:31:21,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2023-01-28 08:31:21,116 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2023-01-28 08:31:21,116 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2023-01-28 08:31:21,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:31:21,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:31:21,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 08:31:21,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:31:21,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:31:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1884749856, now seen corresponding path program 1 times [2023-01-28 08:31:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:31:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897147568] [2023-01-28 08:31:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:31:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:31:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:31:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:21,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:31:21,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897147568] [2023-01-28 08:31:21,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897147568] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:31:21,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:31:21,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 08:31:21,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183147688] [2023-01-28 08:31:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:31:21,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 08:31:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:31:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 08:31:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 08:31:21,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 08:31:21,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:31:21,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 08:31:21,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:31:21,344 INFO L130 PetriNetUnfolder]: 39/75 cut-off events. [2023-01-28 08:31:21,345 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-01-28 08:31:21,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 75 events. 39/75 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 165 event pairs, 2 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 55. Up to 28 conditions per place. [2023-01-28 08:31:21,346 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 24 selfloop transitions, 6 changer transitions 4/34 dead transitions. [2023-01-28 08:31:21,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 34 transitions, 165 flow [2023-01-28 08:31:21,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:31:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:31:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2023-01-28 08:31:21,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4295774647887324 [2023-01-28 08:31:21,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 305 transitions. [2023-01-28 08:31:21,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 305 transitions. [2023-01-28 08:31:21,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:31:21,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 305 transitions. [2023-01-28 08:31:21,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,356 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 5 states and 305 transitions. [2023-01-28 08:31:21,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 34 transitions, 165 flow [2023-01-28 08:31:21,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 34 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:31:21,358 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 70 flow [2023-01-28 08:31:21,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2023-01-28 08:31:21,358 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2023-01-28 08:31:21,359 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 70 flow [2023-01-28 08:31:21,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:31:21,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:31:21,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 08:31:21,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:31:21,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:31:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1479151157, now seen corresponding path program 1 times [2023-01-28 08:31:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:31:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655042818] [2023-01-28 08:31:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:31:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:31:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:31:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:21,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:31:21,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655042818] [2023-01-28 08:31:21,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655042818] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:31:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:31:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 08:31:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228546093] [2023-01-28 08:31:21,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:31:21,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 08:31:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:31:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 08:31:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 08:31:21,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 08:31:21,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:31:21,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 08:31:21,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:31:21,543 INFO L130 PetriNetUnfolder]: 32/66 cut-off events. [2023-01-28 08:31:21,544 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2023-01-28 08:31:21,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 66 events. 32/66 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 140 event pairs, 6 based on Foata normal form. 4/70 useless extension candidates. Maximal degree in co-relation 57. Up to 45 conditions per place. [2023-01-28 08:31:21,544 INFO L137 encePairwiseOnDemand]: 138/142 looper letters, 15 selfloop transitions, 3 changer transitions 8/26 dead transitions. [2023-01-28 08:31:21,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 142 flow [2023-01-28 08:31:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 08:31:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 08:31:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2023-01-28 08:31:21,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4278169014084507 [2023-01-28 08:31:21,547 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 243 transitions. [2023-01-28 08:31:21,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 243 transitions. [2023-01-28 08:31:21,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:31:21,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 243 transitions. [2023-01-28 08:31:21,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,549 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,549 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 70 flow. Second operand 4 states and 243 transitions. [2023-01-28 08:31:21,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 142 flow [2023-01-28 08:31:21,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:31:21,550 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 62 flow [2023-01-28 08:31:21,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2023-01-28 08:31:21,551 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2023-01-28 08:31:21,553 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 62 flow [2023-01-28 08:31:21,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:21,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:31:21,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:31:21,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 08:31:21,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:31:21,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:31:21,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1582616416, now seen corresponding path program 2 times [2023-01-28 08:31:21,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:31:21,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25085586] [2023-01-28 08:31:21,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:31:21,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:31:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:31:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:21,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:31:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25085586] [2023-01-28 08:31:21,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25085586] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:31:21,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291146406] [2023-01-28 08:31:21,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:31:21,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:31:21,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:31:21,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:31:21,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 08:31:21,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:31:21,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:31:21,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-28 08:31:21,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:31:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:21,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:31:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:22,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291146406] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:31:22,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:31:22,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-01-28 08:31:22,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52874575] [2023-01-28 08:31:22,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:31:22,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:31:22,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:31:22,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:31:22,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:31:22,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 08:31:22,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:31:22,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 08:31:22,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:31:22,128 INFO L130 PetriNetUnfolder]: 34/63 cut-off events. [2023-01-28 08:31:22,128 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-01-28 08:31:22,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 63 events. 34/63 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 4 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 49. Up to 39 conditions per place. [2023-01-28 08:31:22,129 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-01-28 08:31:22,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 155 flow [2023-01-28 08:31:22,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:31:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:31:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2023-01-28 08:31:22,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225352112676056 [2023-01-28 08:31:22,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 300 transitions. [2023-01-28 08:31:22,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 300 transitions. [2023-01-28 08:31:22,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:31:22,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 300 transitions. [2023-01-28 08:31:22,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,135 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 62 flow. Second operand 5 states and 300 transitions. [2023-01-28 08:31:22,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 155 flow [2023-01-28 08:31:22,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 147 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 08:31:22,136 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2023-01-28 08:31:22,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2023-01-28 08:31:22,137 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2023-01-28 08:31:22,137 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2023-01-28 08:31:22,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:31:22,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:31:22,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 08:31:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:31:22,338 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:31:22,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:31:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash 410010517, now seen corresponding path program 2 times [2023-01-28 08:31:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:31:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155413111] [2023-01-28 08:31:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:31:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:31:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:31:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:22,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:31:22,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155413111] [2023-01-28 08:31:22,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155413111] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:31:22,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:31:22,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 08:31:22,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876943057] [2023-01-28 08:31:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:31:22,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 08:31:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:31:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 08:31:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:31:22,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2023-01-28 08:31:22,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:31:22,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2023-01-28 08:31:22,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:31:22,521 INFO L130 PetriNetUnfolder]: 40/73 cut-off events. [2023-01-28 08:31:22,521 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2023-01-28 08:31:22,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 73 events. 40/73 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 4 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 119. Up to 61 conditions per place. [2023-01-28 08:31:22,524 INFO L137 encePairwiseOnDemand]: 137/142 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-01-28 08:31:22,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 178 flow [2023-01-28 08:31:22,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:31:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:31:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 271 transitions. [2023-01-28 08:31:22,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3816901408450704 [2023-01-28 08:31:22,525 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 271 transitions. [2023-01-28 08:31:22,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 271 transitions. [2023-01-28 08:31:22,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:31:22,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 271 transitions. [2023-01-28 08:31:22,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,528 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 5 states and 271 transitions. [2023-01-28 08:31:22,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 178 flow [2023-01-28 08:31:22,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 08:31:22,530 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 127 flow [2023-01-28 08:31:22,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-01-28 08:31:22,532 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 12 predicate places. [2023-01-28 08:31:22,532 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 127 flow [2023-01-28 08:31:22,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:22,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:31:22,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:31:22,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 08:31:22,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:31:22,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:31:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash 656812837, now seen corresponding path program 1 times [2023-01-28 08:31:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:31:22,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701503095] [2023-01-28 08:31:22,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:31:22,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:31:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:31:22,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:22,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:31:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701503095] [2023-01-28 08:31:22,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701503095] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:31:22,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983040507] [2023-01-28 08:31:22,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:31:22,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:31:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:31:22,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:31:22,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 08:31:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:31:23,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 08:31:23,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:31:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:34,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:31:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:31:37,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983040507] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:31:37,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:31:37,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-01-28 08:31:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704503739] [2023-01-28 08:31:37,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:31:37,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 08:31:37,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:31:37,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 08:31:37,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=147, Unknown=4, NotChecked=0, Total=210 [2023-01-28 08:31:37,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 08:31:37,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 127 flow. Second operand has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:31:37,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:31:37,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 08:31:37,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:31:59,022 WARN L222 SmtUtils]: Spent 20.49s on a formula simplification. DAG size of input: 53 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:32:07,415 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 52 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:32:09,565 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 [] [2023-01-28 08:32:21,145 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 [] [2023-01-28 08:32:23,149 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 [] [2023-01-28 08:32:25,208 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 [] [2023-01-28 08:32:27,648 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 [] [2023-01-28 08:32:29,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:32:43,949 WARN L222 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 77 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:32:53,778 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 [] [2023-01-28 08:32:55,332 INFO L130 PetriNetUnfolder]: 122/236 cut-off events. [2023-01-28 08:32:55,332 INFO L131 PetriNetUnfolder]: For 401/401 co-relation queries the response was YES. [2023-01-28 08:32:55,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 236 events. 122/236 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 830 event pairs, 0 based on Foata normal form. 7/243 useless extension candidates. Maximal degree in co-relation 580. Up to 79 conditions per place. [2023-01-28 08:32:55,334 INFO L137 encePairwiseOnDemand]: 136/142 looper letters, 53 selfloop transitions, 29 changer transitions 22/104 dead transitions. [2023-01-28 08:32:55,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 104 transitions, 719 flow [2023-01-28 08:32:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 08:32:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 08:32:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1018 transitions. [2023-01-28 08:32:55,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217067108533554 [2023-01-28 08:32:55,337 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1018 transitions. [2023-01-28 08:32:55,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1018 transitions. [2023-01-28 08:32:55,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:32:55,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1018 transitions. [2023-01-28 08:32:55,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 59.88235294117647) internal successors, (1018), 17 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:32:55,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:32:55,342 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 142.0) internal successors, (2556), 18 states have internal predecessors, (2556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:32:55,342 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 127 flow. Second operand 17 states and 1018 transitions. [2023-01-28 08:32:55,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 104 transitions, 719 flow [2023-01-28 08:32:55,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 104 transitions, 692 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-01-28 08:32:55,346 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 403 flow [2023-01-28 08:32:55,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=403, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-01-28 08:32:55,346 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 33 predicate places. [2023-01-28 08:32:55,346 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 403 flow [2023-01-28 08:32:55,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:32:55,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:32:55,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:32:55,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 08:32:55,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-28 08:32:55,551 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:32:55,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:32:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1905891163, now seen corresponding path program 2 times [2023-01-28 08:32:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:32:55,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255848416] [2023-01-28 08:32:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:32:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:32:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:32:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:32:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:32:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255848416] [2023-01-28 08:32:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255848416] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:32:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744679780] [2023-01-28 08:32:55,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:32:55,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:32:55,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:32:55,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:32:55,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 08:32:55,929 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:32:55,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:32:55,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 08:32:55,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:33:06,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:33:06,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:33:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:33:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744679780] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:33:07,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:33:07,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-01-28 08:33:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785819817] [2023-01-28 08:33:07,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:33:07,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 08:33:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:33:07,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 08:33:07,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=150, Unknown=1, NotChecked=0, Total=210 [2023-01-28 08:33:07,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 142 [2023-01-28 08:33:07,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 403 flow. Second operand has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:33:07,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:33:07,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 142 [2023-01-28 08:33:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:33:10,516 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 [] [2023-01-28 08:33:12,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:33:22,201 WARN L222 SmtUtils]: Spent 5.75s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:33:24,296 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 [] [2023-01-28 08:33:34,292 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 [] [2023-01-28 08:33:46,601 WARN L222 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 83 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:33:49,271 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 [] [2023-01-28 08:33:51,279 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 [] [2023-01-28 08:34:01,076 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 [] [2023-01-28 08:34:02,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:34:06,729 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 [] [2023-01-28 08:34:08,646 INFO L130 PetriNetUnfolder]: 199/392 cut-off events. [2023-01-28 08:34:08,646 INFO L131 PetriNetUnfolder]: For 1001/1001 co-relation queries the response was YES. [2023-01-28 08:34:08,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 392 events. 199/392 cut-off events. For 1001/1001 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1683 event pairs, 14 based on Foata normal form. 5/397 useless extension candidates. Maximal degree in co-relation 1769. Up to 185 conditions per place. [2023-01-28 08:34:08,649 INFO L137 encePairwiseOnDemand]: 136/142 looper letters, 94 selfloop transitions, 34 changer transitions 13/141 dead transitions. [2023-01-28 08:34:08,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 141 transitions, 1210 flow [2023-01-28 08:34:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 08:34:08,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 08:34:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1086 transitions. [2023-01-28 08:34:08,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42488262910798125 [2023-01-28 08:34:08,653 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1086 transitions. [2023-01-28 08:34:08,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1086 transitions. [2023-01-28 08:34:08,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:34:08,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1086 transitions. [2023-01-28 08:34:08,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 60.333333333333336) internal successors, (1086), 18 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:08,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 142.0) internal successors, (2698), 19 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:08,660 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 142.0) internal successors, (2698), 19 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:08,660 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 403 flow. Second operand 18 states and 1086 transitions. [2023-01-28 08:34:08,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 141 transitions, 1210 flow [2023-01-28 08:34:08,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 141 transitions, 972 flow, removed 115 selfloop flow, removed 4 redundant places. [2023-01-28 08:34:08,670 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 607 flow [2023-01-28 08:34:08,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=607, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2023-01-28 08:34:08,670 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 55 predicate places. [2023-01-28 08:34:08,670 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 607 flow [2023-01-28 08:34:08,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.333333333333336) internal successors, (845), 15 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:08,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:34:08,671 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:34:08,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 08:34:08,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:34:08,876 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:34:08,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:34:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash -977596715, now seen corresponding path program 3 times [2023-01-28 08:34:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:34:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317737495] [2023-01-28 08:34:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:34:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:34:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:34:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:34:08,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:34:08,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317737495] [2023-01-28 08:34:08,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317737495] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:34:08,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759793314] [2023-01-28 08:34:08,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:34:08,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:34:08,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:34:08,987 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:34:08,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 08:34:10,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:34:10,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:34:10,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-01-28 08:34:10,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:34:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:34:10,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:34:10,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759793314] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:34:10,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:34:10,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2023-01-28 08:34:10,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341760022] [2023-01-28 08:34:10,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:34:10,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:34:10,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:34:10,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:34:10,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-01-28 08:34:10,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 142 [2023-01-28 08:34:10,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:10,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:34:10,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 142 [2023-01-28 08:34:10,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:34:10,658 INFO L130 PetriNetUnfolder]: 115/227 cut-off events. [2023-01-28 08:34:10,659 INFO L131 PetriNetUnfolder]: For 1019/1019 co-relation queries the response was YES. [2023-01-28 08:34:10,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 227 events. 115/227 cut-off events. For 1019/1019 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 811 event pairs, 24 based on Foata normal form. 4/231 useless extension candidates. Maximal degree in co-relation 1152. Up to 223 conditions per place. [2023-01-28 08:34:10,660 INFO L137 encePairwiseOnDemand]: 139/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-01-28 08:34:10,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 543 flow [2023-01-28 08:34:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:34:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:34:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2023-01-28 08:34:10,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.431924882629108 [2023-01-28 08:34:10,661 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 184 transitions. [2023-01-28 08:34:10,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 184 transitions. [2023-01-28 08:34:10,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:34:10,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 184 transitions. [2023-01-28 08:34:10,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:10,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:10,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:10,662 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 607 flow. Second operand 3 states and 184 transitions. [2023-01-28 08:34:10,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 543 flow [2023-01-28 08:34:10,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 388 flow, removed 70 selfloop flow, removed 8 redundant places. [2023-01-28 08:34:10,666 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 292 flow [2023-01-28 08:34:10,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-01-28 08:34:10,667 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 35 predicate places. [2023-01-28 08:34:10,667 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 292 flow [2023-01-28 08:34:10,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:34:10,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:34:10,667 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:34:10,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 08:34:10,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:34:10,873 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:34:10,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:34:10,874 INFO L85 PathProgramCache]: Analyzing trace with hash 906094592, now seen corresponding path program 4 times [2023-01-28 08:34:10,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:34:10,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186283103] [2023-01-28 08:34:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:34:10,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:34:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:34:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:34:12,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:34:12,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186283103] [2023-01-28 08:34:12,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186283103] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:34:12,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447513623] [2023-01-28 08:34:12,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:34:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:34:12,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:34:12,087 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:34:12,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 08:35:20,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:35:20,595 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:35:20,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-01-28 08:35:20,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:35:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:35:28,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:36:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:36:19,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447513623] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:36:19,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:36:19,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 16 [2023-01-28 08:36:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761309197] [2023-01-28 08:36:19,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:36:19,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-28 08:36:19,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:36:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-28 08:36:19,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=200, Unknown=12, NotChecked=0, Total=272 [2023-01-28 08:36:19,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2023-01-28 08:36:19,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 292 flow. Second operand has 17 states, 17 states have (on average 51.23529411764706) internal successors, (871), 17 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:36:19,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:36:19,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2023-01-28 08:36:19,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:36:25,951 WARN L222 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 61 DAG size of output: 15 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:36:27,983 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 [] [2023-01-28 08:36:32,083 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 [] [2023-01-28 08:36:34,465 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 [] [2023-01-28 08:36:35,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:36:48,304 WARN L222 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:36:50,308 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 [] [2023-01-28 08:36:52,379 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 [] [2023-01-28 08:38:07,975 WARN L222 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 93 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:38:09,984 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 [] [2023-01-28 08:38:21,065 WARN L222 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 58 DAG size of output: 12 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:38:23,158 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 [] [2023-01-28 08:38:25,669 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 [] [2023-01-28 08:38:28,708 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 [] [2023-01-28 08:38:31,666 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 [] [2023-01-28 08:38:34,801 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 [] [2023-01-28 08:38:40,964 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 [] [2023-01-28 08:38:43,191 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 [] [2023-01-28 08:38:45,205 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 [] [2023-01-28 08:38:47,283 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 [] [2023-01-28 08:38:49,354 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 [] [2023-01-28 08:38:50,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:38:52,972 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 [] [2023-01-28 08:38:55,261 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 [] [2023-01-28 08:38:57,467 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 [] [2023-01-28 08:38:59,471 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 [] [2023-01-28 08:39:02,246 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 [] [2023-01-28 08:39:03,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:39:05,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:39:09,221 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 [] [2023-01-28 08:39:12,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 [] [2023-01-28 08:39:31,292 WARN L222 SmtUtils]: Spent 10.49s on a formula simplification. DAG size of input: 75 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:39:40,327 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 [] [2023-01-28 08:39:42,334 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 [] [2023-01-28 08:39:44,346 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 [] [2023-01-28 08:39:46,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 [] [2023-01-28 08:39:48,900 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 [] [2023-01-28 08:39:50,913 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 [] [2023-01-28 08:39:52,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:39:54,185 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 [] [2023-01-28 08:39:56,223 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 [] [2023-01-28 08:39:58,231 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 [] [2023-01-28 08:40:00,447 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 [] [2023-01-28 08:40:02,479 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 [] [2023-01-28 08:40:04,483 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 [] [2023-01-28 08:40:06,488 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 [] [2023-01-28 08:40:08,495 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 [] [2023-01-28 08:40:09,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:40:11,671 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 [] [2023-01-28 08:40:13,879 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 [] [2023-01-28 08:40:44,132 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 [] [2023-01-28 08:40:46,199 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 [] [2023-01-28 08:40:48,205 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 [] [2023-01-28 08:40:50,242 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 [] [2023-01-28 08:40:52,249 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 [] [2023-01-28 08:40:54,259 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 [] [2023-01-28 08:40:56,267 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 [] [2023-01-28 08:40:58,270 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 [] [2023-01-28 08:40:59,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:42:09,965 WARN L222 SmtUtils]: Spent 42.82s on a formula simplification. DAG size of input: 107 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:42:12,006 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 [] [2023-01-28 08:42:14,058 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 [] [2023-01-28 08:42:16,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:42:17,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:42:27,319 WARN L222 SmtUtils]: Spent 9.43s on a formula simplification. DAG size of input: 70 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:42:29,517 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 [] [2023-01-28 08:42:31,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:42:34,358 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 [] [2023-01-28 08:42:36,368 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 [] [2023-01-28 08:42:37,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-28 08:42:39,684 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 [] [2023-01-28 08:44:38,917 WARN L222 SmtUtils]: Spent 1.60m on a formula simplification. DAG size of input: 58 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:44:40,928 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 [] [2023-01-28 08:44:42,939 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 [] [2023-01-28 08:44:44,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:44:46,094 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 [] [2023-01-28 08:44:48,175 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 [] [2023-01-28 08:44:50,206 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 [] [2023-01-28 08:44:52,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:44:54,240 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 [] [2023-01-28 08:44:56,351 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 [] [2023-01-28 08:44:58,506 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 [] [2023-01-28 08:45:00,871 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 [] [2023-01-28 08:45:17,074 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 [] [2023-01-28 08:45:19,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:45:33,785 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 [] [2023-01-28 08:45:35,790 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 [] [2023-01-28 08:45:37,860 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 [] [2023-01-28 08:45:40,044 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 [] [2023-01-28 08:45:42,785 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 [] [2023-01-28 08:45:44,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 [] [2023-01-28 08:45:46,794 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 [] [2023-01-28 08:45:51,857 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 [] [2023-01-28 08:45:53,879 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 [] [2023-01-28 08:45:56,011 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 [] [2023-01-28 08:45:57,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-28 08:45:59,595 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 [] [2023-01-28 08:46:03,333 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 [] Received shutdown request... [2023-01-28 08:46:03,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:46:03,429 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:46:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-28 08:46:03,686 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 08:46:03,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 08:46:03,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:46:03,886 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 49/142 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1963 conditions, 494 events (244/493 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2716 event pairs, 2 based on Foata normal form. 14/536 useless extension candidates. Maximal degree in co-relation 1941. Up to 154 conditions per place.). [2023-01-28 08:46:03,888 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-28 08:46:03,888 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-28 08:46:03,888 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1] [2023-01-28 08:46:03,890 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 08:46:03,890 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 08:46:03,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:46:03 BasicIcfg [2023-01-28 08:46:03,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 08:46:03,893 INFO L158 Benchmark]: Toolchain (without parser) took 885358.99ms. Allocated memory was 828.4MB in the beginning and 1.1GB in the end (delta: 230.7MB). Free memory was 788.4MB in the beginning and 969.2MB in the end (delta: -180.7MB). Peak memory consumption was 50.5MB. Max. memory is 16.0GB. [2023-01-28 08:46:03,893 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 417.3MB. Free memory is still 367.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:46:03,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.61ms. Allocated memory is still 828.4MB. Free memory was 788.1MB in the beginning and 777.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-28 08:46:03,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.35ms. Allocated memory is still 828.4MB. Free memory was 777.5MB in the beginning and 775.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:46:03,896 INFO L158 Benchmark]: Boogie Preprocessor took 24.66ms. Allocated memory is still 828.4MB. Free memory was 775.9MB in the beginning and 774.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:46:03,896 INFO L158 Benchmark]: RCFGBuilder took 234.16ms. Allocated memory is still 828.4MB. Free memory was 774.5MB in the beginning and 762.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 08:46:03,896 INFO L158 Benchmark]: TraceAbstraction took 884899.33ms. Allocated memory was 828.4MB in the beginning and 1.1GB in the end (delta: 230.7MB). Free memory was 762.0MB in the beginning and 969.2MB in the end (delta: -207.2MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. [2023-01-28 08:46:03,897 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.09ms. Allocated memory is still 417.3MB. Free memory is still 367.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 171.61ms. Allocated memory is still 828.4MB. Free memory was 788.1MB in the beginning and 777.5MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 25.35ms. Allocated memory is still 828.4MB. Free memory was 777.5MB in the beginning and 775.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.66ms. Allocated memory is still 828.4MB. Free memory was 775.9MB in the beginning and 774.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 234.16ms. Allocated memory is still 828.4MB. Free memory was 774.5MB in the beginning and 762.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 884899.33ms. Allocated memory was 828.4MB in the beginning and 1.1GB in the end (delta: 230.7MB). Free memory was 762.0MB in the beginning and 969.2MB in the end (delta: -207.2MB). Peak memory consumption was 25.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 68 PlacesBefore, 18 PlacesAfterwards, 67 TransitionsBefore, 13 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 65 TotalNumberOfCompositions, 297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 297, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 49/142 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1963 conditions, 494 events (244/493 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2716 event pairs, 2 based on Foata normal form. 14/536 useless extension candidates. Maximal degree in co-relation 1941. Up to 154 conditions per place.). - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 49/142 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1963 conditions, 494 events (244/493 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2716 event pairs, 2 based on Foata normal form. 14/536 useless extension candidates. Maximal degree in co-relation 1941. Up to 154 conditions per place.). - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (17states, 49/142 universal loopers) in iteration 9,while PetriNetUnfolder was constructing finite prefix that currently has 1963 conditions, 494 events (244/493 cut-off events. For 1809/1809 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2716 event pairs, 2 based on Foata normal form. 14/536 useless extension candidates. Maximal degree in co-relation 1941. Up to 154 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 84 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 884.8s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 723.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 88 mSolverCounterUnknown, 353 SdHoareTripleChecker+Valid, 247.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 246.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1736 IncrementalHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 0 mSDtfsCounter, 1736 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 80 SyntacticMatches, 8 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 533.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=607occurred in iteration=7, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 70.6s SatisfiabilityAnalysisTime, 88.2s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 5466 SizeOfPredicates, 18 NumberOfNonLiveVariables, 548 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 9/38 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