/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 08:01:13,042 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 08:01:13,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 08:01:13,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 08:01:13,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 08:01:13,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 08:01:13,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 08:01:13,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 08:01:13,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 08:01:13,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 08:01:13,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 08:01:13,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 08:01:13,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 08:01:13,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 08:01:13,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 08:01:13,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 08:01:13,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 08:01:13,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 08:01:13,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 08:01:13,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 08:01:13,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 08:01:13,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 08:01:13,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 08:01:13,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 08:01:13,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 08:01:13,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 08:01:13,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 08:01:13,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 08:01:13,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 08:01:13,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 08:01:13,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 08:01:13,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 08:01:13,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 08:01:13,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 08:01:13,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 08:01:13,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 08:01:13,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 08:01:13,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 08:01:13,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 08:01:13,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 08:01:13,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 08:01:13,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 08:01:13,134 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 08:01:13,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 08:01:13,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 08:01:13,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 08:01:13,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 08:01:13,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 08:01:13,136 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 08:01:13,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 08:01:13,136 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 08:01:13,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 08:01:13,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 08:01:13,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 08:01:13,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 08:01:13,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 08:01:13,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 08:01:13,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 08:01:13,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 08:01:13,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 08:01:13,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 08:01:13,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 08:01:13,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 08:01:13,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 08:01:13,139 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 08:01:13,139 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 08:01:13,139 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 08:01:13,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 08:01:13,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 08:01:13,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 08:01:13,348 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 08:01:13,349 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 08:01:13,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-01-28 08:01:14,357 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 08:01:14,552 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 08:01:14,553 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-01-28 08:01:14,564 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcd113d4/3ac26bb817ff412182eff434cd4cad24/FLAG200e1aaa7 [2023-01-28 08:01:14,573 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfcd113d4/3ac26bb817ff412182eff434cd4cad24 [2023-01-28 08:01:14,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 08:01:14,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 08:01:14,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 08:01:14,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 08:01:14,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 08:01:14,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:01:14" (1/1) ... [2023-01-28 08:01:14,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5d605e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:14, skipping insertion in model container [2023-01-28 08:01:14,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:01:14" (1/1) ... [2023-01-28 08:01:14,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 08:01:14,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 08:01:14,932 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-01-28 08:01:14,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 08:01:14,978 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 08:01:15,011 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-01-28 08:01:15,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 08:01:15,057 INFO L208 MainTranslator]: Completed translation [2023-01-28 08:01:15,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15 WrapperNode [2023-01-28 08:01:15,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 08:01:15,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 08:01:15,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 08:01:15,059 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 08:01:15,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,113 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-01-28 08:01:15,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 08:01:15,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 08:01:15,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 08:01:15,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 08:01:15,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,151 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 08:01:15,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 08:01:15,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 08:01:15,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 08:01:15,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (1/1) ... [2023-01-28 08:01:15,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 08:01:15,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:15,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 08:01:15,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 08:01:15,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-01-28 08:01:15,219 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 08:01:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 08:01:15,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 08:01:15,220 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 08:01:15,357 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 08:01:15,358 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 08:01:15,622 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 08:01:15,628 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 08:01:15,628 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-01-28 08:01:15,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:01:15 BoogieIcfgContainer [2023-01-28 08:01:15,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 08:01:15,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 08:01:15,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 08:01:15,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 08:01:15,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 08:01:14" (1/3) ... [2023-01-28 08:01:15,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1459f219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:01:15, skipping insertion in model container [2023-01-28 08:01:15,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:01:15" (2/3) ... [2023-01-28 08:01:15,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1459f219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:01:15, skipping insertion in model container [2023-01-28 08:01:15,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:01:15" (3/3) ... [2023-01-28 08:01:15,635 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-01-28 08:01:15,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 08:01:15,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-28 08:01:15,647 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 08:01:15,704 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-01-28 08:01:15,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-01-28 08:01:15,801 INFO L130 PetriNetUnfolder]: 45/263 cut-off events. [2023-01-28 08:01:15,802 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-01-28 08:01:15,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 263 events. 45/263 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-01-28 08:01:15,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-01-28 08:01:15,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:15,822 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:01:15,840 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:15,842 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:15,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:15,894 INFO L130 PetriNetUnfolder]: 44/258 cut-off events. [2023-01-28 08:01:15,895 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:15,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 258 events. 44/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 778 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-01-28 08:01:15,903 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-01-28 08:01:17,953 INFO L134 LiptonReduction]: Checked pairs total: 17790 [2023-01-28 08:01:17,954 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-01-28 08:01:17,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 08:01:17,991 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;@303d4d08, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:01:17,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 08:01:17,994 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2023-01-28 08:01:17,994 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:17,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:17,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 08:01:17,995 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 08:01:17,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:17,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1355205613, now seen corresponding path program 1 times [2023-01-28 08:01:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:18,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871673760] [2023-01-28 08:01:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:18,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:18,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871673760] [2023-01-28 08:01:18,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871673760] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:18,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:01:18,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:01:18,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983122888] [2023-01-28 08:01:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:18,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:01:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:18,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:01:18,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:01:18,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 357 [2023-01-28 08:01:18,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:18,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 357 [2023-01-28 08:01:18,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:18,369 INFO L130 PetriNetUnfolder]: 272/614 cut-off events. [2023-01-28 08:01:18,369 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:18,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 614 events. 272/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3057 event pairs, 238 based on Foata normal form. 118/640 useless extension candidates. Maximal degree in co-relation 1094. Up to 528 conditions per place. [2023-01-28 08:01:18,373 INFO L137 encePairwiseOnDemand]: 332/357 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-01-28 08:01:18,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-01-28 08:01:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:01:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:01:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-01-28 08:01:18,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4892623716153128 [2023-01-28 08:01:18,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-01-28 08:01:18,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-01-28 08:01:18,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:18,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-01-28 08:01:18,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,404 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 524 transitions. [2023-01-28 08:01:18,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-01-28 08:01:18,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:01:18,407 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 105 flow [2023-01-28 08:01:18,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-01-28 08:01:18,410 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-01-28 08:01:18,411 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 105 flow [2023-01-28 08:01:18,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:18,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:18,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 08:01:18,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 08:01:18,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1202044733, now seen corresponding path program 1 times [2023-01-28 08:01:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:18,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483851473] [2023-01-28 08:01:18,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:18,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483851473] [2023-01-28 08:01:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483851473] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619271632] [2023-01-28 08:01:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:18,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:18,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:18,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:18,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 08:01:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:18,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 08:01:18,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:01:18,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:01:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619271632] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:01:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 08:01:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295470144] [2023-01-28 08:01:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:18,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:01:18,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:18,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:01:18,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:01:18,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 357 [2023-01-28 08:01:18,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:18,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 357 [2023-01-28 08:01:18,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:18,746 INFO L130 PetriNetUnfolder]: 255/592 cut-off events. [2023-01-28 08:01:18,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:18,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 592 events. 255/592 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3266 event pairs, 0 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 1120. Up to 497 conditions per place. [2023-01-28 08:01:18,748 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 49 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-01-28 08:01:18,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 237 flow [2023-01-28 08:01:18,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:01:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:01:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2023-01-28 08:01:18,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48179271708683474 [2023-01-28 08:01:18,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 516 transitions. [2023-01-28 08:01:18,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions. [2023-01-28 08:01:18,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:18,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions. [2023-01-28 08:01:18,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 357.0) internal successors, (1428), 4 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,755 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 105 flow. Second operand 3 states and 516 transitions. [2023-01-28 08:01:18,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 237 flow [2023-01-28 08:01:18,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 233 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:18,758 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 109 flow [2023-01-28 08:01:18,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-01-28 08:01:18,758 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-01-28 08:01:18,758 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 109 flow [2023-01-28 08:01:18,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:18,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:18,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:18,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 08:01:18,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:18,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 08:01:18,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash -96419517, now seen corresponding path program 1 times [2023-01-28 08:01:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988505986] [2023-01-28 08:01:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:19,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988505986] [2023-01-28 08:01:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988505986] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:19,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193894817] [2023-01-28 08:01:19,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:19,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:19,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:19,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:19,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 08:01:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:19,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:01:19,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:19,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:19,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193894817] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:19,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:19,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:01:19,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998823456] [2023-01-28 08:01:19,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:19,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:01:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:19,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:01:19,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:01:19,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 357 [2023-01-28 08:01:19,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 156.85714285714286) internal successors, (1098), 7 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:19,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 357 [2023-01-28 08:01:19,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:19,253 INFO L130 PetriNetUnfolder]: 271/599 cut-off events. [2023-01-28 08:01:19,253 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-01-28 08:01:19,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 599 events. 271/599 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2938 event pairs, 238 based on Foata normal form. 3/529 useless extension candidates. Maximal degree in co-relation 1149. Up to 513 conditions per place. [2023-01-28 08:01:19,255 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-01-28 08:01:19,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 199 flow [2023-01-28 08:01:19,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:01:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:01:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 972 transitions. [2023-01-28 08:01:19,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453781512605042 [2023-01-28 08:01:19,257 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 972 transitions. [2023-01-28 08:01:19,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 972 transitions. [2023-01-28 08:01:19,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:19,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 972 transitions. [2023-01-28 08:01:19,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 357.0) internal successors, (2499), 7 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,262 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 109 flow. Second operand 6 states and 972 transitions. [2023-01-28 08:01:19,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 199 flow [2023-01-28 08:01:19,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 08:01:19,265 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 141 flow [2023-01-28 08:01:19,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-01-28 08:01:19,266 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-01-28 08:01:19,266 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 141 flow [2023-01-28 08:01:19,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 156.85714285714286) internal successors, (1098), 7 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:19,267 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:19,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-28 08:01:19,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-01-28 08:01:19,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 08:01:19,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash -888320147, now seen corresponding path program 2 times [2023-01-28 08:01:19,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:19,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984239561] [2023-01-28 08:01:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:19,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:19,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:19,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984239561] [2023-01-28 08:01:19,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984239561] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:19,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790485298] [2023-01-28 08:01:19,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:19,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:19,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 08:01:19,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:01:19,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:19,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-28 08:01:19,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:19,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:01:19,724 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:19,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:19,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:19,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 08:01:19,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:01:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790485298] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:19,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:01:19,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 08:01:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003358235] [2023-01-28 08:01:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:19,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:01:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:19,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:01:19,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 08:01:19,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 357 [2023-01-28 08:01:19,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:19,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 357 [2023-01-28 08:01:19,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:19,957 INFO L130 PetriNetUnfolder]: 278/643 cut-off events. [2023-01-28 08:01:19,957 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2023-01-28 08:01:19,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 643 events. 278/643 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3319 event pairs, 37 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 1242. Up to 369 conditions per place. [2023-01-28 08:01:19,959 INFO L137 encePairwiseOnDemand]: 350/357 looper letters, 43 selfloop transitions, 6 changer transitions 25/81 dead transitions. [2023-01-28 08:01:19,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 359 flow [2023-01-28 08:01:19,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:01:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:01:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-01-28 08:01:19,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39327731092436974 [2023-01-28 08:01:19,961 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-01-28 08:01:19,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-01-28 08:01:19,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:19,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-01-28 08:01:19,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,965 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 141 flow. Second operand 5 states and 702 transitions. [2023-01-28 08:01:19,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 359 flow [2023-01-28 08:01:19,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 345 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:19,967 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 145 flow [2023-01-28 08:01:19,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-01-28 08:01:19,968 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-01-28 08:01:19,968 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 145 flow [2023-01-28 08:01:19,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:19,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:19,968 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:19,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:20,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:20,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 08:01:20,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1713486904, now seen corresponding path program 1 times [2023-01-28 08:01:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:20,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814324876] [2023-01-28 08:01:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 08:01:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:20,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814324876] [2023-01-28 08:01:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814324876] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:20,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640836796] [2023-01-28 08:01:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:20,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:20,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:20,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:20,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 08:01:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:20,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:01:20,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:01:20,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:01:20,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640836796] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:20,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-01-28 08:01:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207881764] [2023-01-28 08:01:20,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:20,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 08:01:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 08:01:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-01-28 08:01:20,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 357 [2023-01-28 08:01:20,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 145 flow. Second operand has 14 states, 14 states have (on average 151.21428571428572) internal successors, (2117), 14 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:20,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:20,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 357 [2023-01-28 08:01:20,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:20,389 INFO L130 PetriNetUnfolder]: 23/76 cut-off events. [2023-01-28 08:01:20,389 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2023-01-28 08:01:20,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 76 events. 23/76 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 0 based on Foata normal form. 18/91 useless extension candidates. Maximal degree in co-relation 155. Up to 46 conditions per place. [2023-01-28 08:01:20,389 INFO L137 encePairwiseOnDemand]: 352/357 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-01-28 08:01:20,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 234 flow [2023-01-28 08:01:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:01:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:01:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2132 transitions. [2023-01-28 08:01:20,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42657062825130054 [2023-01-28 08:01:20,394 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2132 transitions. [2023-01-28 08:01:20,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2132 transitions. [2023-01-28 08:01:20,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:20,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2132 transitions. [2023-01-28 08:01:20,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 152.28571428571428) internal successors, (2132), 14 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:20,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:20,405 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 357.0) internal successors, (5355), 15 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:20,405 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 145 flow. Second operand 14 states and 2132 transitions. [2023-01-28 08:01:20,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 234 flow [2023-01-28 08:01:20,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-01-28 08:01:20,407 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-01-28 08:01:20,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2023-01-28 08:01:20,409 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-01-28 08:01:20,409 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-01-28 08:01:20,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 151.21428571428572) internal successors, (2117), 14 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:20,412 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 08:01:20,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-01-28 08:01:20,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-01-28 08:01:20,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:20,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:20,618 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-01-28 08:01:20,619 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-01-28 08:01:20,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-01-28 08:01:20,643 INFO L130 PetriNetUnfolder]: 45/263 cut-off events. [2023-01-28 08:01:20,644 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-01-28 08:01:20,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 263 events. 45/263 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 814 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-01-28 08:01:20,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-01-28 08:01:20,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:20,645 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:01:20,646 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:20,646 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:20,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-01-28 08:01:20,659 INFO L130 PetriNetUnfolder]: 44/258 cut-off events. [2023-01-28 08:01:20,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:20,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 258 events. 44/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 778 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 146. Up to 8 conditions per place. [2023-01-28 08:01:20,663 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-01-28 08:01:22,502 INFO L134 LiptonReduction]: Checked pairs total: 17496 [2023-01-28 08:01:22,502 INFO L136 LiptonReduction]: Total number of compositions: 162 [2023-01-28 08:01:22,503 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-01-28 08:01:22,504 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;@303d4d08, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:01:22,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-28 08:01:22,506 INFO L130 PetriNetUnfolder]: 7/31 cut-off events. [2023-01-28 08:01:22,506 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:22,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:22,506 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-01-28 08:01:22,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:01:22,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:22,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1690553009, now seen corresponding path program 1 times [2023-01-28 08:01:22,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:22,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419306584] [2023-01-28 08:01:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:22,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419306584] [2023-01-28 08:01:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419306584] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:01:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:01:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683406500] [2023-01-28 08:01:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:22,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:01:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:01:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:01:22,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 355 [2023-01-28 08:01:22,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:22,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 355 [2023-01-28 08:01:22,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:22,596 INFO L130 PetriNetUnfolder]: 272/614 cut-off events. [2023-01-28 08:01:22,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:22,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 614 events. 272/614 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3050 event pairs, 238 based on Foata normal form. 118/640 useless extension candidates. Maximal degree in co-relation 1094. Up to 528 conditions per place. [2023-01-28 08:01:22,597 INFO L137 encePairwiseOnDemand]: 330/355 looper letters, 20 selfloop transitions, 2 changer transitions 18/45 dead transitions. [2023-01-28 08:01:22,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-01-28 08:01:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:01:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:01:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-01-28 08:01:22,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492018779342723 [2023-01-28 08:01:22,599 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-01-28 08:01:22,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-01-28 08:01:22,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:22,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-01-28 08:01:22,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 355.0) internal successors, (1420), 4 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,602 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 524 transitions. [2023-01-28 08:01:22,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-01-28 08:01:22,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:01:22,603 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 69 flow [2023-01-28 08:01:22,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=47, PETRI_TRANSITIONS=27} [2023-01-28 08:01:22,603 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-01-28 08:01:22,603 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 69 flow [2023-01-28 08:01:22,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:22,604 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:22,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 08:01:22,604 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:01:22,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1112596279, now seen corresponding path program 1 times [2023-01-28 08:01:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:22,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606369728] [2023-01-28 08:01:22,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:22,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:22,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:22,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606369728] [2023-01-28 08:01:22,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606369728] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:22,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371979694] [2023-01-28 08:01:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:22,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:22,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:22,630 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:22,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 08:01:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:22,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:01:22,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:22,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:22,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371979694] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:22,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:22,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:01:22,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784545862] [2023-01-28 08:01:22,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:22,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:01:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:22,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:01:22,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:01:22,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 355 [2023-01-28 08:01:22,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:22,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 355 [2023-01-28 08:01:22,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:22,744 INFO L130 PetriNetUnfolder]: 47/129 cut-off events. [2023-01-28 08:01:22,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:22,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 129 events. 47/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 42 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 245. Up to 108 conditions per place. [2023-01-28 08:01:22,745 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-01-28 08:01:22,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-01-28 08:01:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:01:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:01:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 958 transitions. [2023-01-28 08:01:22,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497652582159624 [2023-01-28 08:01:22,747 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 958 transitions. [2023-01-28 08:01:22,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 958 transitions. [2023-01-28 08:01:22,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:22,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 958 transitions. [2023-01-28 08:01:22,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.66666666666666) internal successors, (958), 6 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 355.0) internal successors, (2485), 7 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,752 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 69 flow. Second operand 6 states and 958 transitions. [2023-01-28 08:01:22,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-01-28 08:01:22,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:22,753 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-01-28 08:01:22,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-01-28 08:01:22,754 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-01-28 08:01:22,754 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-01-28 08:01:22,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:22,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:22,754 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-01-28 08:01:22,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:22,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:22,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:01:22,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:22,969 INFO L85 PathProgramCache]: Analyzing trace with hash -374883279, now seen corresponding path program 2 times [2023-01-28 08:01:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:22,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006117459] [2023-01-28 08:01:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:23,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:23,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006117459] [2023-01-28 08:01:23,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006117459] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:23,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247519515] [2023-01-28 08:01:23,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:23,034 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:23,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 08:01:23,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:01:23,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:23,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:01:23,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:23,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:23,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247519515] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:23,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 08:01:23,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179997741] [2023-01-28 08:01:23,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:23,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 08:01:23,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:23,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 08:01:23,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:01:23,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 355 [2023-01-28 08:01:23,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 156.30769230769232) internal successors, (2032), 13 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:23,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:23,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 355 [2023-01-28 08:01:23,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:23,178 INFO L130 PetriNetUnfolder]: 47/135 cut-off events. [2023-01-28 08:01:23,178 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 08:01:23,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 135 events. 47/135 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 381 event pairs, 42 based on Foata normal form. 6/117 useless extension candidates. Maximal degree in co-relation 236. Up to 108 conditions per place. [2023-01-28 08:01:23,179 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-01-28 08:01:23,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-01-28 08:01:23,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:01:23,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:01:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1897 transitions. [2023-01-28 08:01:23,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4453051643192488 [2023-01-28 08:01:23,183 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1897 transitions. [2023-01-28 08:01:23,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1897 transitions. [2023-01-28 08:01:23,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:23,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1897 transitions. [2023-01-28 08:01:23,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 158.08333333333334) internal successors, (1897), 12 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:23,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:23,192 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 355.0) internal successors, (4615), 13 states have internal predecessors, (4615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:23,192 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1897 transitions. [2023-01-28 08:01:23,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-01-28 08:01:23,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:23,194 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-01-28 08:01:23,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=355, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=171, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-01-28 08:01:23,195 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-01-28 08:01:23,195 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-01-28 08:01:23,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 156.30769230769232) internal successors, (2032), 13 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:23,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:23,196 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-01-28 08:01:23,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:23,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:23,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-28 08:01:23,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash 832355953, now seen corresponding path program 3 times [2023-01-28 08:01:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666869036] [2023-01-28 08:01:23,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:01:23,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 08:01:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 08:01:23,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 08:01:23,441 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 08:01:23,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-28 08:01:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 08:01:23,441 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-01-28 08:01:23,441 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-01-28 08:01:23,442 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-01-28 08:01:23,442 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-01-28 08:01:23,474 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 08:01:23,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-01-28 08:01:23,503 INFO L130 PetriNetUnfolder]: 75/430 cut-off events. [2023-01-28 08:01:23,504 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 08:01:23,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-01-28 08:01:23,507 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-01-28 08:01:23,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-01-28 08:01:23,509 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 08:01:23,510 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-01-28 08:01:23,510 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-01-28 08:01:23,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-01-28 08:01:23,537 INFO L130 PetriNetUnfolder]: 75/430 cut-off events. [2023-01-28 08:01:23,537 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-01-28 08:01:23,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 430 events. 75/430 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1680 event pairs, 0 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 265. Up to 12 conditions per place. [2023-01-28 08:01:23,554 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-01-28 08:01:25,994 INFO L134 LiptonReduction]: Checked pairs total: 57444 [2023-01-28 08:01:25,994 INFO L136 LiptonReduction]: Total number of compositions: 223 [2023-01-28 08:01:25,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 08:01:25,998 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;@303d4d08, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 08:01:25,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 08:01:26,000 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2023-01-28 08:01:26,000 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 08:01:26,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:26,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-28 08:01:26,001 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:26,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1267872476, now seen corresponding path program 1 times [2023-01-28 08:01:26,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953786897] [2023-01-28 08:01:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:26,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953786897] [2023-01-28 08:01:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953786897] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:26,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:01:26,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 08:01:26,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067966589] [2023-01-28 08:01:26,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:26,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:01:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:26,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:01:26,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 08:01:26,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 489 [2023-01-28 08:01:26,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:26,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:26,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 489 [2023-01-28 08:01:26,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:26,861 INFO L130 PetriNetUnfolder]: 10521/16515 cut-off events. [2023-01-28 08:01:26,861 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-01-28 08:01:26,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32050 conditions, 16515 events. 10521/16515 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 560. Compared 109597 event pairs, 9818 based on Foata normal form. 2499/16448 useless extension candidates. Maximal degree in co-relation 13969. Up to 15431 conditions per place. [2023-01-28 08:01:26,920 INFO L137 encePairwiseOnDemand]: 455/489 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-01-28 08:01:26,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-01-28 08:01:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:01:26,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:01:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2023-01-28 08:01:26,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49693251533742333 [2023-01-28 08:01:26,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 729 transitions. [2023-01-28 08:01:26,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 729 transitions. [2023-01-28 08:01:26,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:26,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 729 transitions. [2023-01-28 08:01:26,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:26,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:26,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:26,925 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 729 transitions. [2023-01-28 08:01:26,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-01-28 08:01:26,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:01:26,927 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-01-28 08:01:26,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2023-01-28 08:01:26,928 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-01-28 08:01:26,928 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-01-28 08:01:26,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:26,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:26,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:26,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 08:01:26,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:26,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 339768936, now seen corresponding path program 1 times [2023-01-28 08:01:26,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160129660] [2023-01-28 08:01:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:26,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:26,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:26,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160129660] [2023-01-28 08:01:26,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160129660] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:26,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614559167] [2023-01-28 08:01:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:26,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:26,953 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:26,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 08:01:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:27,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-01-28 08:01:27,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:27,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:01:27,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:01:27,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614559167] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:27,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:01:27,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-01-28 08:01:27,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412193998] [2023-01-28 08:01:27,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:27,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 08:01:27,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:27,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 08:01:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:01:27,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 489 [2023-01-28 08:01:27,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:27,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:27,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 489 [2023-01-28 08:01:27,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:27,917 INFO L130 PetriNetUnfolder]: 10399/16491 cut-off events. [2023-01-28 08:01:27,918 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-01-28 08:01:27,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32041 conditions, 16491 events. 10399/16491 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 111617 event pairs, 4650 based on Foata normal form. 0/13963 useless extension candidates. Maximal degree in co-relation 32028. Up to 15399 conditions per place. [2023-01-28 08:01:27,996 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-01-28 08:01:27,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-01-28 08:01:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 08:01:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 08:01:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2023-01-28 08:01:27,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48738922972051807 [2023-01-28 08:01:27,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 715 transitions. [2023-01-28 08:01:27,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 715 transitions. [2023-01-28 08:01:27,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:27,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 715 transitions. [2023-01-28 08:01:28,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:28,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:28,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 489.0) internal successors, (1956), 4 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:28,001 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 715 transitions. [2023-01-28 08:01:28,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-01-28 08:01:28,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:28,005 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-01-28 08:01:28,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-01-28 08:01:28,006 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-01-28 08:01:28,006 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-01-28 08:01:28,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:28,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:28,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:28,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-28 08:01:28,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:28,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:28,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:28,212 INFO L85 PathProgramCache]: Analyzing trace with hash -953345288, now seen corresponding path program 1 times [2023-01-28 08:01:28,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:28,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195026753] [2023-01-28 08:01:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:28,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195026753] [2023-01-28 08:01:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195026753] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694944067] [2023-01-28 08:01:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:28,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:28,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:28,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:28,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 08:01:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:28,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:01:28,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:28,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:28,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694944067] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:28,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:28,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-28 08:01:28,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710423839] [2023-01-28 08:01:28,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:28,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:01:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:28,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:01:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:01:28,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 489 [2023-01-28 08:01:28,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:28,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:28,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 489 [2023-01-28 08:01:28,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:29,126 INFO L130 PetriNetUnfolder]: 10623/16504 cut-off events. [2023-01-28 08:01:29,127 INFO L131 PetriNetUnfolder]: For 685/685 co-relation queries the response was YES. [2023-01-28 08:01:29,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32633 conditions, 16504 events. 10623/16504 cut-off events. For 685/685 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 108095 event pairs, 9818 based on Foata normal form. 3/14244 useless extension candidates. Maximal degree in co-relation 32605. Up to 15417 conditions per place. [2023-01-28 08:01:29,174 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-01-28 08:01:29,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-01-28 08:01:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:01:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:01:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1342 transitions. [2023-01-28 08:01:29,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45739604635310155 [2023-01-28 08:01:29,176 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1342 transitions. [2023-01-28 08:01:29,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1342 transitions. [2023-01-28 08:01:29,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:29,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1342 transitions. [2023-01-28 08:01:29,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 223.66666666666666) internal successors, (1342), 6 states have internal predecessors, (1342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:29,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:29,182 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:29,182 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1342 transitions. [2023-01-28 08:01:29,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-01-28 08:01:29,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:29,183 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-01-28 08:01:29,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2023-01-28 08:01:29,184 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-01-28 08:01:29,184 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-01-28 08:01:29,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:29,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:29,185 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:29,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:29,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-28 08:01:29,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:29,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1739017580, now seen corresponding path program 2 times [2023-01-28 08:01:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:29,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527675659] [2023-01-28 08:01:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 08:01:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:29,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527675659] [2023-01-28 08:01:29,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527675659] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:29,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007296023] [2023-01-28 08:01:29,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:29,446 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:29,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 08:01:29,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-01-28 08:01:29,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:29,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-01-28 08:01:29,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:29,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:01:29,550 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:29,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:29,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-28 08:01:29,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-28 08:01:29,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007296023] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:29,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-28 08:01:29,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-01-28 08:01:29,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140283241] [2023-01-28 08:01:29,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:29,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 08:01:29,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:29,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 08:01:29,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-28 08:01:29,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 489 [2023-01-28 08:01:29,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:29,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:29,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 489 [2023-01-28 08:01:29,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:30,703 INFO L130 PetriNetUnfolder]: 11566/18234 cut-off events. [2023-01-28 08:01:30,703 INFO L131 PetriNetUnfolder]: For 706/706 co-relation queries the response was YES. [2023-01-28 08:01:30,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36407 conditions, 18234 events. 11566/18234 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 124830 event pairs, 2815 based on Foata normal form. 0/16003 useless extension candidates. Maximal degree in co-relation 36371. Up to 13532 conditions per place. [2023-01-28 08:01:30,763 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 135 selfloop transitions, 14 changer transitions 9/169 dead transitions. [2023-01-28 08:01:30,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 169 transitions, 747 flow [2023-01-28 08:01:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:01:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 08:01:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2023-01-28 08:01:30,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4168370824812543 [2023-01-28 08:01:30,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1223 transitions. [2023-01-28 08:01:30,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1223 transitions. [2023-01-28 08:01:30,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:30,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1223 transitions. [2023-01-28 08:01:30,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:30,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:30,771 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 489.0) internal successors, (3423), 7 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:30,771 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1223 transitions. [2023-01-28 08:01:30,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 169 transitions, 747 flow [2023-01-28 08:01:30,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 169 transitions, 733 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:30,774 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-01-28 08:01:30,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=280, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-01-28 08:01:30,774 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-01-28 08:01:30,774 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-01-28 08:01:30,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:30,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:30,775 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:30,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-01-28 08:01:30,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-28 08:01:30,979 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:30,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1147901150, now seen corresponding path program 1 times [2023-01-28 08:01:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707797061] [2023-01-28 08:01:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:30,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:31,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707797061] [2023-01-28 08:01:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707797061] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102712376] [2023-01-28 08:01:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:31,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:31,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:31,039 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:31,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 08:01:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:31,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-28 08:01:31,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:31,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 08:01:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102712376] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:31,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-01-28 08:01:31,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123967063] [2023-01-28 08:01:31,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:31,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 08:01:31,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:31,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 08:01:31,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-01-28 08:01:31,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 489 [2023-01-28 08:01:31,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 214.6153846153846) internal successors, (2790), 13 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:31,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:31,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 489 [2023-01-28 08:01:31,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:32,216 INFO L130 PetriNetUnfolder]: 11004/17512 cut-off events. [2023-01-28 08:01:32,217 INFO L131 PetriNetUnfolder]: For 3607/3607 co-relation queries the response was YES. [2023-01-28 08:01:32,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38053 conditions, 17512 events. 11004/17512 cut-off events. For 3607/3607 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 120725 event pairs, 9683 based on Foata normal form. 6/16099 useless extension candidates. Maximal degree in co-relation 37995. Up to 16586 conditions per place. [2023-01-28 08:01:32,255 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 69 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-01-28 08:01:32,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 476 flow [2023-01-28 08:01:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:01:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:01:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2629 transitions. [2023-01-28 08:01:32,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4480231765507839 [2023-01-28 08:01:32,260 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2629 transitions. [2023-01-28 08:01:32,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2629 transitions. [2023-01-28 08:01:32,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:32,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2629 transitions. [2023-01-28 08:01:32,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 219.08333333333334) internal successors, (2629), 12 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:32,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:32,269 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:32,269 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2629 transitions. [2023-01-28 08:01:32,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 476 flow [2023-01-28 08:01:32,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 08:01:32,275 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-01-28 08:01:32,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=364, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-01-28 08:01:32,275 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-01-28 08:01:32,275 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-01-28 08:01:32,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 214.6153846153846) internal successors, (2790), 13 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:32,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:32,276 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:32,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:32,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 08:01:32,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:32,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:32,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2099969954, now seen corresponding path program 2 times [2023-01-28 08:01:32,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:32,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160579346] [2023-01-28 08:01:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:32,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:01:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:32,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160579346] [2023-01-28 08:01:32,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160579346] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:32,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354700851] [2023-01-28 08:01:32,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:32,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:32,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:32,957 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:32,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 08:01:33,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:01:33,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:33,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2023-01-28 08:01:33,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:33,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:01:33,094 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:33,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:33,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:33,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:33,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:41,218 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_397) |c_~#a~0.base|))) is different from false [2023-01-28 08:01:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:01:41,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354700851] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:41,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:41,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-01-28 08:01:41,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406547721] [2023-01-28 08:01:41,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:41,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 08:01:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:41,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 08:01:41,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=4, NotChecked=22, Total=182 [2023-01-28 08:01:41,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 489 [2023-01-28 08:01:41,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 364 flow. Second operand has 14 states, 14 states have (on average 175.28571428571428) internal successors, (2454), 14 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:41,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:41,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 489 [2023-01-28 08:01:41,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:42,828 INFO L130 PetriNetUnfolder]: 11314/18097 cut-off events. [2023-01-28 08:01:42,828 INFO L131 PetriNetUnfolder]: For 3663/3663 co-relation queries the response was YES. [2023-01-28 08:01:42,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39152 conditions, 18097 events. 11314/18097 cut-off events. For 3663/3663 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 125329 event pairs, 2227 based on Foata normal form. 0/16848 useless extension candidates. Maximal degree in co-relation 39069. Up to 13463 conditions per place. [2023-01-28 08:01:42,874 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 141 selfloop transitions, 22 changer transitions 14/188 dead transitions. [2023-01-28 08:01:42,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 188 transitions, 967 flow [2023-01-28 08:01:42,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 08:01:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 08:01:42,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1373 transitions. [2023-01-28 08:01:42,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40111013730645634 [2023-01-28 08:01:42,876 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1373 transitions. [2023-01-28 08:01:42,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1373 transitions. [2023-01-28 08:01:42,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:42,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1373 transitions. [2023-01-28 08:01:42,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.14285714285714) internal successors, (1373), 7 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:42,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:42,882 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 489.0) internal successors, (3912), 8 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:42,882 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 7 states and 1373 transitions. [2023-01-28 08:01:42,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 188 transitions, 967 flow [2023-01-28 08:01:42,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 188 transitions, 919 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-01-28 08:01:42,889 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 429 flow [2023-01-28 08:01:42,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2023-01-28 08:01:42,890 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 40 predicate places. [2023-01-28 08:01:42,890 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 429 flow [2023-01-28 08:01:42,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 175.28571428571428) internal successors, (2454), 14 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:42,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:42,891 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:42,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-01-28 08:01:43,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 08:01:43,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:43,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:43,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1826183130, now seen corresponding path program 1 times [2023-01-28 08:01:43,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:43,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381134388] [2023-01-28 08:01:43,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:43,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:01:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381134388] [2023-01-28 08:01:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381134388] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651856345] [2023-01-28 08:01:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:43,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:43,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:43,131 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:43,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 08:01:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:43,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-01-28 08:01:43,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:01:43,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:01:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651856345] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:43,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:43,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-01-28 08:01:43,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076332123] [2023-01-28 08:01:43,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:43,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 08:01:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 08:01:43,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-01-28 08:01:43,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 489 [2023-01-28 08:01:43,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 217.42857142857142) internal successors, (1522), 7 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:43,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 489 [2023-01-28 08:01:43,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:43,486 INFO L130 PetriNetUnfolder]: 1336/2540 cut-off events. [2023-01-28 08:01:43,486 INFO L131 PetriNetUnfolder]: For 1250/1250 co-relation queries the response was YES. [2023-01-28 08:01:43,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6202 conditions, 2540 events. 1336/2540 cut-off events. For 1250/1250 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15722 event pairs, 106 based on Foata normal form. 289/2726 useless extension candidates. Maximal degree in co-relation 6139. Up to 1577 conditions per place. [2023-01-28 08:01:43,495 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 92 selfloop transitions, 4 changer transitions 14/117 dead transitions. [2023-01-28 08:01:43,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 117 transitions, 637 flow [2023-01-28 08:01:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 08:01:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 08:01:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1154 transitions. [2023-01-28 08:01:43,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4719836400817996 [2023-01-28 08:01:43,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1154 transitions. [2023-01-28 08:01:43,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1154 transitions. [2023-01-28 08:01:43,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:43,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1154 transitions. [2023-01-28 08:01:43,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 230.8) internal successors, (1154), 5 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 489.0) internal successors, (2934), 6 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 489.0) internal successors, (2934), 6 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,502 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 429 flow. Second operand 5 states and 1154 transitions. [2023-01-28 08:01:43,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 117 transitions, 637 flow [2023-01-28 08:01:43,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 617 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-01-28 08:01:43,506 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 240 flow [2023-01-28 08:01:43,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=84, PETRI_TRANSITIONS=58} [2023-01-28 08:01:43,506 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2023-01-28 08:01:43,507 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 240 flow [2023-01-28 08:01:43,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 217.42857142857142) internal successors, (1522), 7 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:43,507 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:43,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 08:01:43,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 08:01:43,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:43,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1127407452, now seen corresponding path program 1 times [2023-01-28 08:01:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137957971] [2023-01-28 08:01:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:43,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:01:43,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:43,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137957971] [2023-01-28 08:01:43,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137957971] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 08:01:43,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 08:01:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 08:01:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765524480] [2023-01-28 08:01:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 08:01:43,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 08:01:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:43,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 08:01:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 08:01:43,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 489 [2023-01-28 08:01:43,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 58 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:43,859 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 489 [2023-01-28 08:01:43,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:43,977 INFO L130 PetriNetUnfolder]: 513/1008 cut-off events. [2023-01-28 08:01:43,977 INFO L131 PetriNetUnfolder]: For 777/777 co-relation queries the response was YES. [2023-01-28 08:01:43,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 1008 events. 513/1008 cut-off events. For 777/777 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5113 event pairs, 172 based on Foata normal form. 108/1028 useless extension candidates. Maximal degree in co-relation 2515. Up to 568 conditions per place. [2023-01-28 08:01:43,981 INFO L137 encePairwiseOnDemand]: 476/489 looper letters, 54 selfloop transitions, 13 changer transitions 4/77 dead transitions. [2023-01-28 08:01:43,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 456 flow [2023-01-28 08:01:43,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 08:01:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 08:01:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 776 transitions. [2023-01-28 08:01:43,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967280163599182 [2023-01-28 08:01:43,983 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 776 transitions. [2023-01-28 08:01:43,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 776 transitions. [2023-01-28 08:01:43,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:43,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 776 transitions. [2023-01-28 08:01:43,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 489.0) internal successors, (2445), 5 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,986 INFO L175 Difference]: Start difference. First operand has 84 places, 58 transitions, 240 flow. Second operand 4 states and 776 transitions. [2023-01-28 08:01:43,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 456 flow [2023-01-28 08:01:43,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 441 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 08:01:43,988 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 277 flow [2023-01-28 08:01:43,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=83, PETRI_TRANSITIONS=60} [2023-01-28 08:01:43,989 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2023-01-28 08:01:43,989 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 277 flow [2023-01-28 08:01:43,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:43,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:43,989 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:43,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-01-28 08:01:43,989 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:43,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:43,990 INFO L85 PathProgramCache]: Analyzing trace with hash -405498162, now seen corresponding path program 1 times [2023-01-28 08:01:43,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:43,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258150544] [2023-01-28 08:01:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:43,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258150544] [2023-01-28 08:01:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258150544] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903472834] [2023-01-28 08:01:44,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:44,278 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:44,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-28 08:01:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:44,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:01:44,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:44,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:01:44,415 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:44,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:44,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:44,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:44,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:01:44,501 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:44,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:01:44,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:01:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:44,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:44,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-01-28 08:01:44,634 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 12 treesize of output 8 [2023-01-28 08:01:54,669 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_61| Int) (v_ArrVal_585 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_585) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_61| v_ArrVal_588) |v_t_funThread2of2ForFork0_~p~0#1.offset_67|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_61| |v_t_funThread2of2ForFork0_~p~0#1.offset_67|))) is different from false [2023-01-28 08:01:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:01:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903472834] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:01:54,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:01:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-01-28 08:01:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411098105] [2023-01-28 08:01:54,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:01:54,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 08:01:54,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:01:54,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 08:01:54,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=209, Unknown=5, NotChecked=30, Total=306 [2023-01-28 08:01:54,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-01-28 08:01:54,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 60 transitions, 277 flow. Second operand has 18 states, 18 states have (on average 160.66666666666666) internal successors, (2892), 18 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:54,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:01:54,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-01-28 08:01:54,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:01:55,357 INFO L130 PetriNetUnfolder]: 852/1698 cut-off events. [2023-01-28 08:01:55,358 INFO L131 PetriNetUnfolder]: For 1006/1012 co-relation queries the response was YES. [2023-01-28 08:01:55,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4470 conditions, 1698 events. 852/1698 cut-off events. For 1006/1012 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10288 event pairs, 66 based on Foata normal form. 24/1548 useless extension candidates. Maximal degree in co-relation 4410. Up to 697 conditions per place. [2023-01-28 08:01:55,363 INFO L137 encePairwiseOnDemand]: 479/489 looper letters, 104 selfloop transitions, 24 changer transitions 24/158 dead transitions. [2023-01-28 08:01:55,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 928 flow [2023-01-28 08:01:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:01:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:01:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2348 transitions. [2023-01-28 08:01:55,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3429739994157172 [2023-01-28 08:01:55,366 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2348 transitions. [2023-01-28 08:01:55,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2348 transitions. [2023-01-28 08:01:55,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:01:55,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2348 transitions. [2023-01-28 08:01:55,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 167.71428571428572) internal successors, (2348), 14 states have internal predecessors, (2348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:55,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:55,374 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:55,374 INFO L175 Difference]: Start difference. First operand has 83 places, 60 transitions, 277 flow. Second operand 14 states and 2348 transitions. [2023-01-28 08:01:55,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 928 flow [2023-01-28 08:01:55,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 08:01:55,377 INFO L231 Difference]: Finished difference. Result has 101 places, 75 transitions, 426 flow [2023-01-28 08:01:55,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=426, PETRI_PLACES=101, PETRI_TRANSITIONS=75} [2023-01-28 08:01:55,378 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 33 predicate places. [2023-01-28 08:01:55,378 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 426 flow [2023-01-28 08:01:55,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.66666666666666) internal successors, (2892), 18 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:01:55,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:01:55,378 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:01:55,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-01-28 08:01:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 08:01:55,583 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:01:55,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:01:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1647507858, now seen corresponding path program 2 times [2023-01-28 08:01:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:01:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179733458] [2023-01-28 08:01:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:01:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:01:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:01:56,016 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:56,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:01:56,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179733458] [2023-01-28 08:01:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179733458] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:01:56,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821164230] [2023-01-28 08:01:56,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:01:56,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:01:56,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:01:56,018 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:01:56,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-28 08:01:56,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:01:56,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:01:56,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:01:56,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:01:56,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:01:56,187 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:56,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:01:56,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:56,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:01:56,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:01:56,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:56,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:01:56,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:01:56,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:01:56,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:01:56,390 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:01:56,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:01:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:01:56,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:01:56,451 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) 0)))) is different from false [2023-01-28 08:01:56,458 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_674 Int) (v_ArrVal_676 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_674)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_676) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_69|)) 0)))) is different from false [2023-01-28 08:01:56,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:56,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:01:56,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:01:56,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:01:56,491 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 22 treesize of output 18 [2023-01-28 08:02:08,600 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_69| Int) (v_ArrVal_674 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_63| Int) (v_ArrVal_670 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_63| |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_670) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_63| v_ArrVal_674) |v_t_funThread2of2ForFork0_~p~0#1.offset_69|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-01-28 08:02:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:02:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821164230] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:10,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-01-28 08:02:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465998766] [2023-01-28 08:02:10,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:10,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:02:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:10,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:02:10,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=250, Unknown=6, NotChecked=108, Total=462 [2023-01-28 08:02:10,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-01-28 08:02:10,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 75 transitions, 426 flow. Second operand has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:10,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:10,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-01-28 08:02:10,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:11,105 INFO L130 PetriNetUnfolder]: 956/1904 cut-off events. [2023-01-28 08:02:11,105 INFO L131 PetriNetUnfolder]: For 5633/5639 co-relation queries the response was YES. [2023-01-28 08:02:11,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 1904 events. 956/1904 cut-off events. For 5633/5639 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11897 event pairs, 82 based on Foata normal form. 3/1715 useless extension candidates. Maximal degree in co-relation 6538. Up to 911 conditions per place. [2023-01-28 08:02:11,111 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 84 selfloop transitions, 25 changer transitions 16/131 dead transitions. [2023-01-28 08:02:11,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 957 flow [2023-01-28 08:02:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:02:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:02:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1510 transitions. [2023-01-28 08:02:11,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310384003635536 [2023-01-28 08:02:11,113 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1510 transitions. [2023-01-28 08:02:11,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1510 transitions. [2023-01-28 08:02:11,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:11,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1510 transitions. [2023-01-28 08:02:11,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.77777777777777) internal successors, (1510), 9 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:11,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:11,117 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:11,118 INFO L175 Difference]: Start difference. First operand has 101 places, 75 transitions, 426 flow. Second operand 9 states and 1510 transitions. [2023-01-28 08:02:11,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 957 flow [2023-01-28 08:02:11,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 131 transitions, 934 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-01-28 08:02:11,124 INFO L231 Difference]: Finished difference. Result has 107 places, 81 transitions, 530 flow [2023-01-28 08:02:11,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=530, PETRI_PLACES=107, PETRI_TRANSITIONS=81} [2023-01-28 08:02:11,124 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 39 predicate places. [2023-01-28 08:02:11,125 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 81 transitions, 530 flow [2023-01-28 08:02:11,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:11,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:11,125 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:02:11,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-28 08:02:11,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:11,333 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:02:11,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1900505865, now seen corresponding path program 1 times [2023-01-28 08:02:11,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111680805] [2023-01-28 08:02:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:02:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111680805] [2023-01-28 08:02:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111680805] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068876436] [2023-01-28 08:02:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:11,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:11,617 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:02:11,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-28 08:02:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:11,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:02:11,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:11,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:02:11,776 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:11,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:02:11,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:11,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:11,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:02:11,860 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:11,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:02:11,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:02:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:02:11,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:11,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-01-28 08:02:11,984 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 12 treesize of output 8 [2023-01-28 08:02:24,028 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_760 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_65| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_71| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_757) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_71| v_ArrVal_760) |v_t_funThread1of2ForFork0_~p~0#1.offset_65|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_65| |v_t_funThread2of2ForFork0_~p~0#1.offset_71|))) is different from false [2023-01-28 08:02:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:02:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068876436] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:24,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:24,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-01-28 08:02:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210421704] [2023-01-28 08:02:24,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 08:02:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 08:02:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=206, Unknown=7, NotChecked=30, Total=306 [2023-01-28 08:02:24,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-01-28 08:02:24,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 81 transitions, 530 flow. Second operand has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:24,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:24,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-01-28 08:02:24,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:26,644 INFO L130 PetriNetUnfolder]: 1058/2105 cut-off events. [2023-01-28 08:02:26,644 INFO L131 PetriNetUnfolder]: For 9753/9759 co-relation queries the response was YES. [2023-01-28 08:02:26,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8072 conditions, 2105 events. 1058/2105 cut-off events. For 9753/9759 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13626 event pairs, 153 based on Foata normal form. 12/1904 useless extension candidates. Maximal degree in co-relation 8002. Up to 1287 conditions per place. [2023-01-28 08:02:26,652 INFO L137 encePairwiseOnDemand]: 479/489 looper letters, 98 selfloop transitions, 17 changer transitions 19/140 dead transitions. [2023-01-28 08:02:26,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 140 transitions, 1095 flow [2023-01-28 08:02:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:02:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:02:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1522 transitions. [2023-01-28 08:02:26,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458304930697569 [2023-01-28 08:02:26,654 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1522 transitions. [2023-01-28 08:02:26,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1522 transitions. [2023-01-28 08:02:26,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:26,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1522 transitions. [2023-01-28 08:02:26,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.11111111111111) internal successors, (1522), 9 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:26,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:26,658 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:26,658 INFO L175 Difference]: Start difference. First operand has 107 places, 81 transitions, 530 flow. Second operand 9 states and 1522 transitions. [2023-01-28 08:02:26,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 140 transitions, 1095 flow [2023-01-28 08:02:26,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 140 transitions, 1063 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-01-28 08:02:26,669 INFO L231 Difference]: Finished difference. Result has 113 places, 86 transitions, 615 flow [2023-01-28 08:02:26,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=615, PETRI_PLACES=113, PETRI_TRANSITIONS=86} [2023-01-28 08:02:26,669 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 45 predicate places. [2023-01-28 08:02:26,670 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 86 transitions, 615 flow [2023-01-28 08:02:26,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.72222222222223) internal successors, (2893), 18 states have internal predecessors, (2893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:26,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:26,670 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:02:26,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-01-28 08:02:26,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:26,871 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:02:26,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:26,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1405618938, now seen corresponding path program 3 times [2023-01-28 08:02:26,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:26,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672534227] [2023-01-28 08:02:26,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:26,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:29,646 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:02:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672534227] [2023-01-28 08:02:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672534227] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094084901] [2023-01-28 08:02:29,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:02:29,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:29,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:29,648 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:02:29,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-28 08:02:29,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:02:29,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:29,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:02:29,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:29,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:02:29,810 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:29,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:02:29,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:29,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:29,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:02:29,918 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:29,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:02:29,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:02:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:02:30,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:30,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-01-28 08:02:30,085 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 12 treesize of output 8 [2023-01-28 08:02:36,132 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_67| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_846 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_67| |v_t_funThread2of2ForFork0_~p~0#1.offset_73|) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_842) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_67| v_ArrVal_846) |v_t_funThread2of2ForFork0_~p~0#1.offset_73|)))) is different from false [2023-01-28 08:02:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:02:36,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094084901] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:36,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:36,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-01-28 08:02:36,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394109188] [2023-01-28 08:02:36,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:36,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 08:02:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:36,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 08:02:36,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=611, Unknown=2, NotChecked=52, Total=812 [2023-01-28 08:02:36,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-01-28 08:02:36,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 86 transitions, 615 flow. Second operand has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:36,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:36,283 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-01-28 08:02:36,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:39,005 INFO L130 PetriNetUnfolder]: 1104/2218 cut-off events. [2023-01-28 08:02:39,006 INFO L131 PetriNetUnfolder]: For 15579/15591 co-relation queries the response was YES. [2023-01-28 08:02:39,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9137 conditions, 2218 events. 1104/2218 cut-off events. For 15579/15591 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14597 event pairs, 174 based on Foata normal form. 12/2007 useless extension candidates. Maximal degree in co-relation 9063. Up to 1384 conditions per place. [2023-01-28 08:02:39,014 INFO L137 encePairwiseOnDemand]: 478/489 looper letters, 92 selfloop transitions, 27 changer transitions 18/143 dead transitions. [2023-01-28 08:02:39,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 143 transitions, 1191 flow [2023-01-28 08:02:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-28 08:02:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-28 08:02:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3016 transitions. [2023-01-28 08:02:39,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.324615219029168 [2023-01-28 08:02:39,017 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3016 transitions. [2023-01-28 08:02:39,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3016 transitions. [2023-01-28 08:02:39,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:39,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3016 transitions. [2023-01-28 08:02:39,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 158.73684210526315) internal successors, (3016), 19 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:39,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 489.0) internal successors, (9780), 20 states have internal predecessors, (9780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:39,024 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 489.0) internal successors, (9780), 20 states have internal predecessors, (9780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:39,024 INFO L175 Difference]: Start difference. First operand has 113 places, 86 transitions, 615 flow. Second operand 19 states and 3016 transitions. [2023-01-28 08:02:39,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 143 transitions, 1191 flow [2023-01-28 08:02:39,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 143 transitions, 1077 flow, removed 44 selfloop flow, removed 5 redundant places. [2023-01-28 08:02:39,044 INFO L231 Difference]: Finished difference. Result has 129 places, 91 transitions, 657 flow [2023-01-28 08:02:39,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=657, PETRI_PLACES=129, PETRI_TRANSITIONS=91} [2023-01-28 08:02:39,044 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 61 predicate places. [2023-01-28 08:02:39,044 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 91 transitions, 657 flow [2023-01-28 08:02:39,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:39,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:39,045 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:02:39,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-28 08:02:39,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:39,249 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:02:39,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash -59824183, now seen corresponding path program 2 times [2023-01-28 08:02:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856231026] [2023-01-28 08:02:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:39,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:41,315 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 08:02:41,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:41,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856231026] [2023-01-28 08:02:41,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856231026] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:41,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979532478] [2023-01-28 08:02:41,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:02:41,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:41,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:41,317 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:02:41,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-28 08:02:41,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:02:41,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:41,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 08:02:41,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:41,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:02:41,509 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:41,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:02:41,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:41,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:41,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:02:41,626 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:41,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:02:41,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:02:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:02:41,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:41,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-01-28 08:02:41,793 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 12 treesize of output 8 [2023-01-28 08:02:53,845 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_69| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_75| Int) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_931 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_69| |v_t_funThread2of2ForFork0_~p~0#1.offset_75|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_927) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_75| v_ArrVal_931) |v_t_funThread1of2ForFork0_~p~0#1.offset_69|) 0))) is different from false [2023-01-28 08:02:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:02:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979532478] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:02:53,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:02:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-01-28 08:02:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942305295] [2023-01-28 08:02:53,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:02:53,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 08:02:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:02:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 08:02:53,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=611, Unknown=3, NotChecked=52, Total=812 [2023-01-28 08:02:53,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-01-28 08:02:53,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 91 transitions, 657 flow. Second operand has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:53,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:02:53,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-01-28 08:02:53,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:02:55,038 INFO L130 PetriNetUnfolder]: 1299/2636 cut-off events. [2023-01-28 08:02:55,038 INFO L131 PetriNetUnfolder]: For 13459/13477 co-relation queries the response was YES. [2023-01-28 08:02:55,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 2636 events. 1299/2636 cut-off events. For 13459/13477 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18419 event pairs, 183 based on Foata normal form. 24/2398 useless extension candidates. Maximal degree in co-relation 10112. Up to 1579 conditions per place. [2023-01-28 08:02:55,049 INFO L137 encePairwiseOnDemand]: 478/489 looper letters, 115 selfloop transitions, 36 changer transitions 26/183 dead transitions. [2023-01-28 08:02:55,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 183 transitions, 1527 flow [2023-01-28 08:02:55,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-28 08:02:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-01-28 08:02:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3817 transitions. [2023-01-28 08:02:55,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3252385821404226 [2023-01-28 08:02:55,052 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3817 transitions. [2023-01-28 08:02:55,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3817 transitions. [2023-01-28 08:02:55,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:02:55,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3817 transitions. [2023-01-28 08:02:55,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 159.04166666666666) internal successors, (3817), 24 states have internal predecessors, (3817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:55,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 489.0) internal successors, (12225), 25 states have internal predecessors, (12225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:55,061 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 489.0) internal successors, (12225), 25 states have internal predecessors, (12225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:55,061 INFO L175 Difference]: Start difference. First operand has 129 places, 91 transitions, 657 flow. Second operand 24 states and 3817 transitions. [2023-01-28 08:02:55,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 183 transitions, 1527 flow [2023-01-28 08:02:55,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 183 transitions, 1423 flow, removed 21 selfloop flow, removed 23 redundant places. [2023-01-28 08:02:55,082 INFO L231 Difference]: Finished difference. Result has 133 places, 105 transitions, 868 flow [2023-01-28 08:02:55,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=868, PETRI_PLACES=133, PETRI_TRANSITIONS=105} [2023-01-28 08:02:55,082 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 65 predicate places. [2023-01-28 08:02:55,082 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 105 transitions, 868 flow [2023-01-28 08:02:55,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 155.06896551724137) internal successors, (4497), 29 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:02:55,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:02:55,083 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:02:55,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-28 08:02:55,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:55,288 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:02:55,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:02:55,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1333605401, now seen corresponding path program 3 times [2023-01-28 08:02:55,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:02:55,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678334136] [2023-01-28 08:02:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:02:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:02:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:02:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:02:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:02:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678334136] [2023-01-28 08:02:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678334136] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:02:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350611173] [2023-01-28 08:02:55,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:02:55,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:02:55,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:02:55,583 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:02:55,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-28 08:02:55,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:02:55,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:02:55,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:02:55,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:02:55,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:02:55,784 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:55,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:02:55,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:55,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:02:55,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:02:55,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:02:55,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:02:55,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:02:55,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:02:55,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:02:55,959 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:02:55,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:02:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:02:55,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:02:56,016 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1018 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int)) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1018) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_71| 4)) 0)))) is different from false [2023-01-28 08:02:56,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:56,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:02:56,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:02:56,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:02:56,079 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 22 treesize of output 18 [2023-01-28 08:03:08,151 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 19 DAG size of output: 17 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:03:08,164 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1016 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_71| |v_t_funThread2of2ForFork0_~p~0#1.offset_77|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1012) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_77| v_ArrVal_1016) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-01-28 08:03:10,337 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:03:10,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350611173] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:10,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:10,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-01-28 08:03:10,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127505963] [2023-01-28 08:03:10,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:10,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:03:10,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:03:10,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=281, Unknown=5, NotChecked=74, Total=462 [2023-01-28 08:03:10,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-01-28 08:03:10,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 105 transitions, 868 flow. Second operand has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:10,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:10,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-01-28 08:03:10,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:11,524 INFO L130 PetriNetUnfolder]: 1336/2808 cut-off events. [2023-01-28 08:03:11,524 INFO L131 PetriNetUnfolder]: For 13548/13548 co-relation queries the response was YES. [2023-01-28 08:03:11,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10570 conditions, 2808 events. 1336/2808 cut-off events. For 13548/13548 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20490 event pairs, 153 based on Foata normal form. 15/2544 useless extension candidates. Maximal degree in co-relation 10496. Up to 1506 conditions per place. [2023-01-28 08:03:11,534 INFO L137 encePairwiseOnDemand]: 477/489 looper letters, 117 selfloop transitions, 40 changer transitions 24/187 dead transitions. [2023-01-28 08:03:11,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 187 transitions, 1701 flow [2023-01-28 08:03:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:03:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:03:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2007 transitions. [2023-01-28 08:03:11,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34202453987730064 [2023-01-28 08:03:11,536 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2007 transitions. [2023-01-28 08:03:11,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2007 transitions. [2023-01-28 08:03:11,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:11,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2007 transitions. [2023-01-28 08:03:11,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 167.25) internal successors, (2007), 12 states have internal predecessors, (2007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:11,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:11,541 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:11,541 INFO L175 Difference]: Start difference. First operand has 133 places, 105 transitions, 868 flow. Second operand 12 states and 2007 transitions. [2023-01-28 08:03:11,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 187 transitions, 1701 flow [2023-01-28 08:03:11,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 187 transitions, 1433 flow, removed 115 selfloop flow, removed 16 redundant places. [2023-01-28 08:03:11,564 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 966 flow [2023-01-28 08:03:11,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=966, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2023-01-28 08:03:11,565 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 64 predicate places. [2023-01-28 08:03:11,565 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 966 flow [2023-01-28 08:03:11,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.3181818181818) internal successors, (3505), 22 states have internal predecessors, (3505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:11,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:11,565 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:03:11,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-01-28 08:03:11,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:11,770 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:03:11,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1672823788, now seen corresponding path program 4 times [2023-01-28 08:03:11,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:11,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183280403] [2023-01-28 08:03:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:03:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183280403] [2023-01-28 08:03:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183280403] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640805692] [2023-01-28 08:03:12,092 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:03:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:12,093 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:03:12,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-28 08:03:12,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:03:12,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:03:12,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:03:12,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:12,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:03:12,297 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:12,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:03:12,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:03:12,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:03:12,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:03:12,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:12,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:03:12,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:03:12,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:12,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:12,480 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:12,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:03:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:03:12,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:12,583 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1102 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1104) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1102)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1105) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0))) is different from false [2023-01-28 08:03:12,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:12,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:03:12,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:12,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:03:12,617 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 22 treesize of output 18 [2023-01-28 08:03:12,672 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1105 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1102 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1102)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1105) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1105 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1102 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1102)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1105) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|))))) is different from false [2023-01-28 08:03:12,705 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1105 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int))) (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1098))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1102))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1105) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1105 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_73| Int) (v_ArrVal_1102 Int) (v_ArrVal_1098 (Array Int Int))) (or (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1098))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_73| v_ArrVal_1102))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1105) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_73| |v_t_funThread2of2ForFork0_~p~0#1.offset_79|)))) is different from false [2023-01-28 08:03:20,752 WARN L222 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:03:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-01-28 08:03:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640805692] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:20,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:20,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-01-28 08:03:20,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609621819] [2023-01-28 08:03:20,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:20,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:03:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:03:20,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=282, Unknown=5, NotChecked=114, Total=506 [2023-01-28 08:03:20,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-01-28 08:03:20,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 966 flow. Second operand has 23 states, 23 states have (on average 159.2173913043478) internal successors, (3662), 23 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:20,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:20,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-01-28 08:03:20,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:21,478 INFO L130 PetriNetUnfolder]: 1298/2734 cut-off events. [2023-01-28 08:03:21,479 INFO L131 PetriNetUnfolder]: For 9492/9536 co-relation queries the response was YES. [2023-01-28 08:03:21,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10143 conditions, 2734 events. 1298/2734 cut-off events. For 9492/9536 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19978 event pairs, 171 based on Foata normal form. 6/2463 useless extension candidates. Maximal degree in co-relation 10074. Up to 1506 conditions per place. [2023-01-28 08:03:21,490 INFO L137 encePairwiseOnDemand]: 481/489 looper letters, 127 selfloop transitions, 22 changer transitions 17/172 dead transitions. [2023-01-28 08:03:21,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 172 transitions, 1542 flow [2023-01-28 08:03:21,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:03:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:03:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1505 transitions. [2023-01-28 08:03:21,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419677346057714 [2023-01-28 08:03:21,492 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1505 transitions. [2023-01-28 08:03:21,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1505 transitions. [2023-01-28 08:03:21,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:21,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1505 transitions. [2023-01-28 08:03:21,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.22222222222223) internal successors, (1505), 9 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:21,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:21,495 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:21,495 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 966 flow. Second operand 9 states and 1505 transitions. [2023-01-28 08:03:21,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 172 transitions, 1542 flow [2023-01-28 08:03:21,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 172 transitions, 1422 flow, removed 47 selfloop flow, removed 6 redundant places. [2023-01-28 08:03:21,534 INFO L231 Difference]: Finished difference. Result has 136 places, 125 transitions, 922 flow [2023-01-28 08:03:21,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=922, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2023-01-28 08:03:21,534 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 68 predicate places. [2023-01-28 08:03:21,534 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 922 flow [2023-01-28 08:03:21,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 159.2173913043478) internal successors, (3662), 23 states have internal predecessors, (3662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:21,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:21,535 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:03:21,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-01-28 08:03:21,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:21,735 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:03:21,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1135009202, now seen corresponding path program 5 times [2023-01-28 08:03:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:21,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100064892] [2023-01-28 08:03:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:03:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100064892] [2023-01-28 08:03:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100064892] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254608238] [2023-01-28 08:03:22,472 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 08:03:22,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:22,473 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:03:22,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-01-28 08:03:22,763 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-28 08:03:22,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:03:22,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:03:22,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:22,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:03:22,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:22,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:03:22,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:03:22,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:03:22,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:03:22,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:03:22,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:23,014 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:23,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:03:23,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:03:23,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:23,088 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-01-28 08:03:23,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:23,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:23,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:03:23,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:23,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:03:23,224 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 22 treesize of output 18 [2023-01-28 08:03:23,247 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1196 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0))) (or (forall ((v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1196 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-01-28 08:03:23,270 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1196 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1195 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_75| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1196 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_75| |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1190))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_75| v_ArrVal_1195))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0)))) is different from false [2023-01-28 08:03:31,354 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:03:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:03:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254608238] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:31,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-01-28 08:03:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144411827] [2023-01-28 08:03:31,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:03:31,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:03:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=344, Unknown=10, NotChecked=78, Total=506 [2023-01-28 08:03:31,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 489 [2023-01-28 08:03:31,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 922 flow. Second operand has 23 states, 23 states have (on average 154.43478260869566) internal successors, (3552), 23 states have internal predecessors, (3552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:31,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:31,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 489 [2023-01-28 08:03:31,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:32,072 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (let ((.cse0 (= (select .cse2 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (.cse1 (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (and .cse0 .cse1 (not (= (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_t_funThread2of2ForFork0_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (and .cse0 (not .cse1) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (exists ((v_ArrVal_1195 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195) (select |c_#memory_int| 4)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_1195 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1193) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_81|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0))) (forall ((v_ArrVal_1195 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1196 (Array Int Int))) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_81|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0))) (forall ((v_ArrVal_1195 Int) (v_ArrVal_1196 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-01-28 08:03:32,379 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1195 Int) (v_ArrVal_1196 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-01-28 08:03:32,672 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1195 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_81| Int) (v_ArrVal_1196 (Array Int Int))) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_81|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1195)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1196) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_81|) 0)))) is different from false [2023-01-28 08:03:33,124 INFO L130 PetriNetUnfolder]: 1407/3023 cut-off events. [2023-01-28 08:03:33,124 INFO L131 PetriNetUnfolder]: For 8276/8320 co-relation queries the response was YES. [2023-01-28 08:03:33,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10922 conditions, 3023 events. 1407/3023 cut-off events. For 8276/8320 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 22866 event pairs, 206 based on Foata normal form. 8/2738 useless extension candidates. Maximal degree in co-relation 10851. Up to 1996 conditions per place. [2023-01-28 08:03:33,136 INFO L137 encePairwiseOnDemand]: 472/489 looper letters, 150 selfloop transitions, 47 changer transitions 55/258 dead transitions. [2023-01-28 08:03:33,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 258 transitions, 2142 flow [2023-01-28 08:03:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-28 08:03:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-28 08:03:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3517 transitions. [2023-01-28 08:03:33,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32691950176612755 [2023-01-28 08:03:33,140 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3517 transitions. [2023-01-28 08:03:33,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3517 transitions. [2023-01-28 08:03:33,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:03:33,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3517 transitions. [2023-01-28 08:03:33,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 159.86363636363637) internal successors, (3517), 22 states have internal predecessors, (3517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:33,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 489.0) internal successors, (11247), 23 states have internal predecessors, (11247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:33,148 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 489.0) internal successors, (11247), 23 states have internal predecessors, (11247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:33,148 INFO L175 Difference]: Start difference. First operand has 136 places, 125 transitions, 922 flow. Second operand 22 states and 3517 transitions. [2023-01-28 08:03:33,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 258 transitions, 2142 flow [2023-01-28 08:03:33,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 258 transitions, 2097 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-01-28 08:03:33,170 INFO L231 Difference]: Finished difference. Result has 160 places, 152 transitions, 1315 flow [2023-01-28 08:03:33,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1315, PETRI_PLACES=160, PETRI_TRANSITIONS=152} [2023-01-28 08:03:33,170 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 92 predicate places. [2023-01-28 08:03:33,170 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 152 transitions, 1315 flow [2023-01-28 08:03:33,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 154.43478260869566) internal successors, (3552), 23 states have internal predecessors, (3552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:33,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:03:33,171 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:03:33,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-01-28 08:03:33,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-01-28 08:03:33,377 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:03:33,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:03:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 403999964, now seen corresponding path program 6 times [2023-01-28 08:03:33,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:03:33,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856476299] [2023-01-28 08:03:33,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:03:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:03:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:03:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:03:33,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:03:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856476299] [2023-01-28 08:03:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856476299] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:03:33,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540848703] [2023-01-28 08:03:33,913 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:03:33,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:03:33,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:03:33,914 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:03:33,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-01-28 08:03:34,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-01-28 08:03:34,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:03:34,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:03:34,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:03:34,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:03:34,145 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:34,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:03:34,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:03:34,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:03:34,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:03:34,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:34,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:03:34,295 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:03:34,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:03:34,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:03:34,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:03:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:03:34,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:03:34,510 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1284))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1285))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1283) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)) 0)))) is different from false [2023-01-28 08:03:34,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:34,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:03:34,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:03:34,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:03:34,536 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 22 treesize of output 18 [2023-01-28 08:03:34,608 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1284 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1284))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1285))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_77| Int) (v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1284 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1284))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_77| v_ArrVal_1285))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-01-28 08:03:42,681 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:03:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2023-01-28 08:03:42,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540848703] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:03:42,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:03:42,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-01-28 08:03:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321107276] [2023-01-28 08:03:42,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:03:42,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:03:42,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:03:42,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:03:42,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=339, Unknown=11, NotChecked=78, Total=506 [2023-01-28 08:03:42,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 489 [2023-01-28 08:03:42,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 152 transitions, 1315 flow. Second operand has 23 states, 23 states have (on average 154.52173913043478) internal successors, (3554), 23 states have internal predecessors, (3554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:03:42,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:03:42,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 489 [2023-01-28 08:03:42,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:03:59,746 WARN L222 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 46 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:04:01,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:03,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:05,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:04:07,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:09,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:11,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:04:13,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:15,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:17,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:19,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:21,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:24,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:45,066 WARN L222 SmtUtils]: Spent 20.41s on a formula simplification. DAG size of input: 61 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:04:47,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:49,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:51,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:04:53,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-28 08:04:55,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:04:57,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 [0, 1] [2023-01-28 08:04:59,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:01,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-28 08:05:03,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:04,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:06,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:08,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:10,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:12,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:14,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:16,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:05:18,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:20,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:05:22,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:24,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:26,652 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-28 08:05:28,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:32,031 INFO L130 PetriNetUnfolder]: 1710/3696 cut-off events. [2023-01-28 08:05:32,032 INFO L131 PetriNetUnfolder]: For 19398/19444 co-relation queries the response was YES. [2023-01-28 08:05:32,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17106 conditions, 3696 events. 1710/3696 cut-off events. For 19398/19444 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 29106 event pairs, 223 based on Foata normal form. 20/3552 useless extension candidates. Maximal degree in co-relation 17026. Up to 1600 conditions per place. [2023-01-28 08:05:32,051 INFO L137 encePairwiseOnDemand]: 471/489 looper letters, 134 selfloop transitions, 22 changer transitions 131/293 dead transitions. [2023-01-28 08:05:32,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 293 transitions, 2916 flow [2023-01-28 08:05:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-28 08:05:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-28 08:05:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3535 transitions. [2023-01-28 08:05:32,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3285926752184421 [2023-01-28 08:05:32,054 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3535 transitions. [2023-01-28 08:05:32,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3535 transitions. [2023-01-28 08:05:32,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:32,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3535 transitions. [2023-01-28 08:05:32,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 160.6818181818182) internal successors, (3535), 22 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:32,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 489.0) internal successors, (11247), 23 states have internal predecessors, (11247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:32,064 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 489.0) internal successors, (11247), 23 states have internal predecessors, (11247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:32,064 INFO L175 Difference]: Start difference. First operand has 160 places, 152 transitions, 1315 flow. Second operand 22 states and 3535 transitions. [2023-01-28 08:05:32,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 293 transitions, 2916 flow [2023-01-28 08:05:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 293 transitions, 2765 flow, removed 57 selfloop flow, removed 10 redundant places. [2023-01-28 08:05:32,116 INFO L231 Difference]: Finished difference. Result has 175 places, 121 transitions, 978 flow [2023-01-28 08:05:32,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=978, PETRI_PLACES=175, PETRI_TRANSITIONS=121} [2023-01-28 08:05:32,116 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 107 predicate places. [2023-01-28 08:05:32,116 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 121 transitions, 978 flow [2023-01-28 08:05:32,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 154.52173913043478) internal successors, (3554), 23 states have internal predecessors, (3554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:32,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:32,117 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:32,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-01-28 08:05:32,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-01-28 08:05:32,322 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:05:32,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:32,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1640620707, now seen corresponding path program 4 times [2023-01-28 08:05:32,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:32,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776005382] [2023-01-28 08:05:32,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:32,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:05:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776005382] [2023-01-28 08:05:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776005382] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020648822] [2023-01-28 08:05:32,572 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:05:32,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:32,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:32,577 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:05:32,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-01-28 08:05:32,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:05:32,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:05:32,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-28 08:05:32,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:32,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:05:32,763 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:32,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:05:32,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:05:32,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:05:32,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:05:32,914 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:32,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:05:32,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:05:33,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:05:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:05:33,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:33,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-01-28 08:05:33,175 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 12 treesize of output 8 [2023-01-28 08:05:33,181 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1375 Int) (v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1374 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1374))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85| v_ArrVal_1375))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1377) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79|) 0))) is different from false [2023-01-28 08:05:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2023-01-28 08:05:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020648822] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:33,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:33,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2023-01-28 08:05:33,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693476432] [2023-01-28 08:05:33,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:33,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 08:05:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:33,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 08:05:33,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=195, Unknown=13, NotChecked=30, Total=306 [2023-01-28 08:05:33,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-01-28 08:05:33,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 121 transitions, 978 flow. Second operand has 18 states, 18 states have (on average 160.88888888888889) internal successors, (2896), 18 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:33,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:33,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-01-28 08:05:33,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:34,008 INFO L130 PetriNetUnfolder]: 1202/2595 cut-off events. [2023-01-28 08:05:34,008 INFO L131 PetriNetUnfolder]: For 12689/12729 co-relation queries the response was YES. [2023-01-28 08:05:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11524 conditions, 2595 events. 1202/2595 cut-off events. For 12689/12729 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18837 event pairs, 224 based on Foata normal form. 9/2433 useless extension candidates. Maximal degree in co-relation 11439. Up to 1446 conditions per place. [2023-01-28 08:05:34,022 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 104 selfloop transitions, 11 changer transitions 54/175 dead transitions. [2023-01-28 08:05:34,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 175 transitions, 1653 flow [2023-01-28 08:05:34,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:05:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:05:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1520 transitions. [2023-01-28 08:05:34,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34537605089752327 [2023-01-28 08:05:34,024 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1520 transitions. [2023-01-28 08:05:34,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1520 transitions. [2023-01-28 08:05:34,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:05:34,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1520 transitions. [2023-01-28 08:05:34,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 168.88888888888889) internal successors, (1520), 9 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:34,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:34,028 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:34,028 INFO L175 Difference]: Start difference. First operand has 175 places, 121 transitions, 978 flow. Second operand 9 states and 1520 transitions. [2023-01-28 08:05:34,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 175 transitions, 1653 flow [2023-01-28 08:05:34,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 175 transitions, 1481 flow, removed 57 selfloop flow, removed 25 redundant places. [2023-01-28 08:05:34,052 INFO L231 Difference]: Finished difference. Result has 141 places, 111 transitions, 803 flow [2023-01-28 08:05:34,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=803, PETRI_PLACES=141, PETRI_TRANSITIONS=111} [2023-01-28 08:05:34,053 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 73 predicate places. [2023-01-28 08:05:34,053 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 111 transitions, 803 flow [2023-01-28 08:05:34,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 160.88888888888889) internal successors, (2896), 18 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:34,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:05:34,053 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:05:34,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-01-28 08:05:34,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-28 08:05:34,257 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:05:34,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:05:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash -128099310, now seen corresponding path program 7 times [2023-01-28 08:05:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:05:34,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173125437] [2023-01-28 08:05:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:05:34,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:05:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:05:34,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:05:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173125437] [2023-01-28 08:05:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173125437] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:05:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660964759] [2023-01-28 08:05:34,537 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 08:05:34,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:05:34,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:05:34,538 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:05:34,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-01-28 08:05:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:05:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-28 08:05:34,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:05:34,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:05:34,720 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:34,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:05:34,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:05:34,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:05:34,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:05:34,791 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:05:34,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:05:34,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:05:34,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:05:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:05:34,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:05:34,899 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:05:34,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-01-28 08:05:34,957 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 12 treesize of output 8 [2023-01-28 08:05:34,961 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1467 (Array Int Int)) (v_ArrVal_1465 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81| v_ArrVal_1465)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) 0))) is different from false [2023-01-28 08:05:34,978 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1467 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1465 Int) (v_ArrVal_1462 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_81| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1462))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81| v_ArrVal_1465))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1467) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_81| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|))) is different from false [2023-01-28 08:05:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:05:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660964759] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:05:35,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:05:35,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2023-01-28 08:05:35,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004746270] [2023-01-28 08:05:35,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:05:35,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-01-28 08:05:35,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:05:35,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-01-28 08:05:35,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=156, Unknown=8, NotChecked=84, Total=306 [2023-01-28 08:05:35,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 489 [2023-01-28 08:05:35,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 111 transitions, 803 flow. Second operand has 18 states, 18 states have (on average 158.44444444444446) internal successors, (2852), 18 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:05:35,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:05:35,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 489 [2023-01-28 08:05:35,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:05:45,156 WARN L222 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 32 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:05:47,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:49,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:51,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:53,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:05:55,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:57,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:05:59,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:01,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:06:03,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:05,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:07,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:09,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:11,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:06:13,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:15,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:17,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:19,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:21,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:06:23,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:25,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:27,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:29,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:31,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:33,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:06:35,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:37,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:39,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:41,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:06:43,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:45,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:47,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:49,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:51,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:06:53,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:55,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:06:57,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:00,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:07:02,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:07:04,832 INFO L130 PetriNetUnfolder]: 918/2035 cut-off events. [2023-01-28 08:07:04,833 INFO L131 PetriNetUnfolder]: For 7008/7046 co-relation queries the response was YES. [2023-01-28 08:07:04,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8202 conditions, 2035 events. 918/2035 cut-off events. For 7008/7046 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14153 event pairs, 239 based on Foata normal form. 8/1856 useless extension candidates. Maximal degree in co-relation 8135. Up to 1215 conditions per place. [2023-01-28 08:07:04,842 INFO L137 encePairwiseOnDemand]: 474/489 looper letters, 113 selfloop transitions, 20 changer transitions 37/176 dead transitions. [2023-01-28 08:07:04,842 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 176 transitions, 1541 flow [2023-01-28 08:07:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-01-28 08:07:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-01-28 08:07:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2141 transitions. [2023-01-28 08:07:04,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33679408526034293 [2023-01-28 08:07:04,853 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2141 transitions. [2023-01-28 08:07:04,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2141 transitions. [2023-01-28 08:07:04,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:07:04,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2141 transitions. [2023-01-28 08:07:04,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 164.69230769230768) internal successors, (2141), 13 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:04,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 489.0) internal successors, (6846), 14 states have internal predecessors, (6846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:04,858 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 489.0) internal successors, (6846), 14 states have internal predecessors, (6846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:04,858 INFO L175 Difference]: Start difference. First operand has 141 places, 111 transitions, 803 flow. Second operand 13 states and 2141 transitions. [2023-01-28 08:07:04,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 176 transitions, 1541 flow [2023-01-28 08:07:04,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 176 transitions, 1495 flow, removed 11 selfloop flow, removed 9 redundant places. [2023-01-28 08:07:04,874 INFO L231 Difference]: Finished difference. Result has 142 places, 115 transitions, 865 flow [2023-01-28 08:07:04,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=865, PETRI_PLACES=142, PETRI_TRANSITIONS=115} [2023-01-28 08:07:04,874 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 74 predicate places. [2023-01-28 08:07:04,874 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 115 transitions, 865 flow [2023-01-28 08:07:04,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 158.44444444444446) internal successors, (2852), 18 states have internal predecessors, (2852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:04,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:07:04,875 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:07:04,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-01-28 08:07:05,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:05,079 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:07:05,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:07:05,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1319320733, now seen corresponding path program 5 times [2023-01-28 08:07:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:07:05,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949036361] [2023-01-28 08:07:05,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 08:07:07,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949036361] [2023-01-28 08:07:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949036361] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301636438] [2023-01-28 08:07:07,553 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 08:07:07,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:07,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:07,554 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:07:07,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-01-28 08:07:07,970 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-01-28 08:07:07,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:07:07,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:07:07,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:07,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:07:08,058 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:08,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:07:08,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:08,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:08,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:07:08,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:07:08,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:07:08,250 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:08,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:07:08,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:07:08,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:07:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:08,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:07:08,390 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:08,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:08,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:07:08,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:08,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:07:08,575 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 22 treesize of output 18 [2023-01-28 08:07:08,668 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1557)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1557)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0))))) is different from false [2023-01-28 08:07:08,709 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1557))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|))) (or (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1552 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1552))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89| v_ArrVal_1557))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-01-28 08:07:16,821 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:07:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:07:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301636438] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:16,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 8] total 31 [2023-01-28 08:07:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286429943] [2023-01-28 08:07:16,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:16,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 08:07:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:16,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 08:07:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=745, Unknown=21, NotChecked=174, Total=1056 [2023-01-28 08:07:16,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 489 [2023-01-28 08:07:16,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 115 transitions, 865 flow. Second operand has 33 states, 33 states have (on average 151.93939393939394) internal successors, (5014), 33 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:16,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:16,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 489 [2023-01-28 08:07:16,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:17,842 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1557)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)))) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1557)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1555) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)))))) is different from false [2023-01-28 08:07:18,099 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (exists ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1557 Int)) (and (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1557) (select |c_#memory_int| 4)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1557)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)))) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (not (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1555 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1557 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1557)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1555) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_83| 4)) 0)))) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-01-28 08:07:18,961 INFO L130 PetriNetUnfolder]: 971/2209 cut-off events. [2023-01-28 08:07:18,961 INFO L131 PetriNetUnfolder]: For 7934/7982 co-relation queries the response was YES. [2023-01-28 08:07:18,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9227 conditions, 2209 events. 971/2209 cut-off events. For 7934/7982 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16092 event pairs, 261 based on Foata normal form. 14/2026 useless extension candidates. Maximal degree in co-relation 9151. Up to 1190 conditions per place. [2023-01-28 08:07:18,972 INFO L137 encePairwiseOnDemand]: 473/489 looper letters, 118 selfloop transitions, 40 changer transitions 66/230 dead transitions. [2023-01-28 08:07:18,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 230 transitions, 1977 flow [2023-01-28 08:07:18,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-01-28 08:07:18,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-01-28 08:07:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 4513 transitions. [2023-01-28 08:07:18,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3182427191312319 [2023-01-28 08:07:18,976 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 4513 transitions. [2023-01-28 08:07:18,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 4513 transitions. [2023-01-28 08:07:18,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:07:18,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 4513 transitions. [2023-01-28 08:07:18,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 155.6206896551724) internal successors, (4513), 29 states have internal predecessors, (4513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:18,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 489.0) internal successors, (14670), 30 states have internal predecessors, (14670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:18,988 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 489.0) internal successors, (14670), 30 states have internal predecessors, (14670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:18,988 INFO L175 Difference]: Start difference. First operand has 142 places, 115 transitions, 865 flow. Second operand 29 states and 4513 transitions. [2023-01-28 08:07:18,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 230 transitions, 1977 flow [2023-01-28 08:07:19,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 230 transitions, 1921 flow, removed 15 selfloop flow, removed 9 redundant places. [2023-01-28 08:07:19,009 INFO L231 Difference]: Finished difference. Result has 169 places, 131 transitions, 1082 flow [2023-01-28 08:07:19,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1082, PETRI_PLACES=169, PETRI_TRANSITIONS=131} [2023-01-28 08:07:19,010 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 101 predicate places. [2023-01-28 08:07:19,010 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 131 transitions, 1082 flow [2023-01-28 08:07:19,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 151.93939393939394) internal successors, (5014), 33 states have internal predecessors, (5014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:19,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:07:19,010 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:07:19,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-01-28 08:07:19,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-01-28 08:07:19,216 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:07:19,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:07:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1933872669, now seen corresponding path program 6 times [2023-01-28 08:07:19,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:07:19,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063103151] [2023-01-28 08:07:19,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:19,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:19,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063103151] [2023-01-28 08:07:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063103151] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992443011] [2023-01-28 08:07:19,525 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 08:07:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:19,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:19,526 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:07:19,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-01-28 08:07:19,879 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-01-28 08:07:19,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:07:19,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 08:07:19,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:19,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:07:19,974 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:19,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:07:19,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:20,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:20,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:07:20,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:07:20,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:07:20,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:07:20,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:07:20,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:07:20,215 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:20,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:07:20,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:07:20,271 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-01-28 08:07:20,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:07:20,290 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1650 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:07:20,348 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1648)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1649) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)))) is different from false [2023-01-28 08:07:20,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:20,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:07:20,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:20,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:07:20,391 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 22 treesize of output 18 [2023-01-28 08:07:20,411 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1648)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1648)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))))) is different from false [2023-01-28 08:07:20,730 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1643 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1643))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1648))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|))) (or (forall ((v_ArrVal_1643 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1650 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1643))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_91| v_ArrVal_1648))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1650) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-01-28 08:07:28,850 WARN L222 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:07:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:07:29,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992443011] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:29,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:29,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-01-28 08:07:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16633924] [2023-01-28 08:07:29,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:29,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 08:07:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 08:07:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=270, Unknown=5, NotChecked=148, Total=506 [2023-01-28 08:07:29,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-01-28 08:07:29,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 131 transitions, 1082 flow. Second operand has 23 states, 23 states have (on average 159.3913043478261) internal successors, (3666), 23 states have internal predecessors, (3666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:29,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:29,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-01-28 08:07:29,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:29,729 INFO L130 PetriNetUnfolder]: 827/1869 cut-off events. [2023-01-28 08:07:29,729 INFO L131 PetriNetUnfolder]: For 11595/11609 co-relation queries the response was YES. [2023-01-28 08:07:29,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9419 conditions, 1869 events. 827/1869 cut-off events. For 11595/11609 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12964 event pairs, 204 based on Foata normal form. 6/1707 useless extension candidates. Maximal degree in co-relation 9326. Up to 957 conditions per place. [2023-01-28 08:07:29,739 INFO L137 encePairwiseOnDemand]: 481/489 looper letters, 120 selfloop transitions, 28 changer transitions 17/171 dead transitions. [2023-01-28 08:07:29,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 171 transitions, 1759 flow [2023-01-28 08:07:29,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 08:07:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 08:07:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1502 transitions. [2023-01-28 08:07:29,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34128607134742106 [2023-01-28 08:07:29,741 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1502 transitions. [2023-01-28 08:07:29,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1502 transitions. [2023-01-28 08:07:29,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:07:29,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1502 transitions. [2023-01-28 08:07:29,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 166.88888888888889) internal successors, (1502), 9 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:29,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:29,745 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 489.0) internal successors, (4890), 10 states have internal predecessors, (4890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:29,745 INFO L175 Difference]: Start difference. First operand has 169 places, 131 transitions, 1082 flow. Second operand 9 states and 1502 transitions. [2023-01-28 08:07:29,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 171 transitions, 1759 flow [2023-01-28 08:07:29,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 171 transitions, 1686 flow, removed 18 selfloop flow, removed 17 redundant places. [2023-01-28 08:07:29,765 INFO L231 Difference]: Finished difference. Result has 158 places, 133 transitions, 1109 flow [2023-01-28 08:07:29,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1109, PETRI_PLACES=158, PETRI_TRANSITIONS=133} [2023-01-28 08:07:29,766 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 90 predicate places. [2023-01-28 08:07:29,766 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 133 transitions, 1109 flow [2023-01-28 08:07:29,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 159.3913043478261) internal successors, (3666), 23 states have internal predecessors, (3666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:29,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:07:29,766 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:07:29,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-01-28 08:07:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:29,967 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:07:29,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:07:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -977855961, now seen corresponding path program 7 times [2023-01-28 08:07:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:07:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763410278] [2023-01-28 08:07:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:07:30,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:30,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763410278] [2023-01-28 08:07:30,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763410278] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:30,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355423895] [2023-01-28 08:07:30,426 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 08:07:30,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:30,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:30,427 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:07:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-01-28 08:07:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:30,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-28 08:07:30,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:30,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:07:30,629 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:30,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:07:30,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:30,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:30,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:07:30,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:07:30,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:07:30,780 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:30,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:07:30,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:07:30,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:07:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-01-28 08:07:30,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:07:31,037 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:31,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:07:31,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:07:31,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:07:31,057 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 22 treesize of output 18 [2023-01-28 08:07:31,218 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_87| |v_t_funThread2of2ForFork0_~p~0#1.offset_93|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_93| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0))))) is different from false [2023-01-28 08:07:31,251 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1735))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_93| v_ArrVal_1739))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_93| Int)) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1735))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_93| v_ArrVal_1739))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_87| |v_t_funThread2of2ForFork0_~p~0#1.offset_93|)))) is different from false [2023-01-28 08:07:39,357 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:07:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:07:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355423895] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:07:39,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:07:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-01-28 08:07:39,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437274463] [2023-01-28 08:07:39,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:07:39,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-28 08:07:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:07:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-28 08:07:39,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=376, Unknown=21, NotChecked=82, Total=552 [2023-01-28 08:07:39,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 489 [2023-01-28 08:07:39,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 133 transitions, 1109 flow. Second operand has 24 states, 24 states have (on average 154.33333333333334) internal successors, (3704), 24 states have internal predecessors, (3704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:39,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:07:39,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 489 [2023-01-28 08:07:39,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:07:40,600 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_1739 Int) (v_ArrVal_1741 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (exists ((v_ArrVal_1739 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1738) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0)))) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~3#1| 4))) (or (<= (+ .cse1 24) |c_t_funThread1of2ForFork0_~p~0#1.offset|) (<= (+ 4 |c_t_funThread1of2ForFork0_~p~0#1.offset|) .cse1))))) is different from false [2023-01-28 08:07:41,094 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_1739 Int) (v_ArrVal_1741 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (not (= (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|) |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (exists ((v_ArrVal_1739 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1738 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1739)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1741) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1738) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0)))))) is different from false [2023-01-28 08:07:41,948 INFO L130 PetriNetUnfolder]: 893/2099 cut-off events. [2023-01-28 08:07:41,949 INFO L131 PetriNetUnfolder]: For 12810/12848 co-relation queries the response was YES. [2023-01-28 08:07:41,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10520 conditions, 2099 events. 893/2099 cut-off events. For 12810/12848 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 15248 event pairs, 210 based on Foata normal form. 12/1919 useless extension candidates. Maximal degree in co-relation 10437. Up to 980 conditions per place. [2023-01-28 08:07:41,961 INFO L137 encePairwiseOnDemand]: 475/489 looper letters, 145 selfloop transitions, 48 changer transitions 104/303 dead transitions. [2023-01-28 08:07:41,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 303 transitions, 3080 flow [2023-01-28 08:07:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-01-28 08:07:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-01-28 08:07:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4466 transitions. [2023-01-28 08:07:41,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3261758691206544 [2023-01-28 08:07:41,965 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4466 transitions. [2023-01-28 08:07:41,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4466 transitions. [2023-01-28 08:07:41,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:07:41,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4466 transitions. [2023-01-28 08:07:41,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 159.5) internal successors, (4466), 28 states have internal predecessors, (4466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:41,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 489.0) internal successors, (14181), 29 states have internal predecessors, (14181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:41,976 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 489.0) internal successors, (14181), 29 states have internal predecessors, (14181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:41,976 INFO L175 Difference]: Start difference. First operand has 158 places, 133 transitions, 1109 flow. Second operand 28 states and 4466 transitions. [2023-01-28 08:07:41,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 303 transitions, 3080 flow [2023-01-28 08:07:42,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 303 transitions, 2997 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-01-28 08:07:42,003 INFO L231 Difference]: Finished difference. Result has 185 places, 147 transitions, 1415 flow [2023-01-28 08:07:42,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1415, PETRI_PLACES=185, PETRI_TRANSITIONS=147} [2023-01-28 08:07:42,004 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 117 predicate places. [2023-01-28 08:07:42,004 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 147 transitions, 1415 flow [2023-01-28 08:07:42,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 154.33333333333334) internal successors, (3704), 24 states have internal predecessors, (3704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:07:42,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:07:42,004 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:07:42,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-01-28 08:07:42,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-01-28 08:07:42,209 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:07:42,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:07:42,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2101323727, now seen corresponding path program 1 times [2023-01-28 08:07:42,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:07:42,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510403321] [2023-01-28 08:07:42,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:42,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:07:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:07:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:07:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510403321] [2023-01-28 08:07:42,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510403321] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:07:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116113587] [2023-01-28 08:07:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:07:42,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:07:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:07:42,719 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:07:42,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-01-28 08:07:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:07:42,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:07:42,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:07:42,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:07:42,899 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:07:42,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:07:42,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:07:43,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2023-01-28 08:07:43,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 08:07:43,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:07:43,142 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:07:43,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:08:09,206 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post40#1|))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:11,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:13,230 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~post37#1|)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:13,240 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1834))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~post37#1|))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:13,250 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1834))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset| (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:15,260 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1834) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset| (select (select |c_#memory_int| |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:15,278 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1834 (Array Int Int)) (v_ArrVal_1833 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1834) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1833) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|)) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-01-28 08:08:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116113587] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:08:15,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:08:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 29 [2023-01-28 08:08:15,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096599959] [2023-01-28 08:08:15,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:08:15,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-28 08:08:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:08:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-28 08:08:15,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=443, Unknown=12, NotChecked=350, Total=930 [2023-01-28 08:08:15,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-01-28 08:08:15,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 147 transitions, 1415 flow. Second operand has 31 states, 31 states have (on average 155.06451612903226) internal successors, (4807), 31 states have internal predecessors, (4807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:08:15,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:08:15,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-01-28 08:08:15,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:08:23,636 WARN L222 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 49 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:08:28,887 INFO L130 PetriNetUnfolder]: 852/1971 cut-off events. [2023-01-28 08:08:28,888 INFO L131 PetriNetUnfolder]: For 16278/16308 co-relation queries the response was YES. [2023-01-28 08:08:28,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10646 conditions, 1971 events. 852/1971 cut-off events. For 16278/16308 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13929 event pairs, 161 based on Foata normal form. 21/1904 useless extension candidates. Maximal degree in co-relation 10557. Up to 930 conditions per place. [2023-01-28 08:08:28,898 INFO L137 encePairwiseOnDemand]: 470/489 looper letters, 168 selfloop transitions, 78 changer transitions 35/287 dead transitions. [2023-01-28 08:08:28,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 287 transitions, 3388 flow [2023-01-28 08:08:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-28 08:08:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-28 08:08:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4319 transitions. [2023-01-28 08:08:28,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32712262364614103 [2023-01-28 08:08:28,902 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4319 transitions. [2023-01-28 08:08:28,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4319 transitions. [2023-01-28 08:08:28,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:08:28,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4319 transitions. [2023-01-28 08:08:28,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 159.96296296296296) internal successors, (4319), 27 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:08:28,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 489.0) internal successors, (13692), 28 states have internal predecessors, (13692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:08:28,911 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 489.0) internal successors, (13692), 28 states have internal predecessors, (13692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:08:28,911 INFO L175 Difference]: Start difference. First operand has 185 places, 147 transitions, 1415 flow. Second operand 27 states and 4319 transitions. [2023-01-28 08:08:28,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 287 transitions, 3388 flow [2023-01-28 08:08:28,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 287 transitions, 3199 flow, removed 83 selfloop flow, removed 11 redundant places. [2023-01-28 08:08:28,942 INFO L231 Difference]: Finished difference. Result has 202 places, 188 transitions, 1973 flow [2023-01-28 08:08:28,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1973, PETRI_PLACES=202, PETRI_TRANSITIONS=188} [2023-01-28 08:08:28,943 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 134 predicate places. [2023-01-28 08:08:28,943 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 188 transitions, 1973 flow [2023-01-28 08:08:28,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 155.06451612903226) internal successors, (4807), 31 states have internal predecessors, (4807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:08:28,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:08:28,943 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:08:28,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-01-28 08:08:29,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:08:29,144 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:08:29,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:08:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 421312015, now seen corresponding path program 2 times [2023-01-28 08:08:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:08:29,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053957328] [2023-01-28 08:08:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:08:29,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:08:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:08:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:08:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:08:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053957328] [2023-01-28 08:08:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053957328] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:08:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509515938] [2023-01-28 08:08:29,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:08:29,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:08:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:08:29,432 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:08:29,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-01-28 08:08:29,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:08:29,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:08:29,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:08:29,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:08:29,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:08:29,620 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:08:29,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:08:29,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:08:29,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:08:29,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-01-28 08:08:29,733 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 21 treesize of output 17 [2023-01-28 08:08:29,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:08:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:08:29,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:08:47,807 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1935) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:47,816 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post40#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1935) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:47,820 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1935) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:47,828 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~post37#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1935) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:49,833 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1935) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:49,847 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1935) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:51,853 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1930 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1930))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1935) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:08:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-01-28 08:08:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509515938] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:08:51,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:08:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 20 [2023-01-28 08:08:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596237026] [2023-01-28 08:08:51,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:08:51,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-01-28 08:08:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:08:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-01-28 08:08:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=165, Unknown=14, NotChecked=224, Total=462 [2023-01-28 08:08:51,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 489 [2023-01-28 08:08:51,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 188 transitions, 1973 flow. Second operand has 22 states, 22 states have (on average 174.13636363636363) internal successors, (3831), 22 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:08:51,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:08:51,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 489 [2023-01-28 08:08:51,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:09:04,003 WARN L222 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:09:06,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:08,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:10,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:12,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-28 08:09:14,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:16,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:18,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:24,174 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:09:24,729 INFO L130 PetriNetUnfolder]: 811/1901 cut-off events. [2023-01-28 08:09:24,729 INFO L131 PetriNetUnfolder]: For 16554/16588 co-relation queries the response was YES. [2023-01-28 08:09:24,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10726 conditions, 1901 events. 811/1901 cut-off events. For 16554/16588 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13647 event pairs, 148 based on Foata normal form. 16/1824 useless extension candidates. Maximal degree in co-relation 10631. Up to 518 conditions per place. [2023-01-28 08:09:24,741 INFO L137 encePairwiseOnDemand]: 474/489 looper letters, 152 selfloop transitions, 46 changer transitions 52/258 dead transitions. [2023-01-28 08:09:24,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 258 transitions, 3239 flow [2023-01-28 08:09:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 08:09:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 08:09:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3035 transitions. [2023-01-28 08:09:24,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3650908216047155 [2023-01-28 08:09:24,744 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3035 transitions. [2023-01-28 08:09:24,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3035 transitions. [2023-01-28 08:09:24,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:09:24,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3035 transitions. [2023-01-28 08:09:24,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 178.52941176470588) internal successors, (3035), 17 states have internal predecessors, (3035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:24,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 489.0) internal successors, (8802), 18 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:24,750 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 489.0) internal successors, (8802), 18 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:24,750 INFO L175 Difference]: Start difference. First operand has 202 places, 188 transitions, 1973 flow. Second operand 17 states and 3035 transitions. [2023-01-28 08:09:24,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 258 transitions, 3239 flow [2023-01-28 08:09:24,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 258 transitions, 2890 flow, removed 111 selfloop flow, removed 11 redundant places. [2023-01-28 08:09:24,791 INFO L231 Difference]: Finished difference. Result has 210 places, 177 transitions, 1744 flow [2023-01-28 08:09:24,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1675, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1744, PETRI_PLACES=210, PETRI_TRANSITIONS=177} [2023-01-28 08:09:24,792 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 142 predicate places. [2023-01-28 08:09:24,792 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 177 transitions, 1744 flow [2023-01-28 08:09:24,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 174.13636363636363) internal successors, (3831), 22 states have internal predecessors, (3831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:24,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:09:24,792 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:09:24,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-01-28 08:09:24,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:24,997 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:09:24,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:09:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash 303420947, now seen corresponding path program 3 times [2023-01-28 08:09:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:09:24,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375952714] [2023-01-28 08:09:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:09:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:09:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:09:25,293 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:09:25,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:09:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375952714] [2023-01-28 08:09:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375952714] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:09:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51532819] [2023-01-28 08:09:25,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:09:25,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:09:25,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:09:25,295 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:09:25,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-01-28 08:09:25,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 08:09:25,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:09:25,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 08:09:25,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:09:25,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:09:25,521 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:09:25,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:09:25,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:09:25,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-28 08:09:25,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:09:25,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:09:25,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:09:25,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:09:25,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:09:25,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 08:09:25,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:09:25,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 08:09:25,809 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:09:25,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-01-28 08:09:25,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-01-28 08:09:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:09:25,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:09:26,013 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2036 Int) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2035))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2036))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2034) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_99|)) 0)))) is different from false [2023-01-28 08:09:26,048 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2031 Int) (v_ArrVal_2036 Int) (v_ArrVal_2035 (Array Int Int)) (v_ArrVal_2034 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2034) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_99|)) 0)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2031)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2035))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2036))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0))) is different from false [2023-01-28 08:09:26,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:09:26,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-01-28 08:09:26,108 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 08:09:26,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-01-28 08:09:26,113 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 22 treesize of output 18 [2023-01-28 08:09:26,231 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2031 Int) (v_ArrVal_2036 Int) (v_ArrVal_2035 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_93| |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2031)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2035) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2036) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0))) (or (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2031 Int) (v_ArrVal_2036 Int) (v_ArrVal_2035 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int)) (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2031)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2035) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2036) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-01-28 08:09:26,253 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2031 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 Int) (v_ArrVal_2035 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_93| |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2031))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2035) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2036) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2031 Int) (v_ArrVal_2027 (Array Int Int)) (v_ArrVal_2036 Int) (v_ArrVal_2035 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_93| Int)) (= (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2027))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2031))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2035) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_93| v_ArrVal_2036) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0)))) is different from false [2023-01-28 08:09:34,324 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:09:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-01-28 08:09:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51532819] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:09:34,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:09:34,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 25 [2023-01-28 08:09:34,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835204196] [2023-01-28 08:09:34,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:09:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:09:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:09:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:09:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=438, Unknown=5, NotChecked=180, Total=702 [2023-01-28 08:09:34,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-01-28 08:09:34,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 177 transitions, 1744 flow. Second operand has 27 states, 27 states have (on average 155.33333333333334) internal successors, (4194), 27 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:09:34,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:09:34,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-01-28 08:09:34,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:09:48,637 WARN L222 SmtUtils]: Spent 14.06s on a formula simplification. DAG size of input: 41 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:09:50,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:52,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:54,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:56,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:09:58,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:00,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:02,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:04,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:06,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:08,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:10,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:13,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:15,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:17,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:19,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:21,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:23,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:25,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:27,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:31,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:33,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:35,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-28 08:10:37,658 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 [0, 1] [2023-01-28 08:10:39,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:41,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:43,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:10:47,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:49,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:10:51,533 INFO L130 PetriNetUnfolder]: 666/1594 cut-off events. [2023-01-28 08:10:51,533 INFO L131 PetriNetUnfolder]: For 12315/12349 co-relation queries the response was YES. [2023-01-28 08:10:51,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8867 conditions, 1594 events. 666/1594 cut-off events. For 12315/12349 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10968 event pairs, 157 based on Foata normal form. 16/1535 useless extension candidates. Maximal degree in co-relation 8771. Up to 518 conditions per place. [2023-01-28 08:10:51,544 INFO L137 encePairwiseOnDemand]: 476/489 looper letters, 108 selfloop transitions, 24 changer transitions 108/246 dead transitions. [2023-01-28 08:10:51,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 246 transitions, 3097 flow [2023-01-28 08:10:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-28 08:10:51,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-28 08:10:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3184 transitions. [2023-01-28 08:10:51,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32556237218813905 [2023-01-28 08:10:51,547 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3184 transitions. [2023-01-28 08:10:51,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3184 transitions. [2023-01-28 08:10:51,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:10:51,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3184 transitions. [2023-01-28 08:10:51,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 159.2) internal successors, (3184), 20 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:10:51,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 489.0) internal successors, (10269), 21 states have internal predecessors, (10269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:10:51,554 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 489.0) internal successors, (10269), 21 states have internal predecessors, (10269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:10:51,554 INFO L175 Difference]: Start difference. First operand has 210 places, 177 transitions, 1744 flow. Second operand 20 states and 3184 transitions. [2023-01-28 08:10:51,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 246 transitions, 3097 flow [2023-01-28 08:10:51,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 246 transitions, 2900 flow, removed 43 selfloop flow, removed 18 redundant places. [2023-01-28 08:10:51,583 INFO L231 Difference]: Finished difference. Result has 204 places, 124 transitions, 1156 flow [2023-01-28 08:10:51,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1156, PETRI_PLACES=204, PETRI_TRANSITIONS=124} [2023-01-28 08:10:51,584 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 136 predicate places. [2023-01-28 08:10:51,584 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 124 transitions, 1156 flow [2023-01-28 08:10:51,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 155.33333333333334) internal successors, (4194), 27 states have internal predecessors, (4194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:10:51,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:10:51,584 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:10:51,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-01-28 08:10:51,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:51,789 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:10:51,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:10:51,789 INFO L85 PathProgramCache]: Analyzing trace with hash -51708636, now seen corresponding path program 1 times [2023-01-28 08:10:51,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:10:51,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796729215] [2023-01-28 08:10:51,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:51,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:10:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:10:52,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:10:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796729215] [2023-01-28 08:10:52,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796729215] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:10:52,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767342899] [2023-01-28 08:10:52,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:10:52,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:10:52,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:10:52,058 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:10:52,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-01-28 08:10:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:10:52,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:10:52,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:10:52,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:10:52,280 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:10:52,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:10:52,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:52,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:10:52,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 08:10:52,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:10:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:10:52,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:11:10,542 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:11:12,549 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:11:14,556 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:11:16,565 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:11:16,583 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2130 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2130) |c_~#a~0.base|))) is different from false [2023-01-28 08:11:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:11:16,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767342899] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:11:16,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:11:16,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 24 [2023-01-28 08:11:16,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077422427] [2023-01-28 08:11:16,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:11:16,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-28 08:11:16,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:11:16,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-28 08:11:16,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=351, Unknown=13, NotChecked=210, Total=650 [2023-01-28 08:11:16,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 489 [2023-01-28 08:11:16,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 124 transitions, 1156 flow. Second operand has 26 states, 26 states have (on average 174.42307692307693) internal successors, (4535), 26 states have internal predecessors, (4535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:11:16,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:11:16,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 489 [2023-01-28 08:11:16,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:11:26,821 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 30 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:11:34,871 WARN L222 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 36 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:12:00,991 WARN L222 SmtUtils]: Spent 26.04s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:12:03,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:05,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:07,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:09,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:11,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:13,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:15,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:17,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:19,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:21,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:23,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:25,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:12:27,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:29,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:31,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:33,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:35,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:37,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:39,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:41,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-28 08:12:43,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:45,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:47,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:49,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:51,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:53,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:55,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 08:12:57,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:12:59,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:13:01,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:13:01,467 INFO L130 PetriNetUnfolder]: 465/1126 cut-off events. [2023-01-28 08:13:01,467 INFO L131 PetriNetUnfolder]: For 7656/7670 co-relation queries the response was YES. [2023-01-28 08:13:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5962 conditions, 1126 events. 465/1126 cut-off events. For 7656/7670 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7285 event pairs, 47 based on Foata normal form. 14/1101 useless extension candidates. Maximal degree in co-relation 5902. Up to 501 conditions per place. [2023-01-28 08:13:01,474 INFO L137 encePairwiseOnDemand]: 476/489 looper letters, 102 selfloop transitions, 46 changer transitions 8/163 dead transitions. [2023-01-28 08:13:01,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 163 transitions, 1820 flow [2023-01-28 08:13:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 08:13:01,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 08:13:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2497 transitions. [2023-01-28 08:13:01,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3647385334501899 [2023-01-28 08:13:01,476 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2497 transitions. [2023-01-28 08:13:01,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2497 transitions. [2023-01-28 08:13:01,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:13:01,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2497 transitions. [2023-01-28 08:13:01,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 178.35714285714286) internal successors, (2497), 14 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:01,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:01,482 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 489.0) internal successors, (7335), 15 states have internal predecessors, (7335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:01,482 INFO L175 Difference]: Start difference. First operand has 204 places, 124 transitions, 1156 flow. Second operand 14 states and 2497 transitions. [2023-01-28 08:13:01,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 163 transitions, 1820 flow [2023-01-28 08:13:01,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 163 transitions, 1645 flow, removed 33 selfloop flow, removed 35 redundant places. [2023-01-28 08:13:01,499 INFO L231 Difference]: Finished difference. Result has 157 places, 133 transitions, 1208 flow [2023-01-28 08:13:01,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1208, PETRI_PLACES=157, PETRI_TRANSITIONS=133} [2023-01-28 08:13:01,499 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2023-01-28 08:13:01,499 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 133 transitions, 1208 flow [2023-01-28 08:13:01,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 174.42307692307693) internal successors, (4535), 26 states have internal predecessors, (4535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:01,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:13:01,500 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:13:01,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-01-28 08:13:01,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-01-28 08:13:01,701 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:13:01,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:13:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash -893933078, now seen corresponding path program 2 times [2023-01-28 08:13:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:13:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325823335] [2023-01-28 08:13:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:13:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:13:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:13:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:13:03,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:13:03,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325823335] [2023-01-28 08:13:03,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325823335] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:13:03,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649183901] [2023-01-28 08:13:03,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 08:13:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:13:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:13:03,094 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:13:03,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-01-28 08:13:03,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 08:13:03,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:13:03,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 08:13:03,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:13:03,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:13:03,340 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:13:03,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:13:03,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:13:03,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:13:03,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 08:13:03,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-01-28 08:13:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-01-28 08:13:03,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:13:07,748 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:09,771 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:11,776 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:13,785 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:29,929 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2227 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int) (|t_funThread2of2ForFork0_~p~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2227))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-01-28 08:13:30,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649183901] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:13:30,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:13:30,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 29 [2023-01-28 08:13:30,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177103436] [2023-01-28 08:13:30,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:13:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-28 08:13:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:13:30,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-28 08:13:30,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=566, Unknown=7, NotChecked=260, Total=930 [2023-01-28 08:13:30,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 489 [2023-01-28 08:13:30,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 133 transitions, 1208 flow. Second operand has 31 states, 31 states have (on average 150.1290322580645) internal successors, (4654), 31 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:30,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:13:30,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 489 [2023-01-28 08:13:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:13:38,508 WARN L222 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 53 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:13:46,599 WARN L222 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 59 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:13:47,454 INFO L130 PetriNetUnfolder]: 455/1122 cut-off events. [2023-01-28 08:13:47,454 INFO L131 PetriNetUnfolder]: For 6567/6583 co-relation queries the response was YES. [2023-01-28 08:13:47,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 1122 events. 455/1122 cut-off events. For 6567/6583 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7339 event pairs, 54 based on Foata normal form. 23/1106 useless extension candidates. Maximal degree in co-relation 5677. Up to 323 conditions per place. [2023-01-28 08:13:47,460 INFO L137 encePairwiseOnDemand]: 477/489 looper letters, 104 selfloop transitions, 54 changer transitions 14/178 dead transitions. [2023-01-28 08:13:47,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 178 transitions, 1950 flow [2023-01-28 08:13:47,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-28 08:13:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-28 08:13:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2318 transitions. [2023-01-28 08:13:47,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3160190865712338 [2023-01-28 08:13:47,462 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2318 transitions. [2023-01-28 08:13:47,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2318 transitions. [2023-01-28 08:13:47,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:13:47,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2318 transitions. [2023-01-28 08:13:47,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 154.53333333333333) internal successors, (2318), 15 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:47,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 489.0) internal successors, (7824), 16 states have internal predecessors, (7824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:47,468 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 489.0) internal successors, (7824), 16 states have internal predecessors, (7824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:47,468 INFO L175 Difference]: Start difference. First operand has 157 places, 133 transitions, 1208 flow. Second operand 15 states and 2318 transitions. [2023-01-28 08:13:47,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 178 transitions, 1950 flow [2023-01-28 08:13:47,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 178 transitions, 1829 flow, removed 19 selfloop flow, removed 11 redundant places. [2023-01-28 08:13:47,482 INFO L231 Difference]: Finished difference. Result has 164 places, 138 transitions, 1312 flow [2023-01-28 08:13:47,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1312, PETRI_PLACES=164, PETRI_TRANSITIONS=138} [2023-01-28 08:13:47,483 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 96 predicate places. [2023-01-28 08:13:47,483 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 138 transitions, 1312 flow [2023-01-28 08:13:47,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 150.1290322580645) internal successors, (4654), 31 states have internal predecessors, (4654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:47,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:13:47,484 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:13:47,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-01-28 08:13:47,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-01-28 08:13:47,689 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:13:47,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:13:47,689 INFO L85 PathProgramCache]: Analyzing trace with hash 49602417, now seen corresponding path program 4 times [2023-01-28 08:13:47,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:13:47,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767570907] [2023-01-28 08:13:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:13:47,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:13:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:13:48,001 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-01-28 08:13:48,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:13:48,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767570907] [2023-01-28 08:13:48,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767570907] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:13:48,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812750842] [2023-01-28 08:13:48,002 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:13:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:13:48,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:13:48,003 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:13:48,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-01-28 08:13:48,153 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:13:48,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:13:48,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-28 08:13:48,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:13:48,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:13:48,209 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:13:48,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:13:48,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:13:48,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:13:48,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-01-28 08:13:48,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-01-28 08:13:48,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-01-28 08:13:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-01-28 08:13:48,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:13:52,452 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post40#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|))) is different from false [2023-01-28 08:13:52,459 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2331 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post40#1|)))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:52,468 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2331 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:52,480 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2331 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ |c_t_funThread1of2ForFork0_#t~post37#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~post37#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:52,488 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2331 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (let ((.cse1 (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:52,504 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2331 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (let ((.cse1 (select .cse2 |t_funThread1of2ForFork0_~p~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 |t_funThread1of2ForFork0_~p~0#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset| .cse1))))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:54,605 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2328 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2331 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2328))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (let ((.cse2 (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2331) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset| .cse2)))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:13:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:13:54,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812750842] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:13:54,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:13:54,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2023-01-28 08:13:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893127447] [2023-01-28 08:13:54,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:13:54,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-28 08:13:54,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:13:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-28 08:13:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=314, Unknown=12, NotChecked=294, Total=702 [2023-01-28 08:13:54,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 489 [2023-01-28 08:13:54,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 138 transitions, 1312 flow. Second operand has 27 states, 27 states have (on average 174.11111111111111) internal successors, (4701), 27 states have internal predecessors, (4701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:54,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:13:54,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 489 [2023-01-28 08:13:54,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:13:59,264 INFO L130 PetriNetUnfolder]: 451/1127 cut-off events. [2023-01-28 08:13:59,265 INFO L131 PetriNetUnfolder]: For 5851/5887 co-relation queries the response was YES. [2023-01-28 08:13:59,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 1127 events. 451/1127 cut-off events. For 5851/5887 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7430 event pairs, 145 based on Foata normal form. 8/1095 useless extension candidates. Maximal degree in co-relation 5829. Up to 597 conditions per place. [2023-01-28 08:13:59,270 INFO L137 encePairwiseOnDemand]: 475/489 looper letters, 96 selfloop transitions, 13 changer transitions 49/162 dead transitions. [2023-01-28 08:13:59,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 162 transitions, 1863 flow [2023-01-28 08:13:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:13:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:13:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2131 transitions. [2023-01-28 08:13:59,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36315610088616224 [2023-01-28 08:13:59,272 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2131 transitions. [2023-01-28 08:13:59,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2131 transitions. [2023-01-28 08:13:59,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:13:59,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2131 transitions. [2023-01-28 08:13:59,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 177.58333333333334) internal successors, (2131), 12 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:59,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:59,276 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:59,276 INFO L175 Difference]: Start difference. First operand has 164 places, 138 transitions, 1312 flow. Second operand 12 states and 2131 transitions. [2023-01-28 08:13:59,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 162 transitions, 1863 flow [2023-01-28 08:13:59,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 162 transitions, 1750 flow, removed 10 selfloop flow, removed 14 redundant places. [2023-01-28 08:13:59,287 INFO L231 Difference]: Finished difference. Result has 161 places, 111 transitions, 1043 flow [2023-01-28 08:13:59,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1043, PETRI_PLACES=161, PETRI_TRANSITIONS=111} [2023-01-28 08:13:59,288 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 93 predicate places. [2023-01-28 08:13:59,288 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 111 transitions, 1043 flow [2023-01-28 08:13:59,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 174.11111111111111) internal successors, (4701), 27 states have internal predecessors, (4701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:13:59,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:13:59,288 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:13:59,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-01-28 08:13:59,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:13:59,493 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:13:59,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:13:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1009808640, now seen corresponding path program 3 times [2023-01-28 08:13:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:13:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795702074] [2023-01-28 08:13:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:13:59,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:13:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:13:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:13:59,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:13:59,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795702074] [2023-01-28 08:13:59,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795702074] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:13:59,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356531398] [2023-01-28 08:13:59,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 08:13:59,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:13:59,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:13:59,821 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:13:59,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-01-28 08:14:00,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 08:14:00,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:14:00,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-28 08:14:00,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:14:00,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:14:00,100 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:14:00,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:14:00,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:14:00,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:14:00,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:14:00,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-01-28 08:14:00,296 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 21 treesize of output 17 [2023-01-28 08:14:00,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:14:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:14:00,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:14:06,361 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2435 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:06,373 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2435 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:06,379 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2435 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:06,389 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2435 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:08,400 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2435 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:08,406 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2435 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:10,419 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2435 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:12,426 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2435 (Array Int Int)) (v_ArrVal_2430 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2430))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2435) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:14:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356531398] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:14:12,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:14:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2023-01-28 08:14:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980367684] [2023-01-28 08:14:12,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:14:12,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 08:14:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:14:12,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 08:14:12,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=231, Unknown=10, NotChecked=296, Total=600 [2023-01-28 08:14:12,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 489 [2023-01-28 08:14:12,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 111 transitions, 1043 flow. Second operand has 25 states, 25 states have (on average 174.2) internal successors, (4355), 25 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:14:12,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:14:12,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 489 [2023-01-28 08:14:12,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:14:12,931 INFO L130 PetriNetUnfolder]: 232/612 cut-off events. [2023-01-28 08:14:12,931 INFO L131 PetriNetUnfolder]: For 3382/3396 co-relation queries the response was YES. [2023-01-28 08:14:12,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 612 events. 232/612 cut-off events. For 3382/3396 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3568 event pairs, 36 based on Foata normal form. 8/620 useless extension candidates. Maximal degree in co-relation 3115. Up to 170 conditions per place. [2023-01-28 08:14:12,934 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 57 selfloop transitions, 14 changer transitions 58/133 dead transitions. [2023-01-28 08:14:12,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 133 transitions, 1492 flow [2023-01-28 08:14:12,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 08:14:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 08:14:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2122 transitions. [2023-01-28 08:14:12,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3616223585548739 [2023-01-28 08:14:12,938 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2122 transitions. [2023-01-28 08:14:12,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2122 transitions. [2023-01-28 08:14:12,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 08:14:12,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2122 transitions. [2023-01-28 08:14:12,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 176.83333333333334) internal successors, (2122), 12 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:14:12,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:14:12,942 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 489.0) internal successors, (6357), 13 states have internal predecessors, (6357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:14:12,942 INFO L175 Difference]: Start difference. First operand has 161 places, 111 transitions, 1043 flow. Second operand 12 states and 2122 transitions. [2023-01-28 08:14:12,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 133 transitions, 1492 flow [2023-01-28 08:14:12,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 133 transitions, 1408 flow, removed 25 selfloop flow, removed 11 redundant places. [2023-01-28 08:14:12,949 INFO L231 Difference]: Finished difference. Result has 134 places, 72 transitions, 568 flow [2023-01-28 08:14:12,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=568, PETRI_PLACES=134, PETRI_TRANSITIONS=72} [2023-01-28 08:14:12,950 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 66 predicate places. [2023-01-28 08:14:12,950 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 72 transitions, 568 flow [2023-01-28 08:14:12,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 174.2) internal successors, (4355), 25 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:14:12,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 08:14:12,950 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 08:14:12,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-01-28 08:14:13,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-01-28 08:14:13,156 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-01-28 08:14:13,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 08:14:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1033367268, now seen corresponding path program 4 times [2023-01-28 08:14:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 08:14:13,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948157521] [2023-01-28 08:14:13,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 08:14:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 08:14:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 08:14:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-01-28 08:14:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 08:14:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948157521] [2023-01-28 08:14:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948157521] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 08:14:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018008727] [2023-01-28 08:14:13,596 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 08:14:13,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 08:14:13,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 08:14:13,597 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 08:14:13,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-01-28 08:14:13,770 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 08:14:13,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 08:14:13,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 44 conjunts are in the unsatisfiable core [2023-01-28 08:14:13,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 08:14:13,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-01-28 08:14:13,825 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 08:14:13,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-28 08:14:13,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:14:13,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:14:13,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-01-28 08:14:14,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2023-01-28 08:14:14,036 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 21 treesize of output 17 [2023-01-28 08:14:14,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-01-28 08:14:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-01-28 08:14:14,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 08:14:24,141 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:24,147 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:24,153 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_#t~post40#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2023-01-28 08:14:26,157 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:28,166 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread2of2ForFork0_#t~post37#1|)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:28,171 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:30,184 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:32,192 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2537 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2532 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2532))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2537) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-01-28 08:14:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-01-28 08:14:32,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018008727] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 08:14:32,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 08:14:32,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 26 [2023-01-28 08:14:32,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026022292] [2023-01-28 08:14:32,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 08:14:32,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 08:14:32,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 08:14:32,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 08:14:32,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=329, Unknown=12, NotChecked=344, Total=756 [2023-01-28 08:14:32,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 489 [2023-01-28 08:14:32,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 72 transitions, 568 flow. Second operand has 28 states, 28 states have (on average 167.17857142857142) internal successors, (4681), 28 states have internal predecessors, (4681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 08:14:32,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 08:14:32,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 489 [2023-01-28 08:14:32,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 08:14:54,378 WARN L222 SmtUtils]: Spent 22.04s on a formula simplification. DAG size of input: 52 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 08:14:56,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:14:58,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:00,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:02,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:04,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:06,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:08,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:10,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:12,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:14,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:16,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 08:15:18,460 WARN L539 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-28 08:15:29,963 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:15:29,963 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 08:15:30,530 WARN L238 SmtUtils]: Removed 2 from assertion stack [2023-01-28 08:15:30,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 08:15:30,531 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 08:15:30,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-01-28 08:15:30,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-01-28 08:15:30,731 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 54 for 12024ms.. [2023-01-28 08:15:30,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-01-28 08:15:30,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-01-28 08:15:30,731 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-01-28 08:15:30,732 INFO L445 BasicCegarLoop]: Path program histogram: [7, 7, 4, 4, 2, 2, 1, 1, 1, 1] [2023-01-28 08:15:30,732 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-01-28 08:15:30,732 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-01-28 08:15:30,732 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 08:15:30,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:15:30 BasicIcfg [2023-01-28 08:15:30,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 08:15:30,735 INFO L158 Benchmark]: Toolchain (without parser) took 856160.19ms. Allocated memory was 404.8MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 344.7MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 616.7MB. Max. memory is 16.0GB. [2023-01-28 08:15:30,736 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 08:15:30,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.10ms. Allocated memory is still 404.8MB. Free memory was 344.5MB in the beginning and 358.9MB in the end (delta: -14.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.0GB. [2023-01-28 08:15:30,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.66ms. Allocated memory is still 404.8MB. Free memory was 358.9MB in the beginning and 356.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:15:30,736 INFO L158 Benchmark]: Boogie Preprocessor took 51.70ms. Allocated memory is still 404.8MB. Free memory was 356.3MB in the beginning and 354.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 08:15:30,736 INFO L158 Benchmark]: RCFGBuilder took 462.99ms. Allocated memory is still 404.8MB. Free memory was 354.2MB in the beginning and 335.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-01-28 08:15:30,736 INFO L158 Benchmark]: TraceAbstraction took 855104.31ms. Allocated memory was 404.8MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 334.3MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 604.5MB. Max. memory is 16.0GB. [2023-01-28 08:15:30,737 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 255.9MB. Free memory is still 213.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 482.10ms. Allocated memory is still 404.8MB. Free memory was 344.5MB in the beginning and 358.9MB in the end (delta: -14.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.66ms. Allocated memory is still 404.8MB. Free memory was 358.9MB in the beginning and 356.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.70ms. Allocated memory is still 404.8MB. Free memory was 356.3MB in the beginning and 354.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 462.99ms. Allocated memory is still 404.8MB. Free memory was 354.2MB in the beginning and 335.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 855104.31ms. Allocated memory was 404.8MB in the beginning and 2.6GB in the end (delta: 2.2GB). Free memory was 334.3MB in the beginning and 1.9GB in the end (delta: -1.6GB). Peak memory consumption was 604.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10792 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 164 TotalNumberOfCompositions, 17790 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9093, independent: 8818, independent conditional: 0, independent unconditional: 8818, dependent: 275, dependent conditional: 0, dependent unconditional: 275, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5389, independent: 5328, independent conditional: 0, independent unconditional: 5328, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9093, independent: 3490, independent conditional: 0, independent unconditional: 3490, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 5389, unknown conditional: 0, unknown unconditional: 5389] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 161 PlacesBefore, 45 PlacesAfterwards, 188 TransitionsBefore, 66 TransitionsAfterwards, 10792 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 6 ChoiceCompositions, 162 TotalNumberOfCompositions, 17496 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8947, independent: 8676, independent conditional: 0, independent unconditional: 8676, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5414, independent: 5353, independent conditional: 0, independent unconditional: 5353, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8947, independent: 3323, independent conditional: 0, independent unconditional: 3323, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 5414, unknown conditional: 0, unknown unconditional: 5414] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 181, Positive conditional cache size: 0, Positive unconditional cache size: 181, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 226 PlacesBefore, 68 PlacesAfterwards, 266 TransitionsBefore, 100 TransitionsAfterwards, 33228 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 145 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 223 TotalNumberOfCompositions, 57444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28305, independent: 27868, independent conditional: 0, independent unconditional: 27868, dependent: 437, dependent conditional: 0, dependent unconditional: 437, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16620, independent: 16512, independent conditional: 0, independent unconditional: 16512, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 28305, independent: 11356, independent conditional: 0, independent unconditional: 11356, dependent: 329, dependent conditional: 0, dependent unconditional: 329, unknown: 16620, unknown conditional: 0, unknown unconditional: 16620] , Statistics on independence cache: Total cache size (in pairs): 739, Positive cache size: 696, Positive conditional cache size: 0, Positive unconditional cache size: 696, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 54 for 12024ms.. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 54 for 12024ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 222 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 501 IncrementalHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1 mSDtfsCounter, 501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=4, InterpolantAutomatonStates: 31, 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, 0.6s InterpolantComputationTime, 100 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 303 SizeOfPredicates, 5 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 23/58 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, 281 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: 847.3s, OverallIterations: 30, TraceHistogramMax: 10, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 532.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 518 mSolverCounterUnknown, 4134 SdHoareTripleChecker+Valid, 318.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4134 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 316.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8637 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 846 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16048 IncrementalHoareTripleChecker+Invalid, 26049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 846 mSolverCounterUnsat, 4 mSDtfsCounter, 16048 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2099 GetRequests, 1259 SyntacticMatches, 74 SemanticMatches, 765 ConstructedPredicates, 88 IntricatePredicates, 7 DeprecatedPredicates, 4337 ImplicationChecksByTransitivity, 470.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1973occurred in iteration=23, InterpolantAutomatonStates: 391, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 302.0s InterpolantComputationTime, 1618 NumberOfCodeBlocks, 1580 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 2307 ConstructedInterpolants, 740 QuantifiedInterpolants, 50812 SizeOfPredicates, 228 NumberOfNonLiveVariables, 6473 ConjunctsInSsa, 925 ConjunctsInUnsatCore, 84 InterpolantComputations, 4 PerfectInterpolantSequences, 3965/4339 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 for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 222 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 240 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=3, InterpolantAutomatonStates: 21, 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.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown