/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 17:47:40,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 17:47:40,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 17:47:40,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 17:47:40,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 17:47:40,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 17:47:40,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 17:47:40,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 17:47:40,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 17:47:40,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 17:47:40,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 17:47:40,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 17:47:40,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 17:47:40,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 17:47:40,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 17:47:40,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 17:47:40,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 17:47:40,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 17:47:40,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 17:47:40,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 17:47:40,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 17:47:40,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 17:47:40,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 17:47:40,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 17:47:40,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 17:47:40,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 17:47:40,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 17:47:40,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 17:47:40,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 17:47:40,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 17:47:40,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 17:47:40,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 17:47:40,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 17:47:40,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 17:47:40,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 17:47:40,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 17:47:40,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 17:47:40,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 17:47:40,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 17:47:40,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 17:47:40,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 17:47:40,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 17:47:40,550 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 17:47:40,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 17:47:40,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 17:47:40,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 17:47:40,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 17:47:40,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 17:47:40,553 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 17:47:40,553 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 17:47:40,553 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 17:47:40,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 17:47:40,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 17:47:40,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 17:47:40,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 17:47:40,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 17:47:40,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 17:47:40,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 17:47:40,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 17:47:40,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 17:47:40,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 17:47:40,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 17:47:40,555 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 17:47:40,555 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-01-27 17:47:40,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 17:47:40,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 17:47:40,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 17:47:40,776 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 17:47:40,776 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 17:47:40,777 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-27 17:47:41,873 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 17:47:42,063 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 17:47:42,063 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-01-27 17:47:42,070 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1287163/daa9f2dd85fa428fb63fd7a6e836c18a/FLAG100214859 [2023-01-27 17:47:42,080 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1287163/daa9f2dd85fa428fb63fd7a6e836c18a [2023-01-27 17:47:42,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 17:47:42,083 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 17:47:42,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 17:47:42,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 17:47:42,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 17:47:42,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@974b66a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42, skipping insertion in model container [2023-01-27 17:47:42,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 17:47:42,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 17:47:42,282 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-27 17:47:42,287 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-27 17:47:42,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 17:47:42,298 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 17:47:42,320 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-27 17:47:42,322 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-27 17:47:42,324 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 17:47:42,345 INFO L208 MainTranslator]: Completed translation [2023-01-27 17:47:42,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42 WrapperNode [2023-01-27 17:47:42,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 17:47:42,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 17:47:42,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 17:47:42,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 17:47:42,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,358 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,374 INFO L138 Inliner]: procedures = 172, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2023-01-27 17:47:42,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 17:47:42,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 17:47:42,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 17:47:42,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 17:47:42,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,403 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 17:47:42,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 17:47:42,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 17:47:42,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 17:47:42,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (1/1) ... [2023-01-27 17:47:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 17:47:42,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 17:47:42,433 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 17:47:42,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 17:47:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 17:47:42,461 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-01-27 17:47:42,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-01-27 17:47:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 17:47:42,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 17:47:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 17:47:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 17:47:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 17:47:42,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 17:47:42,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 17:47:42,464 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 17:47:42,589 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 17:47:42,590 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 17:47:42,772 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 17:47:42,978 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 17:47:42,979 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-27 17:47:42,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 05:47:42 BoogieIcfgContainer [2023-01-27 17:47:42,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 17:47:42,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 17:47:42,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 17:47:42,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 17:47:42,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 05:47:42" (1/3) ... [2023-01-27 17:47:42,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2efb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 05:47:42, skipping insertion in model container [2023-01-27 17:47:42,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 05:47:42" (2/3) ... [2023-01-27 17:47:42,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2efb46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 05:47:42, skipping insertion in model container [2023-01-27 17:47:42,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 05:47:42" (3/3) ... [2023-01-27 17:47:42,997 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-01-27 17:47:43,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 17:47:43,010 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 17:47:43,010 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 17:47:43,094 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 17:47:43,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-01-27 17:47:43,175 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-01-27 17:47:43,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 17:47:43,179 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-27 17:47:43,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 201 flow [2023-01-27 17:47:43,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 98 transitions, 201 flow [2023-01-27 17:47:43,191 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 17:47:43,199 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 98 transitions, 201 flow [2023-01-27 17:47:43,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 98 transitions, 201 flow [2023-01-27 17:47:43,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 201 flow [2023-01-27 17:47:43,232 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2023-01-27 17:47:43,233 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 17:47:43,233 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-27 17:47:43,234 INFO L119 LiptonReduction]: Number of co-enabled transitions 1690 [2023-01-27 17:47:45,712 INFO L134 LiptonReduction]: Checked pairs total: 2354 [2023-01-27 17:47:45,712 INFO L136 LiptonReduction]: Total number of compositions: 84 [2023-01-27 17:47:45,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 17:47:45,731 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;@2db957aa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 17:47:45,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 17:47:45,734 INFO L130 PetriNetUnfolder]: 1/15 cut-off events. [2023-01-27 17:47:45,734 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 17:47:45,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:47:45,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-27 17:47:45,735 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 17:47:45,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:47:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 147063794, now seen corresponding path program 1 times [2023-01-27 17:47:45,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:47:45,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980703614] [2023-01-27 17:47:45,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:47:45,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:47:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:47:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 17:47:45,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:47:45,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980703614] [2023-01-27 17:47:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980703614] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 17:47:45,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 17:47:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 17:47:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711844279] [2023-01-27 17:47:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 17:47:45,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-27 17:47:45,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:47:45,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-27 17:47:45,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-27 17:47:45,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 182 [2023-01-27 17:47:45,945 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-27 17:47:45,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:47:45,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 182 [2023-01-27 17:47:45,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:47:46,029 INFO L130 PetriNetUnfolder]: 43/91 cut-off events. [2023-01-27 17:47:46,029 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 17:47:46,029 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-27 17:47:46,031 INFO L137 encePairwiseOnDemand]: 179/182 looper letters, 23 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-01-27 17:47:46,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 24 transitions, 99 flow [2023-01-27 17:47:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-27 17:47:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-27 17:47:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 200 transitions. [2023-01-27 17:47:46,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5494505494505495 [2023-01-27 17:47:46,043 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 200 transitions. [2023-01-27 17:47:46,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 200 transitions. [2023-01-27 17:47:46,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 17:47:46,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 200 transitions. [2023-01-27 17:47:46,051 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-27 17:47:46,055 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-27 17:47:46,056 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-27 17:47:46,057 INFO L175 Difference]: Start difference. First operand has 23 places, 27 transitions, 59 flow. Second operand 2 states and 200 transitions. [2023-01-27 17:47:46,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 24 transitions, 99 flow [2023-01-27 17:47:46,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 99 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 17:47:46,060 INFO L231 Difference]: Finished difference. Result has 23 places, 24 transitions, 53 flow [2023-01-27 17:47:46,061 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=53, PETRI_PLACES=23, PETRI_TRANSITIONS=24} [2023-01-27 17:47:46,064 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 0 predicate places. [2023-01-27 17:47:46,064 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 24 transitions, 53 flow [2023-01-27 17:47:46,064 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-27 17:47:46,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:47:46,065 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-01-27 17:47:46,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 17:47:46,065 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 17:47:46,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:47:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 147020590, now seen corresponding path program 1 times [2023-01-27 17:47:46,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:47:46,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344610419] [2023-01-27 17:47:46,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:47:46,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:47:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 17:47:46,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 17:47:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 17:47:46,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 17:47:46,128 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 17:47:46,129 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-01-27 17:47:46,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-01-27 17:47:46,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-01-27 17:47:46,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-01-27 17:47:46,131 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-01-27 17:47:46,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 17:47:46,131 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-01-27 17:47:46,134 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-27 17:47:46,135 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-27 17:47:46,188 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 17:47:46,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-01-27 17:47:46,215 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-01-27 17:47:46,215 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 17:47:46,219 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-27 17:47:46,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 164 transitions, 340 flow [2023-01-27 17:47:46,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 164 transitions, 340 flow [2023-01-27 17:47:46,221 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 17:47:46,221 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 164 transitions, 340 flow [2023-01-27 17:47:46,221 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 164 transitions, 340 flow [2023-01-27 17:47:46,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 164 transitions, 340 flow [2023-01-27 17:47:46,238 INFO L130 PetriNetUnfolder]: 17/186 cut-off events. [2023-01-27 17:47:46,238 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 17:47:46,238 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-27 17:47:46,243 INFO L119 LiptonReduction]: Number of co-enabled transitions 11960 [2023-01-27 17:47:49,679 INFO L134 LiptonReduction]: Checked pairs total: 17804 [2023-01-27 17:47:49,679 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-01-27 17:47:49,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 17:47:49,682 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2db957aa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 17:47:49,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-01-27 17:47:49,684 INFO L130 PetriNetUnfolder]: 1/15 cut-off events. [2023-01-27 17:47:49,685 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 17:47:49,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:47:49,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-27 17:47:49,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 17:47:49,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:47:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1777036933, now seen corresponding path program 1 times [2023-01-27 17:47:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:47:49,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976951573] [2023-01-27 17:47:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:47:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:47:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:47:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 17:47:49,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:47:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976951573] [2023-01-27 17:47:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976951573] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 17:47:49,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 17:47:49,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 17:47:49,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049778307] [2023-01-27 17:47:49,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 17:47:49,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-27 17:47:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:47:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-27 17:47:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-27 17:47:49,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 306 [2023-01-27 17:47:49,709 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-27 17:47:49,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:47:49,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 306 [2023-01-27 17:47:49,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:47:49,864 INFO L130 PetriNetUnfolder]: 1065/1643 cut-off events. [2023-01-27 17:47:49,864 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2023-01-27 17:47:49,866 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 8613 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-27 17:47:49,871 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-01-27 17:47:49,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 194 flow [2023-01-27 17:47:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-27 17:47:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-27 17:47:49,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-01-27 17:47:49,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506535947712419 [2023-01-27 17:47:49,873 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-01-27 17:47:49,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-01-27 17:47:49,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 17:47:49,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-01-27 17:47:49,874 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-27 17:47:49,875 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-27 17:47:49,876 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-27 17:47:49,876 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 116 flow. Second operand 2 states and 337 transitions. [2023-01-27 17:47:49,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 194 flow [2023-01-27 17:47:49,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 192 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-27 17:47:49,877 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 104 flow [2023-01-27 17:47:49,877 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-27 17:47:49,878 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2023-01-27 17:47:49,878 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 104 flow [2023-01-27 17:47:49,878 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-27 17:47:49,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:47:49,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 17:47:49,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 17:47:49,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 17:47:49,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:47:49,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1668596586, now seen corresponding path program 1 times [2023-01-27 17:47:49,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:47:49,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138030026] [2023-01-27 17:47:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:47:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:47:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:47:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 17:47:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:47:50,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138030026] [2023-01-27 17:47:50,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138030026] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 17:47:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 17:47:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 17:47:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198082617] [2023-01-27 17:47:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 17:47:50,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 17:47:50,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:47:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 17:47:50,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-01-27 17:47:50,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 306 [2023-01-27 17:47:50,551 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 104 flow. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:50,551 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:47:50,551 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 306 [2023-01-27 17:47:50,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:47:51,447 INFO L130 PetriNetUnfolder]: 2445/3725 cut-off events. [2023-01-27 17:47:51,448 INFO L131 PetriNetUnfolder]: For 101/101 co-relation queries the response was YES. [2023-01-27 17:47:51,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7548 conditions, 3725 events. 2445/3725 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 22069 event pairs, 281 based on Foata normal form. 0/2695 useless extension candidates. Maximal degree in co-relation 7543. Up to 1831 conditions per place. [2023-01-27 17:47:51,465 INFO L137 encePairwiseOnDemand]: 289/306 looper letters, 194 selfloop transitions, 69 changer transitions 0/266 dead transitions. [2023-01-27 17:47:51,465 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 266 transitions, 1103 flow [2023-01-27 17:47:51,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 17:47:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-27 17:47:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1627 transitions. [2023-01-27 17:47:51,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37978524743230624 [2023-01-27 17:47:51,470 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1627 transitions. [2023-01-27 17:47:51,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1627 transitions. [2023-01-27 17:47:51,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 17:47:51,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1627 transitions. [2023-01-27 17:47:51,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 116.21428571428571) internal successors, (1627), 14 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:51,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:51,480 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:51,480 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 104 flow. Second operand 14 states and 1627 transitions. [2023-01-27 17:47:51,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 266 transitions, 1103 flow [2023-01-27 17:47:51,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 266 transitions, 1103 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 17:47:51,484 INFO L231 Difference]: Finished difference. Result has 67 places, 130 transitions, 598 flow [2023-01-27 17:47:51,484 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=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=598, PETRI_PLACES=67, PETRI_TRANSITIONS=130} [2023-01-27 17:47:51,485 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 24 predicate places. [2023-01-27 17:47:51,485 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 130 transitions, 598 flow [2023-01-27 17:47:51,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:51,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:47:51,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 17:47:51,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 17:47:51,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 17:47:51,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:47:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1666360739, now seen corresponding path program 1 times [2023-01-27 17:47:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:47:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919948090] [2023-01-27 17:47:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:47:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:47:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:47:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 17:47:51,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:47:51,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919948090] [2023-01-27 17:47:51,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919948090] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 17:47:51,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 17:47:51,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 17:47:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239578726] [2023-01-27 17:47:51,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 17:47:51,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 17:47:51,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:47:51,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 17:47:51,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-27 17:47:51,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 306 [2023-01-27 17:47:51,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 130 transitions, 598 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-27 17:47:51,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:47:51,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 306 [2023-01-27 17:47:51,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:47:52,902 INFO L130 PetriNetUnfolder]: 3426/5242 cut-off events. [2023-01-27 17:47:52,902 INFO L131 PetriNetUnfolder]: For 4893/4904 co-relation queries the response was YES. [2023-01-27 17:47:52,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15141 conditions, 5242 events. 3426/5242 cut-off events. For 4893/4904 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 32599 event pairs, 1075 based on Foata normal form. 3/4348 useless extension candidates. Maximal degree in co-relation 15124. Up to 3867 conditions per place. [2023-01-27 17:47:52,928 INFO L137 encePairwiseOnDemand]: 289/306 looper letters, 257 selfloop transitions, 51 changer transitions 0/311 dead transitions. [2023-01-27 17:47:52,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 311 transitions, 1795 flow [2023-01-27 17:47:52,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-27 17:47:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-27 17:47:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1506 transitions. [2023-01-27 17:47:52,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37858220211161386 [2023-01-27 17:47:52,932 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1506 transitions. [2023-01-27 17:47:52,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1506 transitions. [2023-01-27 17:47:52,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 17:47:52,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1506 transitions. [2023-01-27 17:47:52,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.84615384615384) internal successors, (1506), 13 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:52,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:52,939 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:52,939 INFO L175 Difference]: Start difference. First operand has 67 places, 130 transitions, 598 flow. Second operand 13 states and 1506 transitions. [2023-01-27 17:47:52,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 311 transitions, 1795 flow [2023-01-27 17:47:52,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 311 transitions, 1795 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 17:47:52,957 INFO L231 Difference]: Finished difference. Result has 85 places, 184 transitions, 1013 flow [2023-01-27 17:47:52,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1013, PETRI_PLACES=85, PETRI_TRANSITIONS=184} [2023-01-27 17:47:52,957 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2023-01-27 17:47:52,957 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 184 transitions, 1013 flow [2023-01-27 17:47:52,958 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-27 17:47:52,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:47:52,958 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-01-27 17:47:52,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 17:47:52,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-01-27 17:47:52,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:47:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash -411397135, now seen corresponding path program 1 times [2023-01-27 17:47:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:47:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579339349] [2023-01-27 17:47:52,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:47:52,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:47:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 17:47:52,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 17:47:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 17:47:52,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 17:47:52,972 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 17:47:52,972 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-01-27 17:47:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-01-27 17:47:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-01-27 17:47:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-01-27 17:47:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-01-27 17:47:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-01-27 17:47:52,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-01-27 17:47:52,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 17:47:52,973 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-01-27 17:47:52,974 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-27 17:47:52,974 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-01-27 17:47:53,015 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 17:47:53,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 230 transitions, 481 flow [2023-01-27 17:47:53,036 INFO L130 PetriNetUnfolder]: 25/264 cut-off events. [2023-01-27 17:47:53,036 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-27 17:47:53,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 264 events. 25/264 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1004 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 207. Up to 8 conditions per place. [2023-01-27 17:47:53,037 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 230 transitions, 481 flow [2023-01-27 17:47:53,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 215 places, 230 transitions, 481 flow [2023-01-27 17:47:53,039 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 17:47:53,039 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 215 places, 230 transitions, 481 flow [2023-01-27 17:47:53,039 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 230 transitions, 481 flow [2023-01-27 17:47:53,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 230 transitions, 481 flow [2023-01-27 17:47:53,058 INFO L130 PetriNetUnfolder]: 25/264 cut-off events. [2023-01-27 17:47:53,058 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-27 17:47:53,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 264 events. 25/264 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1004 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 207. Up to 8 conditions per place. [2023-01-27 17:47:53,068 INFO L119 LiptonReduction]: Number of co-enabled transitions 30810 [2023-01-27 17:47:58,105 INFO L134 LiptonReduction]: Checked pairs total: 46397 [2023-01-27 17:47:58,106 INFO L136 LiptonReduction]: Total number of compositions: 198 [2023-01-27 17:47:58,107 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 17:47:58,107 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;@2db957aa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 17:47:58,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-01-27 17:47:58,109 INFO L130 PetriNetUnfolder]: 1/15 cut-off events. [2023-01-27 17:47:58,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 17:47:58,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:47:58,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-27 17:47:58,109 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-01-27 17:47:58,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:47:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash -72499651, now seen corresponding path program 1 times [2023-01-27 17:47:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:47:58,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775065634] [2023-01-27 17:47:58,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:47:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:47:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:47:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 17:47:58,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:47:58,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775065634] [2023-01-27 17:47:58,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775065634] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 17:47:58,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 17:47:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 17:47:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689611771] [2023-01-27 17:47:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 17:47:58,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-27 17:47:58,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:47:58,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-27 17:47:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-27 17:47:58,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 428 [2023-01-27 17:47:58,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 75 transitions, 171 flow. Second operand has 2 states, 2 states have (on average 204.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:47:58,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:47:58,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 428 [2023-01-27 17:47:58,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:48:00,808 INFO L130 PetriNetUnfolder]: 27945/37185 cut-off events. [2023-01-27 17:48:00,808 INFO L131 PetriNetUnfolder]: For 2032/2032 co-relation queries the response was YES. [2023-01-27 17:48:00,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75427 conditions, 37185 events. 27945/37185 cut-off events. For 2032/2032 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 219213 event pairs, 19935 based on Foata normal form. 0/25591 useless extension candidates. Maximal degree in co-relation 3351. Up to 36684 conditions per place. [2023-01-27 17:48:00,994 INFO L137 encePairwiseOnDemand]: 421/428 looper letters, 65 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2023-01-27 17:48:00,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 287 flow [2023-01-27 17:48:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-27 17:48:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-27 17:48:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 474 transitions. [2023-01-27 17:48:00,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5537383177570093 [2023-01-27 17:48:00,996 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 474 transitions. [2023-01-27 17:48:00,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 474 transitions. [2023-01-27 17:48:00,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 17:48:00,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 474 transitions. [2023-01-27 17:48:00,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 237.0) internal successors, (474), 2 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:00,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:00,999 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 428.0) internal successors, (1284), 3 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:00,999 INFO L175 Difference]: Start difference. First operand has 61 places, 75 transitions, 171 flow. Second operand 2 states and 474 transitions. [2023-01-27 17:48:00,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 287 flow [2023-01-27 17:48:01,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 68 transitions, 281 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-01-27 17:48:01,003 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 151 flow [2023-01-27 17:48:01,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=151, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-01-27 17:48:01,004 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-01-27 17:48:01,004 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 151 flow [2023-01-27 17:48:01,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 204.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:01,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:48:01,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 17:48:01,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 17:48:01,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-01-27 17:48:01,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:48:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash -945290628, now seen corresponding path program 1 times [2023-01-27 17:48:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:48:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544259012] [2023-01-27 17:48:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:48:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:48:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:48:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 17:48:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:48:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544259012] [2023-01-27 17:48:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544259012] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 17:48:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 17:48:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-27 17:48:01,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075553319] [2023-01-27 17:48:01,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 17:48:01,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-27 17:48:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:48:01,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-27 17:48:01,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-27 17:48:01,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 428 [2023-01-27 17:48:01,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 151 flow. Second operand has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:01,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:48:01,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 428 [2023-01-27 17:48:01,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:48:05,739 INFO L130 PetriNetUnfolder]: 44612/59233 cut-off events. [2023-01-27 17:48:05,739 INFO L131 PetriNetUnfolder]: For 1138/1138 co-relation queries the response was YES. [2023-01-27 17:48:05,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119548 conditions, 59233 events. 44612/59233 cut-off events. For 1138/1138 co-relation queries the response was YES. Maximal size of possible extension queue 3258. Compared 373826 event pairs, 7244 based on Foata normal form. 0/41939 useless extension candidates. Maximal degree in co-relation 119542. Up to 35078 conditions per place. [2023-01-27 17:48:06,027 INFO L137 encePairwiseOnDemand]: 404/428 looper letters, 346 selfloop transitions, 58 changer transitions 0/407 dead transitions. [2023-01-27 17:48:06,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 407 transitions, 1717 flow [2023-01-27 17:48:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 17:48:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 17:48:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2184 transitions. [2023-01-27 17:48:06,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252336448598131 [2023-01-27 17:48:06,031 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2184 transitions. [2023-01-27 17:48:06,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2184 transitions. [2023-01-27 17:48:06,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 17:48:06,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2184 transitions. [2023-01-27 17:48:06,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:06,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 428.0) internal successors, (5564), 13 states have internal predecessors, (5564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:06,043 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 428.0) internal successors, (5564), 13 states have internal predecessors, (5564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:06,044 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 151 flow. Second operand 12 states and 2184 transitions. [2023-01-27 17:48:06,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 407 transitions, 1717 flow [2023-01-27 17:48:06,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 407 transitions, 1717 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 17:48:06,048 INFO L231 Difference]: Finished difference. Result has 81 places, 132 transitions, 578 flow [2023-01-27 17:48:06,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=578, PETRI_PLACES=81, PETRI_TRANSITIONS=132} [2023-01-27 17:48:06,050 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2023-01-27 17:48:06,050 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 132 transitions, 578 flow [2023-01-27 17:48:06,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:06,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:48:06,050 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 17:48:06,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 17:48:06,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-01-27 17:48:06,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:48:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash 945174436, now seen corresponding path program 1 times [2023-01-27 17:48:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:48:06,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024821765] [2023-01-27 17:48:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:48:06,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:48:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:48:06,386 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-27 17:48:06,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:48:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024821765] [2023-01-27 17:48:06,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024821765] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 17:48:06,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869462571] [2023-01-27 17:48:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:48:06,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 17:48:06,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 17:48:06,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 17:48:06,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 17:48:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:48:06,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 72 conjunts are in the unsatisfiable core [2023-01-27 17:48:06,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 17:48:06,871 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-01-27 17:48:06,872 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-27 17:48:06,942 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-27 17:48:07,009 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-27 17:48:07,009 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-27 17:48:07,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 17:48:07,188 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-01-27 17:48:07,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 120 [2023-01-27 17:48:07,201 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-27 17:48:07,211 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 12 treesize of output 11 [2023-01-27 17:48:07,225 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-27 17:48:07,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 17:48:07,268 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 54 treesize of output 20 [2023-01-27 17:48:07,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-01-27 17:48:07,291 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 17:48:07,293 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2023-01-27 17:48:07,490 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-01-27 17:48:07,491 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 2 case distinctions, treesize of input 31 treesize of output 43 [2023-01-27 17:48:07,533 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-27 17:48:07,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 17:48:08,136 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-27 17:48:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869462571] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 17:48:08,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 17:48:08,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-01-27 17:48:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607912465] [2023-01-27 17:48:08,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 17:48:08,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-27 17:48:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:48:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-27 17:48:08,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=312, Unknown=24, NotChecked=0, Total=420 [2023-01-27 17:48:08,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 428 [2023-01-27 17:48:08,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 132 transitions, 578 flow. Second operand has 21 states, 21 states have (on average 145.28571428571428) internal successors, (3051), 21 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:48:08,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:48:08,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 428 [2023-01-27 17:48:08,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:48:10,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:48:13,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:48:16,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:48:18,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:48:21,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 [0, 1] [2023-01-27 17:48:23,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:48:26,069 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] [2023-01-27 17:48:26,127 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse3 (mod .cse7 4294967296)) (.cse5 (+ 1 .cse7))) (and (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_148))) (let ((.cse0 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (store (store (store (store .cse2 |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store .cse2 |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store .cse2 |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (>= aux_mod_v_ArrVal_151_29 4294967296) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (> 0 aux_mod_v_ArrVal_151_29)))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse4 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse3 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse4 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (> 0 aux_mod_v_ArrVal_151_29)))) (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse3 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (> 0 aux_mod_v_ArrVal_151_29)))) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 3))))) is different from false [2023-01-27 17:48:28,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:48:28,319 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse5 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse7 (mod .cse12 4294967296))) (let ((.cse3 (= .cse5 .cse7)) (.cse9 (+ 1 .cse12))) (and (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_148))) (let ((.cse0 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (store (store (store (store .cse2 |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store .cse2 |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ .cse0 1))) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store .cse2 |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (>= aux_mod_v_ArrVal_151_29 4294967296) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (> 0 aux_mod_v_ArrVal_151_29)))))) (or .cse3 (forall ((v_ArrVal_154 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (not (= (mod (select (select .cse4 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse5 (mod (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_154 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (or (not .cse3) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse6 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (not (= 0 (mod (select (select .cse6 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (>= aux_mod_v_ArrVal_151_29 4294967296) (< .cse5 (mod (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (> 0 aux_mod_v_ArrVal_151_29))))) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse8 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse9)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse7 (mod (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse8 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (> 0 aux_mod_v_ArrVal_151_29)))) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse10 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse9)) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse7 (mod (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse10 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (> 0 aux_mod_v_ArrVal_151_29)))) (or (forall ((v_ArrVal_158 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (not (= (mod (select (select .cse11 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse5 (mod (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))))) is different from false [2023-01-27 17:48:28,371 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse4 (mod .cse6 4294967296))) (let ((.cse0 (= .cse2 .cse4))) (and (or .cse0 (forall ((v_ArrVal_154 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_154 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (or (not .cse0) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (not (= 0 (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (>= aux_mod_v_ArrVal_151_29 4294967296) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (> 0 aux_mod_v_ArrVal_151_29))))) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse6))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse4 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (> 0 aux_mod_v_ArrVal_151_29)))) (or (forall ((v_ArrVal_158 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (not (= (mod (select (select .cse7 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)))))) is different from false [2023-01-27 17:48:28,416 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse4 (mod .cse6 4294967296))) (let ((.cse0 (= .cse2 .cse4))) (and (or .cse0 (forall ((v_ArrVal_154 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_154 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (or (not .cse0) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (not (= 0 (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (>= aux_mod_v_ArrVal_151_29 4294967296) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (> 0 aux_mod_v_ArrVal_151_29))))) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse6))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse4 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (> 0 aux_mod_v_ArrVal_151_29)))))))) is different from false [2023-01-27 17:48:30,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:48:37,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:48:40,594 WARN L839 $PredicateComparison]: unable to prove that (and (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse0))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< (mod .cse0 4294967296) (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (> 0 aux_mod_v_ArrVal_151_29))))) (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0) (or (forall ((v_ArrVal_158 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (not (= (mod (select (select .cse2 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296) (mod (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))) (= (mod (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0)) (= |c_~#value~0.base| 3) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 3))) is different from false [2023-01-27 17:48:51,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:48:53,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:48:55,893 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] [2023-01-27 17:48:57,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:49:13,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:49:15,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:49:17,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:49:19,615 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] [2023-01-27 17:49:21,622 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] [2023-01-27 17:49:23,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:49:26,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:49:28,376 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-27 17:49:49,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:49:51,809 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] [2023-01-27 17:49:55,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:49:57,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:49:59,971 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-27 17:50:08,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:11,616 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] [2023-01-27 17:50:13,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:50:15,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:50:18,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:24,518 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] [2023-01-27 17:50:26,526 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] [2023-01-27 17:50:30,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:33,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:35,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:38,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:44,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:50:46,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-27 17:50:59,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:02,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:04,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:11,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:51:15,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:26,653 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-27 17:51:28,966 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] [2023-01-27 17:51:30,979 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] [2023-01-27 17:51:32,103 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse2 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse4 (mod .cse6 4294967296))) (let ((.cse0 (= .cse2 .cse4))) (and (or .cse0 (forall ((v_ArrVal_154 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (not (= (mod (select (select .cse1 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (< .cse2 (mod (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_ArrVal_154 |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 4294967296) 0))))) (or (not .cse0) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 1))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (not (= 0 (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296))) (>= aux_mod_v_ArrVal_151_29 4294967296) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (> 0 aux_mod_v_ArrVal_151_29))))) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| (+ 1 .cse6))) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse4 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (> 0 aux_mod_v_ArrVal_151_29)))) (or (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset|) 0) (and (not (= |c_~#value~0.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (<= 1 .cse6) (<= .cse6 1) (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0))))))) is different from false [2023-01-27 17:51:34,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:36,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:38,256 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse4 (+ 1 .cse6)) (.cse1 (mod |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 4294967296)) (.cse2 (mod .cse6 4294967296))) (and (forall ((v_ArrVal_158 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (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))))) (not (= 3 |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.offset| (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse2 (mod (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse3 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (> 0 aux_mod_v_ArrVal_151_29)))) (= |c_thr1Thread1of3ForFork0_inc_~inc__v~0#1| 0) (forall ((aux_div_v_ArrVal_151_29 Int) (v_ArrVal_150 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_157 (Array Int Int)) (|v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| Int) (aux_mod_v_ArrVal_151_29 Int) (v_ArrVal_158 (Array Int Int))) (let ((.cse5 (store (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_153) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_155) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65| (store (select (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_ArrVal_157) |c_~#value~0.base| v_ArrVal_150) |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0 (+ (* aux_div_v_ArrVal_151_29 4294967296) aux_mod_v_ArrVal_151_29))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_158))) (or (= aux_mod_v_ArrVal_151_29 0) (< .cse2 (mod (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (mod (select (select .cse5 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0)) (>= aux_mod_v_ArrVal_151_29 4294967296) (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base_65|) 0)) (> 0 aux_mod_v_ArrVal_151_29)))) (= |c_~#value~0.base| 3) (or (< .cse1 .cse2) (not (= (mod (select (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) 4294967296) 0))) (not (= |c_thr1Thread1of3ForFork0_inc_~#inc__casret~0#1.base| 3))))) is different from false [2023-01-27 17:51:39,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:41,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:43,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-27 17:51:45,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:47,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:49,341 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-27 17:51:51,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:51:55,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:05,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:07,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:12,178 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-27 17:52:14,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:16,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:18,288 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-27 17:52:20,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:23,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:25,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:27,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:29,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:31,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:33,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:35,628 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-27 17:52:37,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:40,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:44,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:52:47,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:53:10,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:16,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:18,519 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] [2023-01-27 17:53:22,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:24,099 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-27 17:53:38,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:44,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:46,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:48,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:53,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:53:57,832 INFO L130 PetriNetUnfolder]: 134751/183349 cut-off events. [2023-01-27 17:53:57,832 INFO L131 PetriNetUnfolder]: For 300652/301057 co-relation queries the response was YES. [2023-01-27 17:53:58,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542411 conditions, 183349 events. 134751/183349 cut-off events. For 300652/301057 co-relation queries the response was YES. Maximal size of possible extension queue 9696. Compared 1338820 event pairs, 7026 based on Foata normal form. 4597/156329 useless extension candidates. Maximal degree in co-relation 542395. Up to 71251 conditions per place. [2023-01-27 17:53:59,064 INFO L137 encePairwiseOnDemand]: 371/428 looper letters, 1227 selfloop transitions, 1235 changer transitions 0/2465 dead transitions. [2023-01-27 17:53:59,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 2465 transitions, 15276 flow [2023-01-27 17:53:59,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-01-27 17:53:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-01-27 17:53:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 12414 transitions. [2023-01-27 17:53:59,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41435246995994657 [2023-01-27 17:53:59,234 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 12414 transitions. [2023-01-27 17:53:59,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 12414 transitions. [2023-01-27 17:53:59,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 17:53:59,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 12414 transitions. [2023-01-27 17:53:59,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 177.34285714285716) internal successors, (12414), 70 states have internal predecessors, (12414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:53:59,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 428.0) internal successors, (30388), 71 states have internal predecessors, (30388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:53:59,306 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 428.0) internal successors, (30388), 71 states have internal predecessors, (30388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:53:59,306 INFO L175 Difference]: Start difference. First operand has 81 places, 132 transitions, 578 flow. Second operand 70 states and 12414 transitions. [2023-01-27 17:53:59,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 2465 transitions, 15276 flow [2023-01-27 17:54:01,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 2465 transitions, 15276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 17:54:01,314 INFO L231 Difference]: Finished difference. Result has 213 places, 1499 transitions, 13925 flow [2023-01-27 17:54:01,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=428, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=13925, PETRI_PLACES=213, PETRI_TRANSITIONS=1499} [2023-01-27 17:54:01,315 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 152 predicate places. [2023-01-27 17:54:01,315 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 1499 transitions, 13925 flow [2023-01-27 17:54:01,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 145.28571428571428) internal successors, (3051), 21 states have internal predecessors, (3051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:54:01,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 17:54:01,316 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 17:54:01,324 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-27 17:54:01,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 17:54:01,521 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2023-01-27 17:54:01,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 17:54:01,521 INFO L85 PathProgramCache]: Analyzing trace with hash 264408931, now seen corresponding path program 1 times [2023-01-27 17:54:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 17:54:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397940789] [2023-01-27 17:54:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:54:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 17:54:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:54:01,885 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-27 17:54:01,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 17:54:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397940789] [2023-01-27 17:54:01,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397940789] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 17:54:01,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100546184] [2023-01-27 17:54:01,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 17:54:01,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 17:54:01,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 17:54:01,893 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 17:54:01,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 17:54:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 17:54:02,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 71 conjunts are in the unsatisfiable core [2023-01-27 17:54:02,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 17:54:02,040 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-01-27 17:54:02,040 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-27 17:54:02,096 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-27 17:54:02,184 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-27 17:54:02,249 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-01-27 17:54:02,250 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-27 17:54:02,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 17:54:02,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 17:54:02,480 INFO L321 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-01-27 17:54:02,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 4 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-27 17:54:02,501 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-27 17:54:02,519 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-27 17:54:02,538 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-27 17:54:02,554 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-27 17:54:02,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 17:54:02,635 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 17:54:02,652 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 17:54:02,689 INFO L321 Elim1Store]: treesize reduction 37, result has 17.8 percent of original size [2023-01-27 17:54:02,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 175 treesize of output 257 [2023-01-27 17:54:02,759 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-01-27 17:54:02,839 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 17:54:02,842 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 226 [2023-01-27 17:54:02,912 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 17:54:02,913 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 276 [2023-01-27 17:54:02,962 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 17:54:02,966 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 599 [2023-01-27 17:54:03,217 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 17:54:03,220 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 380 [2023-01-27 17:54:03,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 17:54:03,275 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 50 treesize of output 26 [2023-01-27 17:54:03,687 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-27 17:54:03,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 17:54:06,562 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-27 17:54:06,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100546184] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 17:54:06,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 17:54:06,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-01-27 17:54:06,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941024938] [2023-01-27 17:54:06,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 17:54:06,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 17:54:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 17:54:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 17:54:06,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=302, Unknown=2, NotChecked=0, Total=380 [2023-01-27 17:54:06,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 428 [2023-01-27 17:54:06,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 1499 transitions, 13925 flow. Second operand has 20 states, 20 states have (on average 145.5) internal successors, (2910), 20 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 17:54:06,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 17:54:06,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 428 [2023-01-27 17:54:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 17:54:13,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:54:14,899 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-27 17:54:16,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:54:20,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:54:22,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:54:24,450 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-27 17:54:27,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:54:33,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:54:36,798 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-27 17:54:46,204 WARN L222 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 17:55:09,296 WARN L222 SmtUtils]: Spent 8.84s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 17:55:11,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:14,684 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-27 17:55:16,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:21,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:24,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:27,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:30,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:32,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:35,570 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-27 17:55:38,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:40,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:42,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:55:44,751 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-27 17:55:52,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:05,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:08,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:10,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:13,194 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-27 17:56:23,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:25,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:28,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:30,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:32,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:35,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:39,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:41,409 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-27 17:56:43,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:56:46,023 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-27 17:57:00,035 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-27 17:57:01,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:03,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:06,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:08,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:10,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:12,500 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-27 17:57:17,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:19,284 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-27 17:57:21,412 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-27 17:57:39,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:40,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:42,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-27 17:57:44,940 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-27 17:57:47,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:49,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:57:52,230 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-27 17:57:54,553 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-27 17:57:56,667 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-27 17:57:58,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-27 17:58:00,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:03,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:05,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:07,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:09,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:11,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:13,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:15,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:18,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:20,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:22,889 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-27 17:58:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:27,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:30,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:33,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:35,117 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-27 17:58:37,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:56,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:58:59,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:02,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:05,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:09,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-27 17:59:12,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:14,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:17,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:19,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:22,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:24,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:27,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:29,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-27 17:59:33,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:36,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-27 17:59:38,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:41,020 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-27 17:59:43,766 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-27 17:59:46,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:48,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:50,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:53,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:55,248 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-27 17:59:57,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 17:59:59,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:02,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:05,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00: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-27 18:00:09,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:11,856 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-27 18:00:13,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:31,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:33,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:36,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 [1] [2023-01-27 18:00:38,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:40,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:42,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:45,285 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-27 18:00:47,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:53,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:00:56,150 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-27 18:00:58,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:01:00,975 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-27 18:01:03,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:01:05,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:01:08,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:01:10,280 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-27 18:01:12,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:01:31,024 WARN L222 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 18:01:33,232 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-27 18:01:35,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:01:37,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:01:39,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 [1] [2023-01-27 18:01:41,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-27 18:01:47,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 18:02:00,399 WARN L222 SmtUtils]: Spent 12.65s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 18:02:03,508 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-27 18:02:08,189 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] Received shutdown request... [2023-01-27 18:02:08,477 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 18:02:08,490 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 18:02:09,486 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-27 18:02:09,691 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-27 18:02:09,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-01-27 18:02:09,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-27 18:02:09,775 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-01-27 18:02:09,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-01-27 18:02:09,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-01-27 18:02:09,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-01-27 18:02:09,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 9 remaining) [2023-01-27 18:02:09,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 9 remaining) [2023-01-27 18:02:09,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2023-01-27 18:02:09,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-01-27 18:02:09,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-01-27 18:02:09,776 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-01-27 18:02:09,778 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2023-01-27 18:02:09,778 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:02:09,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:02:09 BasicIcfg [2023-01-27 18:02:09,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:02:09,794 INFO L158 Benchmark]: Toolchain (without parser) took 867710.90ms. Allocated memory was 639.6MB in the beginning and 5.1GB in the end (delta: 4.5GB). Free memory was 589.0MB in the beginning and 3.0GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-01-27 18:02:09,794 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 346.0MB. Free memory is still 292.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:02:09,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.38ms. Allocated memory is still 639.6MB. Free memory was 588.6MB in the beginning and 568.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-01-27 18:02:09,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.59ms. Allocated memory is still 639.6MB. Free memory was 568.9MB in the beginning and 566.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:02:09,794 INFO L158 Benchmark]: Boogie Preprocessor took 30.88ms. Allocated memory is still 639.6MB. Free memory was 566.5MB in the beginning and 565.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:02:09,794 INFO L158 Benchmark]: RCFGBuilder took 574.61ms. Allocated memory is still 639.6MB. Free memory was 564.7MB in the beginning and 600.2MB in the end (delta: -35.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.0GB. [2023-01-27 18:02:09,794 INFO L158 Benchmark]: TraceAbstraction took 866811.58ms. Allocated memory was 639.6MB in the beginning and 5.1GB in the end (delta: 4.5GB). Free memory was 599.2MB in the beginning and 3.0GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-01-27 18:02:09,795 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 346.0MB. Free memory is still 292.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 262.38ms. Allocated memory is still 639.6MB. Free memory was 588.6MB in the beginning and 568.9MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 27.59ms. Allocated memory is still 639.6MB. Free memory was 568.9MB in the beginning and 566.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.88ms. Allocated memory is still 639.6MB. Free memory was 566.5MB in the beginning and 565.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 574.61ms. Allocated memory is still 639.6MB. Free memory was 564.7MB in the beginning and 600.2MB in the end (delta: -35.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.0GB. * TraceAbstraction took 866811.58ms. Allocated memory was 639.6MB in the beginning and 5.1GB in the end (delta: 4.5GB). Free memory was 599.2MB in the beginning and 3.0GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 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.5s, 154 PlacesBefore, 43 PlacesAfterwards, 164 TransitionsBefore, 52 TransitionsAfterwards, 11960 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 23 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 17804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10109, independent: 9883, independent conditional: 0, independent unconditional: 9883, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6338, independent: 6251, independent conditional: 0, independent unconditional: 6251, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10109, independent: 3632, independent conditional: 0, independent unconditional: 3632, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 6338, unknown conditional: 0, unknown unconditional: 6338] , Statistics on independence cache: Total cache size (in pairs): 237, Positive cache size: 206, Positive conditional cache size: 0, Positive unconditional cache size: 206, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 215 PlacesBefore, 61 PlacesAfterwards, 230 TransitionsBefore, 75 TransitionsAfterwards, 30810 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 144 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 1 ChoiceCompositions, 198 TotalNumberOfCompositions, 46397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25713, independent: 25365, independent conditional: 0, independent unconditional: 25365, dependent: 348, dependent conditional: 0, dependent unconditional: 348, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16662, independent: 16545, independent conditional: 0, independent unconditional: 16545, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25713, independent: 8820, independent conditional: 0, independent unconditional: 8820, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 16662, unknown conditional: 0, unknown unconditional: 16662] , Statistics on independence cache: Total cache size (in pairs): 658, Positive cache size: 610, Positive conditional cache size: 0, Positive unconditional cache size: 610, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 706]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 724]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 150 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 5 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 209 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1442 IncrementalHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 0 mSDtfsCounter, 1442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1013occurred in iteration=3, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 276 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 268 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 856.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 843.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 1590 mSolverCounterUnknown, 2778 SdHoareTripleChecker+Valid, 547.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2778 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 530.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5185 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 459 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10478 IncrementalHoareTripleChecker+Invalid, 17713 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 459 mSolverCounterUnsat, 0 mSDtfsCounter, 10478 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1590 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 135 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 270.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13925occurred in iteration=3, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 22 QuantifiedInterpolants, 3491 SizeOfPredicates, 39 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available [2023-01-27 18:02:09,804 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown !ENTRY org.eclipse.osgi 4 0 2023-01-27 18:02:09.813 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1287163/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438)