/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/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:28:37,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:28:37,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:28:37,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:28:37,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:28:37,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:28:37,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:28:37,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:28:37,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:28:37,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:28:37,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:28:37,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:28:37,389 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:28:37,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:28:37,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:28:37,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:28:37,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:28:37,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:28:37,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:28:37,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:28:37,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:28:37,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:28:37,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:28:37,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:28:37,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:28:37,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:28:37,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:28:37,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:28:37,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:28:37,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:28:37,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:28:37,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:28:37,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:28:37,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:28:37,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:28:37,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:28:37,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:28:37,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:28:37,408 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:28:37,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:28:37,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:28:37,411 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 06:28:37,428 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:28:37,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:28:37,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:28:37,429 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:28:37,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:28:37,430 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:28:37,430 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:28:37,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:28:37,431 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:28:37,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:28:37,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:28:37,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:28:37,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:28:37,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:28:37,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:28:37,432 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:28:37,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:28:37,432 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:28:37,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:28:37,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:28:37,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:28:37,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:28:37,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:28:37,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:28:37,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:28:37,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:28:37,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:28:37,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:28:37,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:28:37,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:28:37,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:28:37,435 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 06:28:37,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:28:37,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:28:37,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:28:37,678 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:28:37,679 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:28:37,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-01-28 06:28:38,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:28:39,039 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:28:39,039 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-01-28 06:28:39,051 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbfa9d86/25be84c427574a3bac5fab2dba5133fe/FLAG9ee2d90f8 [2023-01-28 06:28:39,062 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbfa9d86/25be84c427574a3bac5fab2dba5133fe [2023-01-28 06:28:39,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:28:39,065 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:28:39,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:28:39,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:28:39,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:28:39,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749d2e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39, skipping insertion in model container [2023-01-28 06:28:39,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:28:39,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:28:39,303 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-01-28 06:28:39,311 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-01-28 06:28:39,317 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:28:39,325 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:28:39,354 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30285,30298] [2023-01-28 06:28:39,357 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30729,30742] [2023-01-28 06:28:39,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:28:39,390 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:28:39,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39 WrapperNode [2023-01-28 06:28:39,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:28:39,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:28:39,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:28:39,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:28:39,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,427 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2023-01-28 06:28:39,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:28:39,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:28:39,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:28:39,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:28:39,435 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,447 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:28:39,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:28:39,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:28:39,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:28:39,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (1/1) ... [2023-01-28 06:28:39,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:28:39,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:28:39,478 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 06:28:39,503 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 06:28:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 06:28:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-01-28 06:28:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-01-28 06:28:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:28:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:28:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:28:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:28:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:28:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:28:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:28:39,525 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 06:28:39,649 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:28:39,651 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:28:39,937 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:28:40,239 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:28:40,239 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 06:28:40,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:28:40 BoogieIcfgContainer [2023-01-28 06:28:40,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:28:40,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:28:40,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:28:40,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:28:40,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:28:39" (1/3) ... [2023-01-28 06:28:40,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686c692f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:28:40, skipping insertion in model container [2023-01-28 06:28:40,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:28:39" (2/3) ... [2023-01-28 06:28:40,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686c692f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:28:40, skipping insertion in model container [2023-01-28 06:28:40,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:28:40" (3/3) ... [2023-01-28 06:28:40,251 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-01-28 06:28:40,268 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:28:40,268 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 06:28:40,268 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:28:40,348 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:28:40,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-01-28 06:28:40,444 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-01-28 06:28:40,444 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:28:40,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-01-28 06:28:40,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-01-28 06:28:40,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-01-28 06:28:40,462 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:28:40,469 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-01-28 06:28:40,472 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-01-28 06:28:40,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-01-28 06:28:40,492 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-01-28 06:28:40,492 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:28:40,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-01-28 06:28:40,498 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-01-28 06:28:43,411 INFO L134 LiptonReduction]: Checked pairs total: 2354 [2023-01-28 06:28:43,411 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-01-28 06:28:43,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:28:43,440 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;@2799301f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:28:43,440 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 06:28:43,447 INFO L130 PetriNetUnfolder]: 1/15 cut-off events. [2023-01-28 06:28:43,447 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:28:43,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:28:43,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 06:28:43,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:28:43,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:28:43,453 INFO L85 PathProgramCache]: Analyzing trace with hash 147063794, now seen corresponding path program 1 times [2023-01-28 06:28:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:28:43,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193763188] [2023-01-28 06:28:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:28:43,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:28:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:28:43,648 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 06:28:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:28:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193763188] [2023-01-28 06:28:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193763188] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:28:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:28:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:28:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637066019] [2023-01-28 06:28:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:28:43,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:28:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:28:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:28:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:28:43,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 182 [2023-01-28 06:28:43,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 27 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 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 06:28:43,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:28:43,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 182 [2023-01-28 06:28:43,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:28:43,742 INFO L130 PetriNetUnfolder]: 43/91 cut-off events. [2023-01-28 06:28:43,743 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:28:43,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 91 events. 43/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 250 event pairs, 28 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 174. Up to 91 conditions per place. [2023-01-28 06:28:43,744 INFO L137 encePairwiseOnDemand]: 179/182 looper letters, 16 selfloop transitions, 0 changer transitions 7/24 dead transitions. [2023-01-28 06:28:43,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 99 flow [2023-01-28 06:28:43,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:28:43,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:28:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-01-28 06:28:43,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2023-01-28 06:28:43,756 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-01-28 06:28:43,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-01-28 06:28:43,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:28:43,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-01-28 06:28:43,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 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 06:28:43,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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 06:28:43,765 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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 06:28:43,767 INFO L175 Difference]: Start difference. First operand has 23 places, 27 transitions, 59 flow. Second operand 2 states and 200 transitions. [2023-01-28 06:28:43,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 99 flow [2023-01-28 06:28:43,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:28:43,770 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 39 flow [2023-01-28 06:28:43,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=39, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-01-28 06:28:43,776 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-01-28 06:28:43,777 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 39 flow [2023-01-28 06:28:43,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.0) internal successors, (180), 2 states have internal predecessors, (180), 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 06:28:43,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:28:43,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:28:43,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:28:43,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:28:43,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:28:43,778 INFO L85 PathProgramCache]: Analyzing trace with hash -405140658, now seen corresponding path program 1 times [2023-01-28 06:28:43,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:28:43,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419410565] [2023-01-28 06:28:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:28:43,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:28:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:28:44,624 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 06:28:44,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:28:44,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419410565] [2023-01-28 06:28:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419410565] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:28:44,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:28:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:28:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174267290] [2023-01-28 06:28:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:28:44,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:28:44,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:28:44,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:28:44,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:28:44,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 182 [2023-01-28 06:28:44,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 39 flow. Second operand has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 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 06:28:44,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:28:44,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 182 [2023-01-28 06:28:44,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:28:44,765 INFO L130 PetriNetUnfolder]: 25/71 cut-off events. [2023-01-28 06:28:44,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:28:44,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 71 events. 25/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 176 event pairs, 2 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2023-01-28 06:28:44,766 INFO L137 encePairwiseOnDemand]: 175/182 looper letters, 20 selfloop transitions, 7 changer transitions 1/29 dead transitions. [2023-01-28 06:28:44,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 29 transitions, 119 flow [2023-01-28 06:28:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:28:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:28:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 394 transitions. [2023-01-28 06:28:44,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3092621664050236 [2023-01-28 06:28:44,772 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 394 transitions. [2023-01-28 06:28:44,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 394 transitions. [2023-01-28 06:28:44,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:28:44,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 394 transitions. [2023-01-28 06:28:44,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 56.285714285714285) internal successors, (394), 7 states have internal predecessors, (394), 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 06:28:44,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 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 06:28:44,779 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 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 06:28:44,779 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 39 flow. Second operand 7 states and 394 transitions. [2023-01-28 06:28:44,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 29 transitions, 119 flow [2023-01-28 06:28:44,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 29 transitions, 119 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:28:44,781 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 64 flow [2023-01-28 06:28:44,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=29, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=64, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2023-01-28 06:28:44,781 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-01-28 06:28:44,782 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 64 flow [2023-01-28 06:28:44,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 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 06:28:44,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:28:44,782 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:28:44,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:28:44,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:28:44,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:28:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -42027423, now seen corresponding path program 1 times [2023-01-28 06:28:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:28:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965392432] [2023-01-28 06:28:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:28:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:28:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:28:45,384 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 06:28:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:28:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965392432] [2023-01-28 06:28:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965392432] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:28:45,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919963408] [2023-01-28 06:28:45,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:28:45,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:28:45,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:28:45,389 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 06:28:45,414 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 06:28:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:28:45,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-28 06:28:45,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:28:45,668 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-01-28 06:28:45,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-01-28 06:28:45,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:28:45,894 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-28 06:28:45,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 06:28:46,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:28:46,152 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2023-01-28 06:28:46,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 120 [2023-01-28 06:28:46,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-01-28 06:28:46,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:28:46,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:28:46,292 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-01-28 06:28:46,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 33 [2023-01-28 06:28:46,346 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:28:46,348 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2023-01-28 06:28:46,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:28:46,453 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 06:28:46,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:28:46,520 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_85 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_85))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) is different from false [2023-01-28 06:28:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 06:28:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919963408] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:28:49,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:28:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2023-01-28 06:28:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055632425] [2023-01-28 06:28:49,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:28:49,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-28 06:28:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:28:49,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-28 06:28:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=242, Unknown=8, NotChecked=32, Total=342 [2023-01-28 06:28:49,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 182 [2023-01-28 06:28:49,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 64 flow. Second operand has 19 states, 19 states have (on average 51.578947368421055) internal successors, (980), 19 states have internal predecessors, (980), 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 06:28:49,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:28:49,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 182 [2023-01-28 06:28:49,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:28:59,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:29:01,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:29:04,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:29:05,111 INFO L130 PetriNetUnfolder]: 33/95 cut-off events. [2023-01-28 06:29:05,111 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-01-28 06:29:05,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 95 events. 33/95 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 289 event pairs, 0 based on Foata normal form. 3/86 useless extension candidates. Maximal degree in co-relation 252. Up to 36 conditions per place. [2023-01-28 06:29:05,112 INFO L137 encePairwiseOnDemand]: 173/182 looper letters, 20 selfloop transitions, 19 changer transitions 4/44 dead transitions. [2023-01-28 06:29:05,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 229 flow [2023-01-28 06:29:05,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 06:29:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 06:29:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 696 transitions. [2023-01-28 06:29:05,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.294167371090448 [2023-01-28 06:29:05,115 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 696 transitions. [2023-01-28 06:29:05,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 696 transitions. [2023-01-28 06:29:05,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:05,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 696 transitions. [2023-01-28 06:29:05,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 53.53846153846154) internal successors, (696), 13 states have internal predecessors, (696), 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 06:29:05,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 182.0) internal successors, (2548), 14 states have internal predecessors, (2548), 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 06:29:05,122 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 182.0) internal successors, (2548), 14 states have internal predecessors, (2548), 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 06:29:05,122 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 64 flow. Second operand 13 states and 696 transitions. [2023-01-28 06:29:05,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 229 flow [2023-01-28 06:29:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 44 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:29:05,124 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 189 flow [2023-01-28 06:29:05,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=189, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-01-28 06:29:05,125 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 16 predicate places. [2023-01-28 06:29:05,125 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 189 flow [2023-01-28 06:29:05,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 51.578947368421055) internal successors, (980), 19 states have internal predecessors, (980), 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 06:29:05,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:05,126 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:05,131 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 06:29:05,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:05,329 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:05,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 253294844, now seen corresponding path program 1 times [2023-01-28 06:29:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:05,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35067020] [2023-01-28 06:29:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:29:06,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:06,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35067020] [2023-01-28 06:29:06,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35067020] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:29:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013249115] [2023-01-28 06:29:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:06,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:06,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:06,285 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 06:29:06,289 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 06:29:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:06,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 60 conjunts are in the unsatisfiable core [2023-01-28 06:29:06,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:29:06,697 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-01-28 06:29:06,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-01-28 06:29:06,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:29:06,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:29:06,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:29:06,852 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:29:06,907 INFO L321 Elim1Store]: treesize reduction 57, result has 12.3 percent of original size [2023-01-28 06:29:06,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 100 treesize of output 99 [2023-01-28 06:29:06,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:29:06,973 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:29:06,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:29:06,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2023-01-28 06:29:07,137 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:07,138 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2023-01-28 06:29:07,252 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:07,253 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2023-01-28 06:29:07,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-01-28 06:29:07,321 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-01-28 06:29:07,365 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:07,366 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 129 [2023-01-28 06:29:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:29:07,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:29:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013249115] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:07,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:29:07,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-01-28 06:29:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089507636] [2023-01-28 06:29:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:07,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:29:07,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:07,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:29:07,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-01-28 06:29:07,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 182 [2023-01-28 06:29:07,673 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 189 flow. Second operand has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 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 06:29:07,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:07,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 182 [2023-01-28 06:29:07,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:07,795 INFO L130 PetriNetUnfolder]: 7/42 cut-off events. [2023-01-28 06:29:07,796 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2023-01-28 06:29:07,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 42 events. 7/42 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 98 event pairs, 1 based on Foata normal form. 5/47 useless extension candidates. Maximal degree in co-relation 174. Up to 14 conditions per place. [2023-01-28 06:29:07,796 INFO L137 encePairwiseOnDemand]: 176/182 looper letters, 11 selfloop transitions, 11 changer transitions 2/25 dead transitions. [2023-01-28 06:29:07,796 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 25 transitions, 216 flow [2023-01-28 06:29:07,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:29:07,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:29:07,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 409 transitions. [2023-01-28 06:29:07,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37454212454212454 [2023-01-28 06:29:07,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 409 transitions. [2023-01-28 06:29:07,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 409 transitions. [2023-01-28 06:29:07,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:07,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 409 transitions. [2023-01-28 06:29:07,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 68.16666666666667) internal successors, (409), 6 states have internal predecessors, (409), 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 06:29:07,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 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 06:29:07,802 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 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 06:29:07,802 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 189 flow. Second operand 6 states and 409 transitions. [2023-01-28 06:29:07,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 25 transitions, 216 flow [2023-01-28 06:29:07,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 156 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-01-28 06:29:07,804 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 134 flow [2023-01-28 06:29:07,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2023-01-28 06:29:07,807 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2023-01-28 06:29:07,807 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 134 flow [2023-01-28 06:29:07,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 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 06:29:07,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:07,807 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:07,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 06:29:08,008 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,SelfDestructingSolverStorable3 [2023-01-28 06:29:08,009 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:29:08,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1480454311, now seen corresponding path program 2 times [2023-01-28 06:29:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:08,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315784103] [2023-01-28 06:29:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:08,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:08,977 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 06:29:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315784103] [2023-01-28 06:29:08,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315784103] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:29:08,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280778639] [2023-01-28 06:29:08,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:29:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:08,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:08,982 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 06:29:08,984 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 06:29:09,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 06:29:09,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:29:09,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 88 conjunts are in the unsatisfiable core [2023-01-28 06:29:09,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:29:09,173 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-28 06:29:09,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-28 06:29:09,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:29:09,322 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-28 06:29:09,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 06:29:09,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:09,681 INFO L321 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-01-28 06:29:09,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 358 [2023-01-28 06:29:09,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:29:09,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:29:09,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-01-28 06:29:09,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:29:09,860 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:09,861 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 340 [2023-01-28 06:29:09,956 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:09,958 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 384 [2023-01-28 06:29:10,076 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:10,079 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 502 [2023-01-28 06:29:10,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:10,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 24 [2023-01-28 06:29:10,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:10,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:10,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 22 [2023-01-28 06:29:10,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 64 [2023-01-28 06:29:10,898 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:10,899 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 161 [2023-01-28 06:29:10,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:29:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:29:11,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:29:11,407 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_273 (Array Int Int))) (or (= 0 (mod (select v_ArrVal_273 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_273) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) is different from false [2023-01-28 06:29:11,757 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_267 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_267))) (or (< 0 (mod (select (select .cse1 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (= 0 (mod (select v_ArrVal_273 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse1 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_273) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))))) (or (not .cse0) (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| Int) (v_ArrVal_267 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| v_ArrVal_262) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| v_ArrVal_264) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~flag#1.base_12| v_ArrVal_260) |c_~#value~0.base| v_ArrVal_263) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_267))) (or (< (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296) (mod (select (select (store .cse2 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_273) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= 0 (mod (select v_ArrVal_273 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)) (< 0 (mod (select (select .cse2 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296)))))))) is different from false [2023-01-28 06:29:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-28 06:29:12,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280778639] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:29:12,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:29:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 10] total 24 [2023-01-28 06:29:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222094486] [2023-01-28 06:29:12,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:29:12,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 06:29:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:12,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 06:29:12,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=418, Unknown=16, NotChecked=86, Total=600 [2023-01-28 06:29:12,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 182 [2023-01-28 06:29:12,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 134 flow. Second operand has 25 states, 25 states have (on average 52.56) internal successors, (1314), 25 states have internal predecessors, (1314), 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 06:29:12,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:12,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 182 [2023-01-28 06:29:12,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:12,875 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2023-01-28 06:29:12,876 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-01-28 06:29:12,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 34 events. 6/34 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 79 event pairs, 1 based on Foata normal form. 2/36 useless extension candidates. Maximal degree in co-relation 130. Up to 15 conditions per place. [2023-01-28 06:29:12,876 INFO L137 encePairwiseOnDemand]: 177/182 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2023-01-28 06:29:12,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 17 transitions, 131 flow [2023-01-28 06:29:12,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:29:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:29:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 321 transitions. [2023-01-28 06:29:12,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29395604395604397 [2023-01-28 06:29:12,879 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 321 transitions. [2023-01-28 06:29:12,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 321 transitions. [2023-01-28 06:29:12,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:12,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 321 transitions. [2023-01-28 06:29:12,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 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 06:29:12,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 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 06:29:12,882 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 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 06:29:12,882 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 134 flow. Second operand 6 states and 321 transitions. [2023-01-28 06:29:12,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 17 transitions, 131 flow [2023-01-28 06:29:12,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 17 transitions, 116 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-01-28 06:29:12,883 INFO L231 Difference]: Finished difference. Result has 29 places, 0 transitions, 0 flow [2023-01-28 06:29:12,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=29, PETRI_TRANSITIONS=0} [2023-01-28 06:29:12,884 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2023-01-28 06:29:12,884 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 0 transitions, 0 flow [2023-01-28 06:29:12,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 52.56) internal successors, (1314), 25 states have internal predecessors, (1314), 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 06:29:12,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 06:29:12,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 06:29:12,887 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 06:29:12,888 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 06:29:12,901 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 06:29:13,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:13,102 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-01-28 06:29:13,104 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-01-28 06:29:13,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-01-28 06:29:13,116 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-01-28 06:29:13,117 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:13,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-01-28 06:29:13,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-01-28 06:29:13,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-01-28 06:29:13,121 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:29:13,121 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-01-28 06:29:13,121 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-01-28 06:29:13,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-01-28 06:29:13,128 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-01-28 06:29:13,129 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:13,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 9/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2023-01-28 06:29:13,130 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-01-28 06:29:16,951 INFO L134 LiptonReduction]: Checked pairs total: 2357 [2023-01-28 06:29:16,951 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-01-28 06:29:16,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 06:29:16,953 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;@2799301f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:29:16,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 06:29:16,956 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2023-01-28 06:29:16,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:16,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:16,956 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-01-28 06:29:16,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 06:29:16,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:16,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1668209586, now seen corresponding path program 1 times [2023-01-28 06:29:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554251421] [2023-01-28 06:29:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:16,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:29:16,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:29:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:29:16,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:29:16,994 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:29:16,994 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 06:29:16,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:29:16,995 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-01-28 06:29:16,995 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 06:29:16,996 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 06:29:16,996 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 06:29:17,045 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:29:17,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-01-28 06:29:17,066 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-01-28 06:29:17,066 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:29:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-01-28 06:29:17,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 340 flow [2023-01-28 06:29:17,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 340 flow [2023-01-28 06:29:17,069 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:29:17,070 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 340 flow [2023-01-28 06:29:17,070 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 164 transitions, 340 flow [2023-01-28 06:29:17,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-01-28 06:29:17,096 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-01-28 06:29:17,096 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 06:29:17,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 17/186 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 590 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 142. Up to 6 conditions per place. [2023-01-28 06:29:17,102 INFO L119 LiptonReduction]: Number of co-enabled transitions 11960 [2023-01-28 06:29:23,269 INFO L134 LiptonReduction]: Checked pairs total: 17927 [2023-01-28 06:29:23,269 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-01-28 06:29:23,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:29:23,271 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;@2799301f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:29:23,271 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-28 06:29:23,273 INFO L130 PetriNetUnfolder]: 1/15 cut-off events. [2023-01-28 06:29:23,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:29:23,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:23,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 06:29:23,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 06:29:23,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash 742146531, now seen corresponding path program 1 times [2023-01-28 06:29:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:23,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305070407] [2023-01-28 06:29:23,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:23,286 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 06:29:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:23,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305070407] [2023-01-28 06:29:23,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305070407] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:23,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:29:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189491334] [2023-01-28 06:29:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:23,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:29:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:23,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:29:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:29:23,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2023-01-28 06:29:23,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 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 06:29:23,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:23,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2023-01-28 06:29:23,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:23,544 INFO L130 PetriNetUnfolder]: 1065/1643 cut-off events. [2023-01-28 06:29:23,544 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-01-28 06:29:23,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3328 conditions, 1643 events. 1065/1643 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 8582 event pairs, 735 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 770. Up to 1612 conditions per place. [2023-01-28 06:29:23,552 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-01-28 06:29:23,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2023-01-28 06:29:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:29:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:29:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-01-28 06:29:23,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2023-01-28 06:29:23,554 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-01-28 06:29:23,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-01-28 06:29:23,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:23,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-01-28 06:29:23,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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 06:29:23,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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 06:29:23,557 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 306.0) internal successors, (918), 3 states have internal predecessors, (918), 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 06:29:23,557 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 337 transitions. [2023-01-28 06:29:23,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2023-01-28 06:29:23,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-28 06:29:23,559 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2023-01-28 06:29:23,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2023-01-28 06:29:23,561 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-01-28 06:29:23,561 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2023-01-28 06:29:23,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 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 06:29:23,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:23,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:23,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:29:23,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 06:29:23,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash 240118255, now seen corresponding path program 1 times [2023-01-28 06:29:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399827809] [2023-01-28 06:29:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:23,990 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 06:29:23,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:23,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399827809] [2023-01-28 06:29:23,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399827809] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:29:23,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:29:23,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:29:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994585905] [2023-01-28 06:29:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:29:23,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:29:23,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:23,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:29:23,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:29:23,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 306 [2023-01-28 06:29:23,994 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 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 06:29:23,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:23,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 306 [2023-01-28 06:29:23,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:25,022 INFO L130 PetriNetUnfolder]: 1481/2320 cut-off events. [2023-01-28 06:29:25,022 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-01-28 06:29:25,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4698 conditions, 2320 events. 1481/2320 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 13068 event pairs, 223 based on Foata normal form. 0/1698 useless extension candidates. Maximal degree in co-relation 4693. Up to 1346 conditions per place. [2023-01-28 06:29:25,036 INFO L137 encePairwiseOnDemand]: 289/306 looper letters, 121 selfloop transitions, 32 changer transitions 4/160 dead transitions. [2023-01-28 06:29:25,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 160 transitions, 674 flow [2023-01-28 06:29:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-28 06:29:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-01-28 06:29:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1261 transitions. [2023-01-28 06:29:25,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3746286393345217 [2023-01-28 06:29:25,041 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1261 transitions. [2023-01-28 06:29:25,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1261 transitions. [2023-01-28 06:29:25,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:29:25,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1261 transitions. [2023-01-28 06:29:25,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.63636363636364) internal successors, (1261), 11 states have internal predecessors, (1261), 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 06:29:25,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 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 06:29:25,050 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 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 06:29:25,050 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 11 states and 1261 transitions. [2023-01-28 06:29:25,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 160 transitions, 674 flow [2023-01-28 06:29:25,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 160 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:29:25,056 INFO L231 Difference]: Finished difference. Result has 61 places, 79 transitions, 332 flow [2023-01-28 06:29:25,056 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=332, PETRI_PLACES=61, PETRI_TRANSITIONS=79} [2023-01-28 06:29:25,058 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places. [2023-01-28 06:29:25,058 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 79 transitions, 332 flow [2023-01-28 06:29:25,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 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 06:29:25,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:29:25,058 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:29:25,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:29:25,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 06:29:25,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:29:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2055155924, now seen corresponding path program 1 times [2023-01-28 06:29:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:29:25,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624992757] [2023-01-28 06:29:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:29:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:25,616 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 06:29:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:29:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624992757] [2023-01-28 06:29:25,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624992757] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:29:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179167068] [2023-01-28 06:29:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:29:25,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:29:25,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:29:25,619 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 06:29:25,625 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 06:29:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:29:25,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 61 conjunts are in the unsatisfiable core [2023-01-28 06:29:25,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:29:25,805 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-01-28 06:29:25,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-01-28 06:29:25,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:29:25,964 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-28 06:29:25,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 06:29:26,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:26,196 INFO L321 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2023-01-28 06:29:26,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 120 [2023-01-28 06:29:26,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-01-28 06:29:26,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:29:26,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:26,281 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-01-28 06:29:26,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 33 [2023-01-28 06:29:26,349 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:29:26,350 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2023-01-28 06:29:26,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:26,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:29:26,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2023-01-28 06:29:26,583 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 06:29:26,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:29:26,659 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_365 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (< (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) is different from false [2023-01-28 06:29:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 06:29:29,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179167068] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:29:29,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:29:29,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2023-01-28 06:29:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966395072] [2023-01-28 06:29:29,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:29:29,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-28 06:29:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:29:29,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-28 06:29:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=236, Unknown=14, NotChecked=32, Total=342 [2023-01-28 06:29:29,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 306 [2023-01-28 06:29:29,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 79 transitions, 332 flow. Second operand has 19 states, 19 states have (on average 98.42105263157895) internal successors, (1870), 19 states have internal predecessors, (1870), 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 06:29:29,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:29:29,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 306 [2023-01-28 06:29:29,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:29:35,015 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse4 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse1 (mod .cse11 4294967296))) (let ((.cse5 (= .cse4 .cse1)) (.cse2 (+ 1 .cse11))) (and (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))) (or (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse4 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse5) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| Int) (v_ArrVal_358 (Array Int Int)) (|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_358))) (let ((.cse7 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse6 (store (store (store (store .cse8 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store .cse8 |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse7 1))) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (< (mod .cse7 4294967296) (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))))) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse9 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (< .cse4 (mod (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|) (not (= (mod (select (select .cse9 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (not .cse5)) (forall ((|v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| Int)) (or (not (= (select |c_#valid| |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse10 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| .cse2)) |v_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base_65| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse10 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))))))))) is different from false [2023-01-28 06:29:40,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:29:44,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:29:48,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:00,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:30:02,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:30:04,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:30:07,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:30:07,181 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse4 (mod |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse1 (mod .cse2 4294967296))) (let ((.cse5 (= .cse4 .cse1))) (and (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse2))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse0 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse1 (mod (select (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|)))) (or (forall ((v_ArrVal_364 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse4 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) .cse5) (or (forall ((|v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| Int) (v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_365 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_360) |c_~#value~0.base| (store (select (store |c_#memory_int| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11| v_ArrVal_361) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of2ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_362) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_365))) (or (< .cse4 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< |c_~#inc_flag~0.base| |v_thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~flag#1.base_11|) (not (= (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))))) (not .cse5)))))) is different from false [2023-01-28 06:30:20,970 WARN L222 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 95 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:30:23,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:25,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:27,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:29,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:32,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:36,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:38,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:40,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:42,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:45,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:30:54,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:30:57,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:31:05,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:08,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:31:09,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:31:11,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:14,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:31:16,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:31:17,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:27,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:29,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:31,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:33,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:35,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:39,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:46,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:48,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:50,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:52,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:55,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:57,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:59,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:31:59,954 INFO L130 PetriNetUnfolder]: 2611/4343 cut-off events. [2023-01-28 06:31:59,955 INFO L131 PetriNetUnfolder]: For 10890/10890 co-relation queries the response was YES. [2023-01-28 06:31:59,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14580 conditions, 4343 events. 2611/4343 cut-off events. For 10890/10890 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 28511 event pairs, 191 based on Foata normal form. 167/3994 useless extension candidates. Maximal degree in co-relation 14566. Up to 1699 conditions per place. [2023-01-28 06:31:59,983 INFO L137 encePairwiseOnDemand]: 272/306 looper letters, 228 selfloop transitions, 249 changer transitions 28/508 dead transitions. [2023-01-28 06:31:59,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 508 transitions, 3248 flow [2023-01-28 06:31:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-01-28 06:31:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-01-28 06:31:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4505 transitions. [2023-01-28 06:31:59,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35907859078590787 [2023-01-28 06:31:59,995 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4505 transitions. [2023-01-28 06:31:59,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4505 transitions. [2023-01-28 06:31:59,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:31:59,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4505 transitions. [2023-01-28 06:32:00,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 109.8780487804878) internal successors, (4505), 41 states have internal predecessors, (4505), 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 06:32:00,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 306.0) internal successors, (12852), 42 states have internal predecessors, (12852), 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 06:32:00,022 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 306.0) internal successors, (12852), 42 states have internal predecessors, (12852), 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 06:32:00,022 INFO L175 Difference]: Start difference. First operand has 61 places, 79 transitions, 332 flow. Second operand 41 states and 4505 transitions. [2023-01-28 06:32:00,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 508 transitions, 3248 flow [2023-01-28 06:32:00,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 508 transitions, 3248 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:32:00,048 INFO L231 Difference]: Finished difference. Result has 133 places, 331 transitions, 2863 flow [2023-01-28 06:32:00,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2863, PETRI_PLACES=133, PETRI_TRANSITIONS=331} [2023-01-28 06:32:00,051 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 90 predicate places. [2023-01-28 06:32:00,051 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 331 transitions, 2863 flow [2023-01-28 06:32:00,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 98.42105263157895) internal successors, (1870), 19 states have internal predecessors, (1870), 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 06:32:00,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:32:00,052 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:32:00,059 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 06:32:00,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:32:00,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 06:32:00,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:32:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2046340547, now seen corresponding path program 1 times [2023-01-28 06:32:00,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:32:00,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851731593] [2023-01-28 06:32:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:32:00,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:32:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:32:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:32:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:32:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851731593] [2023-01-28 06:32:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851731593] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:32:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979577874] [2023-01-28 06:32:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:32:01,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:32:01,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:32:01,074 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 06:32:01,076 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 06:32:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:32:01,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 64 conjunts are in the unsatisfiable core [2023-01-28 06:32:01,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:32:01,626 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-01-28 06:32:01,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2023-01-28 06:32:01,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:32:01,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:32:01,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-01-28 06:32:01,760 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:01,761 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2023-01-28 06:32:01,932 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:01,933 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2023-01-28 06:32:02,216 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:02,217 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 115 [2023-01-28 06:32:02,327 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:02,328 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 145 [2023-01-28 06:32:02,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-01-28 06:32:02,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:02,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:02,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 34 [2023-01-28 06:32:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:32:02,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 06:32:02,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979577874] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:32:02,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 06:32:02,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2023-01-28 06:32:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445363678] [2023-01-28 06:32:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:32:02,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:32:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:32:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:32:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2023-01-28 06:32:02,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 306 [2023-01-28 06:32:02,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 331 transitions, 2863 flow. Second operand has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 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 06:32:02,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:32:02,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 306 [2023-01-28 06:32:02,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:32:04,041 INFO L130 PetriNetUnfolder]: 2933/4907 cut-off events. [2023-01-28 06:32:04,041 INFO L131 PetriNetUnfolder]: For 57590/57686 co-relation queries the response was YES. [2023-01-28 06:32:04,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29225 conditions, 4907 events. 2933/4907 cut-off events. For 57590/57686 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 33021 event pairs, 457 based on Foata normal form. 87/4592 useless extension candidates. Maximal degree in co-relation 29179. Up to 2549 conditions per place. [2023-01-28 06:32:04,102 INFO L137 encePairwiseOnDemand]: 295/306 looper letters, 337 selfloop transitions, 95 changer transitions 11/446 dead transitions. [2023-01-28 06:32:04,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 446 transitions, 4889 flow [2023-01-28 06:32:04,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:32:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:32:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 825 transitions. [2023-01-28 06:32:04,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4493464052287582 [2023-01-28 06:32:04,105 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 825 transitions. [2023-01-28 06:32:04,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 825 transitions. [2023-01-28 06:32:04,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:32:04,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 825 transitions. [2023-01-28 06:32:04,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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 06:32:04,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 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 06:32:04,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 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 06:32:04,110 INFO L175 Difference]: Start difference. First operand has 133 places, 331 transitions, 2863 flow. Second operand 6 states and 825 transitions. [2023-01-28 06:32:04,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 446 transitions, 4889 flow [2023-01-28 06:32:04,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 446 transitions, 4343 flow, removed 260 selfloop flow, removed 5 redundant places. [2023-01-28 06:32:04,342 INFO L231 Difference]: Finished difference. Result has 134 places, 352 transitions, 2865 flow [2023-01-28 06:32:04,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2341, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2865, PETRI_PLACES=134, PETRI_TRANSITIONS=352} [2023-01-28 06:32:04,342 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places. [2023-01-28 06:32:04,342 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 352 transitions, 2865 flow [2023-01-28 06:32:04,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 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 06:32:04,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:32:04,343 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:32:04,348 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 06:32:04,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-28 06:32:04,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 06:32:04,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:32:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash 272482645, now seen corresponding path program 1 times [2023-01-28 06:32:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:32:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910970303] [2023-01-28 06:32:04,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:32:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:32:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:32:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:32:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:32:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910970303] [2023-01-28 06:32:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910970303] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:32:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9619138] [2023-01-28 06:32:05,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:32:05,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:32:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:32:05,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:32:05,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 06:32:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:32:05,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 68 conjunts are in the unsatisfiable core [2023-01-28 06:32:05,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:32:05,427 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-01-28 06:32:05,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-01-28 06:32:05,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:32:05,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:32:05,851 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-28 06:32:05,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 06:32:06,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:06,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:06,398 INFO L321 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-01-28 06:32:06,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 510 [2023-01-28 06:32:06,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:32:06,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 36 [2023-01-28 06:32:06,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:32:06,762 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:06,767 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:06,767 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:06,811 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:06,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:06,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:06,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:06,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 288 [2023-01-28 06:32:06,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-01-28 06:32:06,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:06,949 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:07,029 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:07,043 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:07,052 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:07,061 INFO L217 Elim1Store]: Index analysis took 124 ms [2023-01-28 06:32:07,118 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-01-28 06:32:07,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 172 treesize of output 288 [2023-01-28 06:32:07,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-01-28 06:32:07,341 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:07,342 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 226 [2023-01-28 06:32:07,489 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:07,491 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 447 [2023-01-28 06:32:07,734 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:07,735 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 268 [2023-01-28 06:32:07,859 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:07,861 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 523 [2023-01-28 06:32:08,185 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:08,187 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 743 [2023-01-28 06:32:09,026 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:09,030 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 402 [2023-01-28 06:32:09,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:09,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:09,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 65 [2023-01-28 06:32:09,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-01-28 06:32:09,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2023-01-28 06:32:09,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:09,685 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:09,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:09,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 56 [2023-01-28 06:32:09,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:32:09,924 INFO L321 Elim1Store]: treesize reduction 92, result has 24.6 percent of original size [2023-01-28 06:32:09,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 2751 treesize of output 2425 [2023-01-28 06:32:10,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 538 treesize of output 536 [2023-01-28 06:32:11,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:11,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2023-01-28 06:32:11,107 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,108 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 201 [2023-01-28 06:32:11,169 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:11,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:32:11,205 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-01-28 06:32:11,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 119 [2023-01-28 06:32:11,224 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,224 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 76 [2023-01-28 06:32:11,255 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,256 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 147 [2023-01-28 06:32:11,281 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,281 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2023-01-28 06:32:11,296 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,297 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 129 [2023-01-28 06:32:11,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 63 [2023-01-28 06:32:11,346 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,347 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2023-01-28 06:32:11,372 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,373 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2023-01-28 06:32:11,408 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,409 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 144 [2023-01-28 06:32:11,460 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:32:11,461 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 222 [2023-01-28 06:32:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:32:12,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:32:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:32:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9619138] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:32:13,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:32:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-01-28 06:32:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119082701] [2023-01-28 06:32:13,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:32:13,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-28 06:32:13,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:32:13,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-28 06:32:13,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=303, Unknown=6, NotChecked=0, Total=380 [2023-01-28 06:32:13,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 306 [2023-01-28 06:32:13,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 352 transitions, 2865 flow. Second operand has 20 states, 20 states have (on average 96.5) internal successors, (1930), 20 states have internal predecessors, (1930), 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 06:32:13,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:32:13,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 306 [2023-01-28 06:32:13,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:32:26,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:32:30,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:32:32,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:32:38,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:32:40,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:32:43,082 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 [1] [2023-01-28 06:32:45,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:04,449 WARN L222 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:33:16,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:18,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:20,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:23,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:26,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:27,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:37,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:39,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 [1] [2023-01-28 06:33:41,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:43,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:49,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:51,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:53,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:55,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:33:57,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:34:26,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:34:28,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:34:35,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:34:58,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:35:01,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:35:03,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:35:05,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:35:07,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:35:46,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:35:48,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:35:59,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:02,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:04,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:06,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:08,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:10,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:12,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:14,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:17,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:19,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:21,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:23,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:25,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:27,862 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 [1] [2023-01-28 06:36:30,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:32,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:36:34,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:04,298 WARN L222 SmtUtils]: Spent 9.41s on a formula simplification that was a NOOP. DAG size: 111 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:37:06,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:09,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:11,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:14,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:16,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:18,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:20,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:22,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:24,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:27,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:29,173 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 [1] [2023-01-28 06:37:31,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 06:37:32,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:34,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:37,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:39,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:41,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:43,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:45,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:47,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:49,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:51,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:57,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:37:59,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:02,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:07,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:10,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:12,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:14,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:16,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:18,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:35,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:37,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:41,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:44,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:46,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:50,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:52,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:55,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:57,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:38:59,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:02,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:04,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:06,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:09,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:11,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:14,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:16,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:18,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:20,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:23,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:26,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:28,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:30,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:39:40,892 INFO L130 PetriNetUnfolder]: 5431/9160 cut-off events. [2023-01-28 06:39:40,892 INFO L131 PetriNetUnfolder]: For 102407/102533 co-relation queries the response was YES. [2023-01-28 06:39:40,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54209 conditions, 9160 events. 5431/9160 cut-off events. For 102407/102533 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 67718 event pairs, 358 based on Foata normal form. 241/8668 useless extension candidates. Maximal degree in co-relation 54162. Up to 4451 conditions per place. [2023-01-28 06:39:40,974 INFO L137 encePairwiseOnDemand]: 280/306 looper letters, 702 selfloop transitions, 566 changer transitions 108/1379 dead transitions. [2023-01-28 06:39:40,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 1379 transitions, 15387 flow [2023-01-28 06:39:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-01-28 06:39:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-01-28 06:39:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 4873 transitions. [2023-01-28 06:39:40,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35388525780682645 [2023-01-28 06:39:40,986 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 4873 transitions. [2023-01-28 06:39:40,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 4873 transitions. [2023-01-28 06:39:40,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:39:40,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 4873 transitions. [2023-01-28 06:39:40,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 108.28888888888889) internal successors, (4873), 45 states have internal predecessors, (4873), 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 06:39:41,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 306.0) internal successors, (14076), 46 states have internal predecessors, (14076), 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 06:39:41,011 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 306.0) internal successors, (14076), 46 states have internal predecessors, (14076), 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 06:39:41,011 INFO L175 Difference]: Start difference. First operand has 134 places, 352 transitions, 2865 flow. Second operand 45 states and 4873 transitions. [2023-01-28 06:39:41,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 1379 transitions, 15387 flow [2023-01-28 06:39:41,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 1379 transitions, 15138 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-01-28 06:39:41,417 INFO L231 Difference]: Finished difference. Result has 209 places, 881 transitions, 10459 flow [2023-01-28 06:39:41,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2801, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=10459, PETRI_PLACES=209, PETRI_TRANSITIONS=881} [2023-01-28 06:39:41,418 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 166 predicate places. [2023-01-28 06:39:41,418 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 881 transitions, 10459 flow [2023-01-28 06:39:41,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.5) internal successors, (1930), 20 states have internal predecessors, (1930), 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 06:39:41,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:39:41,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:39:41,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 06:39:41,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:39:41,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-01-28 06:39:41,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:39:41,693 INFO L85 PathProgramCache]: Analyzing trace with hash -569032951, now seen corresponding path program 1 times [2023-01-28 06:39:41,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:39:41,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116564319] [2023-01-28 06:39:41,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:39:41,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:39:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:39:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:39:45,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:39:45,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116564319] [2023-01-28 06:39:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116564319] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:39:45,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019867638] [2023-01-28 06:39:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:39:45,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:39:45,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:39:45,021 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:39:45,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 06:39:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:39:45,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 120 conjunts are in the unsatisfiable core [2023-01-28 06:39:45,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:39:45,597 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-01-28 06:39:45,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-01-28 06:39:45,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:39:46,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2023-01-28 06:39:47,399 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-01-28 06:39:47,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-01-28 06:39:48,869 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-01-28 06:39:48,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-01-28 06:39:50,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:50,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:51,039 INFO L321 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-01-28 06:39:51,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 383 [2023-01-28 06:39:51,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:39:51,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:39:51,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-01-28 06:39:51,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-01-28 06:39:51,478 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:39:51,479 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 372 [2023-01-28 06:39:51,750 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:39:51,751 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 416 [2023-01-28 06:39:52,233 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 06:39:52,247 INFO L217 Elim1Store]: Index analysis took 185 ms [2023-01-28 06:39:52,381 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-01-28 06:39:52,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 320 treesize of output 285 [2023-01-28 06:39:53,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:53,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:53,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:53,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:53,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:53,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 06:39:54,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 71 [2023-01-28 06:39:54,159 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:39:54,159 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 307 [2023-01-28 06:39:54,448 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:39:54,450 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 174 [2023-01-28 06:39:54,849 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:39:54,850 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 358 [2023-01-28 06:39:56,437 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:39:56,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2023-01-28 06:39:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:39:57,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:40:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 06:40:23,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019867638] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:40:23,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:40:23,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-01-28 06:40:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683697583] [2023-01-28 06:40:23,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:40:23,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 06:40:23,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:40:23,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 06:40:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=676, Unknown=15, NotChecked=0, Total=812 [2023-01-28 06:40:23,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 306 [2023-01-28 06:40:23,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 881 transitions, 10459 flow. Second operand has 29 states, 29 states have (on average 88.34482758620689) internal successors, (2562), 29 states have internal predecessors, (2562), 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 06:40:23,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:40:23,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 306 [2023-01-28 06:40:23,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:40:44,200 WARN L222 SmtUtils]: Spent 15.39s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:40:46,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:00,006 WARN L222 SmtUtils]: Spent 6.91s on a formula simplification that was a NOOP. DAG size: 159 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:41:08,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:34,573 WARN L222 SmtUtils]: Spent 21.76s on a formula simplification. DAG size of input: 223 DAG size of output: 221 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:41:35,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:39,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:42,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:44,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:46,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:49,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:51,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:41:53,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 06:42:09,418 WARN L222 SmtUtils]: Spent 11.54s on a formula simplification. DAG size of input: 219 DAG size of output: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 06:42:35,777 WARN L222 SmtUtils]: Spent 16.97s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-28 06:42:46,086 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 06:42:46,087 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 06:42:47,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 06:42:47,287 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-28 06:42:47,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-28 06:42:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 06:42:47,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:42:47,364 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-28 06:42:47,366 INFO L158 Benchmark]: Toolchain (without parser) took 848301.63ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 362.6MB in the beginning and 260.0MB in the end (delta: 102.6MB). Peak memory consumption was 285.3MB. Max. memory is 16.0GB. [2023-01-28 06:42:47,367 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:42:47,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.52ms. Allocated memory is still 404.8MB. Free memory was 362.3MB in the beginning and 342.6MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 06:42:47,367 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.32ms. Allocated memory is still 404.8MB. Free memory was 342.6MB in the beginning and 340.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:42:47,367 INFO L158 Benchmark]: Boogie Preprocessor took 22.43ms. Allocated memory is still 404.8MB. Free memory was 340.2MB in the beginning and 338.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:42:47,367 INFO L158 Benchmark]: RCFGBuilder took 793.55ms. Allocated memory is still 404.8MB. Free memory was 338.5MB in the beginning and 364.3MB in the end (delta: -25.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. [2023-01-28 06:42:47,367 INFO L158 Benchmark]: TraceAbstraction took 847120.21ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 363.6MB in the beginning and 260.0MB in the end (delta: 103.6MB). Peak memory consumption was 283.3MB. Max. memory is 16.0GB. [2023-01-28 06:42:47,368 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.12ms. Allocated memory is still 255.9MB. Free memory is still 213.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 324.52ms. Allocated memory is still 404.8MB. Free memory was 362.3MB in the beginning and 342.6MB in the end (delta: 19.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.32ms. Allocated memory is still 404.8MB. Free memory was 342.6MB in the beginning and 340.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.43ms. Allocated memory is still 404.8MB. Free memory was 340.2MB in the beginning and 338.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 793.55ms. Allocated memory is still 404.8MB. Free memory was 338.5MB in the beginning and 364.3MB in the end (delta: -25.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. * TraceAbstraction took 847120.21ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 363.6MB in the beginning and 260.0MB in the end (delta: 103.6MB). Peak memory consumption was 283.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 93 PlacesBefore, 23 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 2354 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1558, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 917, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1558, independent: 551, independent conditional: 0, independent unconditional: 551, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 917, unknown conditional: 0, unknown unconditional: 917] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 93 PlacesBefore, 23 PlacesAfterwards, 98 TransitionsBefore, 27 TransitionsAfterwards, 1690 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 2357 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1576, independent: 1442, independent conditional: 0, independent unconditional: 1442, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 930, independent: 885, independent conditional: 0, independent unconditional: 885, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1576, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 930, unknown conditional: 0, unknown unconditional: 930] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 154 PlacesBefore, 43 PlacesAfterwards, 164 TransitionsBefore, 52 TransitionsAfterwards, 11960 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 17927 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10258, independent: 10030, independent conditional: 0, independent unconditional: 10030, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6463, independent: 6384, independent conditional: 0, independent unconditional: 6384, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10258, independent: 3646, independent conditional: 0, independent unconditional: 3646, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 6463, unknown conditional: 0, unknown unconditional: 6463] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 268, Positive conditional cache size: 0, Positive unconditional cache size: 268, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown