./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 18:00:38,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 18:00:38,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 18:00:38,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 18:00:38,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 18:00:38,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 18:00:38,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 18:00:38,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 18:00:38,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 18:00:38,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 18:00:38,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 18:00:38,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 18:00:38,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 18:00:38,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 18:00:38,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 18:00:38,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 18:00:38,949 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 18:00:38,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 18:00:38,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 18:00:38,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 18:00:38,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 18:00:38,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 18:00:38,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 18:00:38,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 18:00:38,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 18:00:38,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 18:00:38,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 18:00:38,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 18:00:38,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 18:00:38,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 18:00:38,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 18:00:38,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 18:00:38,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 18:00:38,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 18:00:38,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 18:00:38,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 18:00:38,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 18:00:38,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 18:00:38,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 18:00:38,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 18:00:38,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 18:00:38,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 18:00:38,996 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 18:00:38,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 18:00:38,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 18:00:38,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 18:00:38,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 18:00:38,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 18:00:38,998 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 18:00:38,998 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 18:00:38,999 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 18:00:38,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 18:00:38,999 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 18:00:39,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 18:00:39,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 18:00:39,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 18:00:39,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 18:00:39,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 18:00:39,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 18:00:39,000 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 18:00:39,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 18:00:39,001 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 18:00:39,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 18:00:39,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 18:00:39,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 18:00:39,001 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 18:00:39,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 18:00:39,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 18:00:39,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 18:00:39,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 18:00:39,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 18:00:39,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 18:00:39,002 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 18:00:39,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 18:00:39,003 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 18:00:39,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 18:00:39,003 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 18:00:39,003 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 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-08-30 18:00:39,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 18:00:39,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 18:00:39,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 18:00:39,237 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 18:00:39,237 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 18:00:39,238 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-08-30 18:00:40,261 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 18:00:40,412 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 18:00:40,414 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-08-30 18:00:40,429 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74afc439d/20d5d1e8e0e9447bb52a5ba206dcad87/FLAGbb03c9f7c [2023-08-30 18:00:40,438 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74afc439d/20d5d1e8e0e9447bb52a5ba206dcad87 [2023-08-30 18:00:40,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 18:00:40,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 18:00:40,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 18:00:40,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 18:00:40,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 18:00:40,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4d0dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40, skipping insertion in model container [2023-08-30 18:00:40,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 18:00:40,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 18:00:40,729 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-08-30 18:00:40,758 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 18:00:40,777 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 18:00:40,809 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-08-30 18:00:40,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 18:00:40,885 INFO L208 MainTranslator]: Completed translation [2023-08-30 18:00:40,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40 WrapperNode [2023-08-30 18:00:40,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 18:00:40,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 18:00:40,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 18:00:40,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 18:00:40,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,943 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 193 [2023-08-30 18:00:40,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 18:00:40,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 18:00:40,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 18:00:40,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 18:00:40,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,979 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 18:00:40,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 18:00:40,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 18:00:40,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 18:00:40,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (1/1) ... [2023-08-30 18:00:40,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 18:00:41,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:41,020 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-08-30 18:00:41,029 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-08-30 18:00:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 18:00:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 18:00:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 18:00:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 18:00:41,070 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 18:00:41,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 18:00:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 18:00:41,073 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 18:00:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 18:00:41,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 18:00:41,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 18:00:41,074 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 18:00:41,180 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 18:00:41,195 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 18:00:41,415 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 18:00:41,423 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 18:00:41,423 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-30 18:00:41,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:00:41 BoogieIcfgContainer [2023-08-30 18:00:41,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 18:00:41,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 18:00:41,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 18:00:41,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 18:00:41,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 06:00:40" (1/3) ... [2023-08-30 18:00:41,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218685b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:00:41, skipping insertion in model container [2023-08-30 18:00:41,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 06:00:40" (2/3) ... [2023-08-30 18:00:41,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218685b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 06:00:41, skipping insertion in model container [2023-08-30 18:00:41,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 06:00:41" (3/3) ... [2023-08-30 18:00:41,438 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-08-30 18:00:41,444 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 18:00:41,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 18:00:41,450 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 18:00:41,450 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 18:00:41,511 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 18:00:41,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-30 18:00:41,618 INFO L130 PetriNetUnfolder]: 45/263 cut-off events. [2023-08-30 18:00:41,621 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 18:00:41,630 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-08-30 18:00:41,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-30 18:00:41,639 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:41,646 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 18:00:41,655 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:41,661 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:41,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:41,706 INFO L130 PetriNetUnfolder]: 44/258 cut-off events. [2023-08-30 18:00:41,707 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:41,710 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-08-30 18:00:41,715 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-30 18:00:43,906 INFO L134 LiptonReduction]: Checked pairs total: 17790 [2023-08-30 18:00:43,906 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-08-30 18:00:43,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 18:00:43,919 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=true, 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;@a710fa3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 18:00:43,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-30 18:00:43,922 INFO L130 PetriNetUnfolder]: 4/19 cut-off events. [2023-08-30 18:00:43,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:43,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:43,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 18:00:43,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 18:00:43,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:43,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1355205613, now seen corresponding path program 1 times [2023-08-30 18:00:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464245274] [2023-08-30 18:00:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:44,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464245274] [2023-08-30 18:00:44,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464245274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:00:44,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:00:44,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 18:00:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643503565] [2023-08-30 18:00:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:00:44,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:00:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:44,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:00:44,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 18:00:44,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-30 18:00:44,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:44,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:44,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-30 18:00:44,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:44,306 INFO L130 PetriNetUnfolder]: 272/614 cut-off events. [2023-08-30 18:00:44,306 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:44,307 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-08-30 18:00:44,310 INFO L137 encePairwiseOnDemand]: 332/357 looper letters, 34 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-30 18:00:44,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-30 18:00:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:00:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:00:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-30 18:00:44,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976657329598506 [2023-08-30 18:00:44,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-30 18:00:44,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-30 18:00:44,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:44,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-30 18:00:44,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:44,346 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-08-30 18:00:44,347 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-08-30 18:00:44,348 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-30 18:00:44,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-30 18:00:44,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:00:44,351 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 105 flow [2023-08-30 18:00:44,352 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-08-30 18:00:44,354 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-30 18:00:44,355 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 105 flow [2023-08-30 18:00:44,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:44,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:44,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:44,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 18:00:44,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 18:00:44,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1202044733, now seen corresponding path program 1 times [2023-08-30 18:00:44,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971179480] [2023-08-30 18:00:44,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971179480] [2023-08-30 18:00:44,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971179480] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:44,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410535084] [2023-08-30 18:00:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:44,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:44,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:44,415 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-08-30 18:00:44,419 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-08-30 18:00:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:44,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 18:00:44,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 18:00:44,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:00:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410535084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:00:44,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:00:44,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 18:00:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727518260] [2023-08-30 18:00:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:00:44,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:00:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:00:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 18:00:44,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 357 [2023-08-30 18:00:44,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:44,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:44,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 357 [2023-08-30 18:00:44,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:44,653 INFO L130 PetriNetUnfolder]: 255/592 cut-off events. [2023-08-30 18:00:44,664 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:44,665 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-08-30 18:00:44,666 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 49 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-30 18:00:44,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 237 flow [2023-08-30 18:00:44,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:00:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:00:44,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-30 18:00:44,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-30 18:00:44,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-30 18:00:44,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-30 18:00:44,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:44,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-30 18:00:44,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:44,672 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-08-30 18:00:44,674 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-08-30 18:00:44,674 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 105 flow. Second operand 3 states and 525 transitions. [2023-08-30 18:00:44,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 237 flow [2023-08-30 18:00:44,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 233 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:44,677 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 109 flow [2023-08-30 18:00:44,677 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-08-30 18:00:44,678 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2023-08-30 18:00:44,678 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 109 flow [2023-08-30 18:00:44,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:44,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:44,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:44,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-30 18:00:44,884 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-08-30 18:00:44,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 18:00:44,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash -96419517, now seen corresponding path program 1 times [2023-08-30 18:00:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488713997] [2023-08-30 18:00:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:44,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488713997] [2023-08-30 18:00:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488713997] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:44,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563042740] [2023-08-30 18:00:44,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:44,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:44,973 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-08-30 18:00:44,975 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-08-30 18:00:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:45,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:00:45,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:45,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563042740] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:45,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:45,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 18:00:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353246704] [2023-08-30 18:00:45,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:45,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:00:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:45,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:00:45,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:00:45,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 357 [2023-08-30 18:00:45,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 109 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:45,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:45,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 357 [2023-08-30 18:00:45,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:45,224 INFO L130 PetriNetUnfolder]: 271/599 cut-off events. [2023-08-30 18:00:45,225 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-30 18:00:45,225 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-08-30 18:00:45,227 INFO L137 encePairwiseOnDemand]: 354/357 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-08-30 18:00:45,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 199 flow [2023-08-30 18:00:45,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:00:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:00:45,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2023-08-30 18:00:45,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45938375350140054 [2023-08-30 18:00:45,229 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2023-08-30 18:00:45,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2023-08-30 18:00:45,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:45,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2023-08-30 18:00:45,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:45,233 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-08-30 18:00:45,234 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-08-30 18:00:45,234 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 109 flow. Second operand 6 states and 984 transitions. [2023-08-30 18:00:45,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 199 flow [2023-08-30 18:00:45,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 195 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 18:00:45,235 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 141 flow [2023-08-30 18:00:45,235 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-08-30 18:00:45,236 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2023-08-30 18:00:45,236 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 141 flow [2023-08-30 18:00:45,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:45,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:45,237 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:45,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 18:00:45,445 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-08-30 18:00:45,445 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 18:00:45,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:45,446 INFO L85 PathProgramCache]: Analyzing trace with hash -888320147, now seen corresponding path program 2 times [2023-08-30 18:00:45,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:45,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16329312] [2023-08-30 18:00:45,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:45,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16329312] [2023-08-30 18:00:45,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16329312] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:45,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657044902] [2023-08-30 18:00:45,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:45,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:45,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:45,560 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-08-30 18:00:45,562 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-08-30 18:00:45,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 18:00:45,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:45,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 18:00:45,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:45,654 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-08-30 18:00:45,707 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:45,708 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-08-30 18:00:45,731 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-08-30 18:00:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 18:00:45,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:00:45,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657044902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:00:45,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:00:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 18:00:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428668545] [2023-08-30 18:00:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:00:45,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:00:45,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:00:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 18:00:45,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 357 [2023-08-30 18:00:45,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:45,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:45,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 357 [2023-08-30 18:00:45,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:46,006 INFO L130 PetriNetUnfolder]: 260/618 cut-off events. [2023-08-30 18:00:46,006 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 18:00:46,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 618 events. 260/618 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3247 event pairs, 31 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1180. Up to 334 conditions per place. [2023-08-30 18:00:46,008 INFO L137 encePairwiseOnDemand]: 350/357 looper letters, 42 selfloop transitions, 6 changer transitions 25/81 dead transitions. [2023-08-30 18:00:46,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 81 transitions, 357 flow [2023-08-30 18:00:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 18:00:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 18:00:46,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2023-08-30 18:00:46,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4599439775910364 [2023-08-30 18:00:46,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2023-08-30 18:00:46,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2023-08-30 18:00:46,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:46,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2023-08-30 18:00:46,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:46,014 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-08-30 18:00:46,015 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-08-30 18:00:46,015 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 141 flow. Second operand 5 states and 821 transitions. [2023-08-30 18:00:46,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 81 transitions, 357 flow [2023-08-30 18:00:46,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 81 transitions, 343 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:46,017 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 145 flow [2023-08-30 18:00:46,017 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-08-30 18:00:46,018 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2023-08-30 18:00:46,018 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 145 flow [2023-08-30 18:00:46,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:46,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:46,018 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:46,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-30 18:00:46,227 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-08-30 18:00:46,227 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 18:00:46,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1713486904, now seen corresponding path program 1 times [2023-08-30 18:00:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:46,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221017664] [2023-08-30 18:00:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:46,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 18:00:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221017664] [2023-08-30 18:00:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221017664] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695393825] [2023-08-30 18:00:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:46,303 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-08-30 18:00:46,305 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-08-30 18:00:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:46,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 18:00:46,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 18:00:46,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 18:00:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695393825] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:46,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:46,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 18:00:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137406625] [2023-08-30 18:00:46,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:46,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 18:00:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 18:00:46,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 18:00:46,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 357 [2023-08-30 18:00:46,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 145 flow. Second operand has 14 states, 14 states have (on average 156.21428571428572) internal successors, (2187), 14 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:46,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:46,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 357 [2023-08-30 18:00:46,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:46,556 INFO L130 PetriNetUnfolder]: 23/76 cut-off events. [2023-08-30 18:00:46,556 INFO L131 PetriNetUnfolder]: For 121/121 co-relation queries the response was YES. [2023-08-30 18:00:46,556 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-08-30 18:00:46,557 INFO L137 encePairwiseOnDemand]: 352/357 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-30 18:00:46,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 234 flow [2023-08-30 18:00:46,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:00:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:00:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2202 transitions. [2023-08-30 18:00:46,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44057623049219685 [2023-08-30 18:00:46,561 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2202 transitions. [2023-08-30 18:00:46,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2202 transitions. [2023-08-30 18:00:46,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:46,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2202 transitions. [2023-08-30 18:00:46,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 157.28571428571428) internal successors, (2202), 14 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:46,572 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-08-30 18:00:46,573 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-08-30 18:00:46,573 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 145 flow. Second operand 14 states and 2202 transitions. [2023-08-30 18:00:46,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 234 flow [2023-08-30 18:00:46,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-30 18:00:46,575 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-30 18:00:46,575 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-08-30 18:00:46,577 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2023-08-30 18:00:46,578 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-30 18:00:46,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 156.21428571428572) internal successors, (2187), 14 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:46,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-30 18:00:46,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-30 18:00:46,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-30 18:00:46,590 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-08-30 18:00:46,788 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-08-30 18:00:46,789 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-30 18:00:46,790 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-30 18:00:46,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 193 transitions, 394 flow [2023-08-30 18:00:46,814 INFO L130 PetriNetUnfolder]: 45/263 cut-off events. [2023-08-30 18:00:46,814 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 18:00:46,815 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-08-30 18:00:46,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 193 transitions, 394 flow [2023-08-30 18:00:46,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:46,816 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 18:00:46,817 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:46,817 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:46,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 188 transitions, 381 flow [2023-08-30 18:00:46,830 INFO L130 PetriNetUnfolder]: 44/258 cut-off events. [2023-08-30 18:00:46,831 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:46,831 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-08-30 18:00:46,834 INFO L119 LiptonReduction]: Number of co-enabled transitions 10792 [2023-08-30 18:00:48,673 INFO L134 LiptonReduction]: Checked pairs total: 17496 [2023-08-30 18:00:48,673 INFO L136 LiptonReduction]: Total number of compositions: 162 [2023-08-30 18:00:48,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 18:00:48,675 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=true, 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;@a710fa3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 18:00:48,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 18:00:48,677 INFO L130 PetriNetUnfolder]: 7/31 cut-off events. [2023-08-30 18:00:48,677 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:48,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:48,677 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 18:00:48,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:00:48,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1690553009, now seen corresponding path program 1 times [2023-08-30 18:00:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:48,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884007117] [2023-08-30 18:00:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:48,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:48,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884007117] [2023-08-30 18:00:48,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884007117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:00:48,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:00:48,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 18:00:48,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062689349] [2023-08-30 18:00:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:00:48,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:00:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:48,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:00:48,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 18:00:48,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 355 [2023-08-30 18:00:48,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:48,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:48,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 355 [2023-08-30 18:00:48,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:48,785 INFO L130 PetriNetUnfolder]: 272/614 cut-off events. [2023-08-30 18:00:48,786 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:48,786 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-08-30 18:00:48,787 INFO L137 encePairwiseOnDemand]: 330/355 looper letters, 20 selfloop transitions, 2 changer transitions 18/45 dead transitions. [2023-08-30 18:00:48,787 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 167 flow [2023-08-30 18:00:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:00:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:00:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 533 transitions. [2023-08-30 18:00:48,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004694835680751 [2023-08-30 18:00:48,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 533 transitions. [2023-08-30 18:00:48,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 533 transitions. [2023-08-30 18:00:48,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:48,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 533 transitions. [2023-08-30 18:00:48,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:48,791 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-08-30 18:00:48,791 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-08-30 18:00:48,792 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 533 transitions. [2023-08-30 18:00:48,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 167 flow [2023-08-30 18:00:48,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 167 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:00:48,793 INFO L231 Difference]: Finished difference. Result has 47 places, 27 transitions, 69 flow [2023-08-30 18:00:48,793 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-08-30 18:00:48,793 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2023-08-30 18:00:48,793 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 27 transitions, 69 flow [2023-08-30 18:00:48,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:48,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:48,794 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:48,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 18:00:48,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:00:48,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:48,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1112596279, now seen corresponding path program 1 times [2023-08-30 18:00:48,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:48,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988091300] [2023-08-30 18:00:48,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:48,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988091300] [2023-08-30 18:00:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988091300] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565359950] [2023-08-30 18:00:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:48,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:48,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:48,829 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-08-30 18:00:48,831 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-08-30 18:00:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:48,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:00:48,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:48,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:48,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565359950] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:48,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 18:00:48,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212025344] [2023-08-30 18:00:48,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:48,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:00:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:48,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:00:48,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:00:48,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355 [2023-08-30 18:00:48,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:48,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:48,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355 [2023-08-30 18:00:48,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:48,963 INFO L130 PetriNetUnfolder]: 47/129 cut-off events. [2023-08-30 18:00:48,963 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:48,964 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-08-30 18:00:48,964 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-30 18:00:48,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-30 18:00:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:00:48,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:00:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 970 transitions. [2023-08-30 18:00:48,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45539906103286387 [2023-08-30 18:00:48,967 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 970 transitions. [2023-08-30 18:00:48,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 970 transitions. [2023-08-30 18:00:48,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:48,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 970 transitions. [2023-08-30 18:00:48,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.66666666666666) internal successors, (970), 6 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:48,971 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-08-30 18:00:48,972 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-08-30 18:00:48,972 INFO L175 Difference]: Start difference. First operand has 47 places, 27 transitions, 69 flow. Second operand 6 states and 970 transitions. [2023-08-30 18:00:48,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-30 18:00:48,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 127 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:48,973 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-30 18:00:48,973 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-08-30 18:00:48,974 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-30 18:00:48,974 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-30 18:00:48,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:48,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:48,975 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-30 18:00:48,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-30 18:00:49,179 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-08-30 18:00:49,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:00:49,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -374883279, now seen corresponding path program 2 times [2023-08-30 18:00:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421649702] [2023-08-30 18:00:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:49,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421649702] [2023-08-30 18:00:49,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421649702] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931663346] [2023-08-30 18:00:49,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:49,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:49,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:49,252 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-08-30 18:00:49,273 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-08-30 18:00:49,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:00:49,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:49,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 18:00:49,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:49,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931663346] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:49,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:49,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 18:00:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711226077] [2023-08-30 18:00:49,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:49,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 18:00:49,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:49,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 18:00:49,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 18:00:49,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 355 [2023-08-30 18:00:49,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:49,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:49,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 355 [2023-08-30 18:00:49,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:49,428 INFO L130 PetriNetUnfolder]: 47/135 cut-off events. [2023-08-30 18:00:49,428 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 18:00:49,428 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-08-30 18:00:49,429 INFO L137 encePairwiseOnDemand]: 352/355 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-30 18:00:49,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-30 18:00:49,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 18:00:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 18:00:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1921 transitions. [2023-08-30 18:00:49,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4509389671361502 [2023-08-30 18:00:49,433 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1921 transitions. [2023-08-30 18:00:49,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1921 transitions. [2023-08-30 18:00:49,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:49,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1921 transitions. [2023-08-30 18:00:49,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.08333333333334) internal successors, (1921), 12 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:49,441 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-08-30 18:00:49,442 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-08-30 18:00:49,442 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1921 transitions. [2023-08-30 18:00:49,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-30 18:00:49,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:49,443 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-30 18:00:49,443 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-08-30 18:00:49,444 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-30 18:00:49,444 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-30 18:00:49,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 158.30769230769232) internal successors, (2058), 13 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:49,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:49,445 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-30 18:00:49,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-30 18:00:49,652 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-08-30 18:00:49,652 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:00:49,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 832355953, now seen corresponding path program 3 times [2023-08-30 18:00:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:49,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020981216] [2023-08-30 18:00:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 18:00:49,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 18:00:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 18:00:49,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 18:00:49,700 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 18:00:49,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 18:00:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 18:00:49,701 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-30 18:00:49,701 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 18:00:49,702 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 18:00:49,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 18:00:49,719 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 18:00:49,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-30 18:00:49,749 INFO L130 PetriNetUnfolder]: 75/430 cut-off events. [2023-08-30 18:00:49,749 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 18:00:49,751 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-08-30 18:00:49,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 266 transitions, 550 flow [2023-08-30 18:00:49,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 266 transitions, 550 flow [2023-08-30 18:00:49,754 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 18:00:49,754 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-30 18:00:49,754 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 266 transitions, 550 flow [2023-08-30 18:00:49,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 266 transitions, 550 flow [2023-08-30 18:00:49,791 INFO L130 PetriNetUnfolder]: 75/430 cut-off events. [2023-08-30 18:00:49,791 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 18:00:49,793 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-08-30 18:00:49,804 INFO L119 LiptonReduction]: Number of co-enabled transitions 33228 [2023-08-30 18:00:52,258 INFO L134 LiptonReduction]: Checked pairs total: 57444 [2023-08-30 18:00:52,258 INFO L136 LiptonReduction]: Total number of compositions: 223 [2023-08-30 18:00:52,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 18:00:52,260 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=true, 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;@a710fa3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 18:00:52,260 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 18:00:52,261 INFO L130 PetriNetUnfolder]: 7/25 cut-off events. [2023-08-30 18:00:52,261 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:00:52,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:52,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 18:00:52,262 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-08-30 18:00:52,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1267872476, now seen corresponding path program 1 times [2023-08-30 18:00:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:52,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881963332] [2023-08-30 18:00:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:52,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881963332] [2023-08-30 18:00:52,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881963332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:00:52,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:00:52,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 18:00:52,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521558289] [2023-08-30 18:00:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:00:52,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:00:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:52,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:00:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 18:00:52,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-08-30 18:00:52,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:52,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:52,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-08-30 18:00:52,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:53,244 INFO L130 PetriNetUnfolder]: 10521/16515 cut-off events. [2023-08-30 18:00:53,244 INFO L131 PetriNetUnfolder]: For 112/112 co-relation queries the response was YES. [2023-08-30 18:00:53,257 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-08-30 18:00:53,295 INFO L137 encePairwiseOnDemand]: 455/489 looper letters, 56 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-30 18:00:53,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 274 flow [2023-08-30 18:00:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:00:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:00:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 738 transitions. [2023-08-30 18:00:53,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030674846625767 [2023-08-30 18:00:53,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 738 transitions. [2023-08-30 18:00:53,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 738 transitions. [2023-08-30 18:00:53,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:53,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 738 transitions. [2023-08-30 18:00:53,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:53,301 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-08-30 18:00:53,301 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-08-30 18:00:53,301 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 738 transitions. [2023-08-30 18:00:53,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 274 flow [2023-08-30 18:00:53,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 274 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:00:53,304 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-30 18:00:53,304 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-08-30 18:00:53,305 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-30 18:00:53,305 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-30 18:00:53,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:53,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:53,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:53,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 18:00:53,306 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-08-30 18:00:53,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:53,306 INFO L85 PathProgramCache]: Analyzing trace with hash 339768936, now seen corresponding path program 1 times [2023-08-30 18:00:53,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:53,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440712310] [2023-08-30 18:00:53,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:53,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440712310] [2023-08-30 18:00:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440712310] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097881258] [2023-08-30 18:00:53,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:53,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:53,331 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-08-30 18:00:53,333 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-08-30 18:00:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:53,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 18:00:53,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 18:00:53,395 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:00:53,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097881258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:00:53,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:00:53,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 18:00:53,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724686247] [2023-08-30 18:00:53,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:00:53,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:00:53,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:53,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:00:53,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 18:00:53,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 489 [2023-08-30 18:00:53,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:53,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:53,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 489 [2023-08-30 18:00:53,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:54,269 INFO L130 PetriNetUnfolder]: 10399/16491 cut-off events. [2023-08-30 18:00:54,269 INFO L131 PetriNetUnfolder]: For 87/87 co-relation queries the response was YES. [2023-08-30 18:00:54,284 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-08-30 18:00:54,323 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 74 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-08-30 18:00:54,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 356 flow [2023-08-30 18:00:54,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:00:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:00:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2023-08-30 18:00:54,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49352419904567146 [2023-08-30 18:00:54,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 724 transitions. [2023-08-30 18:00:54,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 724 transitions. [2023-08-30 18:00:54,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:54,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 724 transitions. [2023-08-30 18:00:54,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:54,328 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-08-30 18:00:54,329 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-08-30 18:00:54,329 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 724 transitions. [2023-08-30 18:00:54,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 356 flow [2023-08-30 18:00:54,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:54,332 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-30 18:00:54,333 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-08-30 18:00:54,333 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-30 18:00:54,334 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-30 18:00:54,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:54,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:54,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:54,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 18:00:54,541 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-08-30 18:00:54,542 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-08-30 18:00:54,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:54,542 INFO L85 PathProgramCache]: Analyzing trace with hash -953345288, now seen corresponding path program 1 times [2023-08-30 18:00:54,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340995651] [2023-08-30 18:00:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:54,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340995651] [2023-08-30 18:00:54,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340995651] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:54,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217309016] [2023-08-30 18:00:54,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:54,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:54,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:54,567 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-08-30 18:00:54,569 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-08-30 18:00:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:54,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:00:54,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:54,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:54,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217309016] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:54,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:54,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 18:00:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503293608] [2023-08-30 18:00:54,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:54,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:00:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:00:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:00:54,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 489 [2023-08-30 18:00:54,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:54,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:54,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 489 [2023-08-30 18:00:54,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:55,536 INFO L130 PetriNetUnfolder]: 10623/16504 cut-off events. [2023-08-30 18:00:55,537 INFO L131 PetriNetUnfolder]: For 685/685 co-relation queries the response was YES. [2023-08-30 18:00:55,556 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-08-30 18:00:55,590 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 57 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-30 18:00:55,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 312 flow [2023-08-30 18:00:55,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:00:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:00:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-08-30 18:00:55,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4614860259032038 [2023-08-30 18:00:55,594 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-08-30 18:00:55,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-08-30 18:00:55,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:55,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-08-30 18:00:55,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:55,600 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-08-30 18:00:55,601 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-08-30 18:00:55,601 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1354 transitions. [2023-08-30 18:00:55,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 312 flow [2023-08-30 18:00:55,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:55,603 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-30 18:00:55,604 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-08-30 18:00:55,604 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-30 18:00:55,604 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-30 18:00:55,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:55,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:55,605 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:55,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-30 18:00:55,813 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-08-30 18:00:55,813 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-08-30 18:00:55,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:55,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1739017580, now seen corresponding path program 2 times [2023-08-30 18:00:55,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:55,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752950039] [2023-08-30 18:00:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:55,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:00:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752950039] [2023-08-30 18:00:55,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752950039] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:55,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613217544] [2023-08-30 18:00:55,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:55,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:55,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:55,878 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-08-30 18:00:55,880 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-08-30 18:00:55,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 18:00:55,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:55,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-30 18:00:55,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:55,952 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-08-30 18:00:55,988 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:55,989 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-08-30 18:00:56,002 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-08-30 18:00:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-30 18:00:56,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:00:56,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613217544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:00:56,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:00:56,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 18:00:56,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084296469] [2023-08-30 18:00:56,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:00:56,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:00:56,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:56,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:00:56,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-30 18:00:56,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 489 [2023-08-30 18:00:56,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:56,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:56,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 489 [2023-08-30 18:00:56,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:57,271 INFO L130 PetriNetUnfolder]: 11006/17360 cut-off events. [2023-08-30 18:00:57,271 INFO L131 PetriNetUnfolder]: For 706/706 co-relation queries the response was YES. [2023-08-30 18:00:57,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34683 conditions, 17360 events. 11006/17360 cut-off events. For 706/706 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 118582 event pairs, 2714 based on Foata normal form. 0/15185 useless extension candidates. Maximal degree in co-relation 34647. Up to 12981 conditions per place. [2023-08-30 18:00:57,311 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 132 selfloop transitions, 14 changer transitions 9/167 dead transitions. [2023-08-30 18:00:57,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 167 transitions, 737 flow [2023-08-30 18:00:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:00:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:00:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1388 transitions. [2023-08-30 18:00:57,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4730743012951602 [2023-08-30 18:00:57,315 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1388 transitions. [2023-08-30 18:00:57,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1388 transitions. [2023-08-30 18:00:57,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:57,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1388 transitions. [2023-08-30 18:00:57,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.33333333333334) internal successors, (1388), 6 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:57,320 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-08-30 18:00:57,320 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-08-30 18:00:57,320 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1388 transitions. [2023-08-30 18:00:57,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 167 transitions, 737 flow [2023-08-30 18:00:57,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 167 transitions, 723 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:57,323 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 280 flow [2023-08-30 18:00:57,323 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-08-30 18:00:57,323 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 19 predicate places. [2023-08-30 18:00:57,324 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 280 flow [2023-08-30 18:00:57,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.5) internal successors, (1245), 6 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:57,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:57,324 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:57,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-30 18:00:57,529 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-08-30 18:00:57,529 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-08-30 18:00:57,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1147901150, now seen corresponding path program 1 times [2023-08-30 18:00:57,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:57,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986703672] [2023-08-30 18:00:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:57,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986703672] [2023-08-30 18:00:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986703672] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146956453] [2023-08-30 18:00:57,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:57,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:57,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:57,588 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-08-30 18:00:57,594 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-08-30 18:00:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:57,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 18:00:57,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:57,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:00:57,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146956453] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:57,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:57,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 18:00:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481341501] [2023-08-30 18:00:57,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:57,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 18:00:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:57,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 18:00:57,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 18:00:57,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 489 [2023-08-30 18:00:57,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 280 flow. Second operand has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:57,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:57,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 489 [2023-08-30 18:00:57,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:58,656 INFO L130 PetriNetUnfolder]: 11004/17512 cut-off events. [2023-08-30 18:00:58,657 INFO L131 PetriNetUnfolder]: For 3607/3607 co-relation queries the response was YES. [2023-08-30 18:00:58,681 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-08-30 18:00:58,712 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 69 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-30 18:00:58,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 92 transitions, 476 flow [2023-08-30 18:00:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 18:00:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 18:00:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2653 transitions. [2023-08-30 18:00:58,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45211315610088615 [2023-08-30 18:00:58,718 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2653 transitions. [2023-08-30 18:00:58,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2653 transitions. [2023-08-30 18:00:58,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:58,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2653 transitions. [2023-08-30 18:00:58,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 221.08333333333334) internal successors, (2653), 12 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:58,728 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-08-30 18:00:58,728 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-08-30 18:00:58,729 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 280 flow. Second operand 12 states and 2653 transitions. [2023-08-30 18:00:58,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 92 transitions, 476 flow [2023-08-30 18:00:58,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:00:58,737 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 364 flow [2023-08-30 18:00:58,738 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-08-30 18:00:58,738 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 36 predicate places. [2023-08-30 18:00:58,738 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 364 flow [2023-08-30 18:00:58,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 216.6153846153846) internal successors, (2816), 13 states have internal predecessors, (2816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:00:58,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:58,739 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:00:58,745 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-08-30 18:00:58,944 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-08-30 18:00:58,944 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-08-30 18:00:58,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2099969954, now seen corresponding path program 2 times [2023-08-30 18:00:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479342430] [2023-08-30 18:00:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:00:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:59,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479342430] [2023-08-30 18:00:59,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479342430] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:59,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379551944] [2023-08-30 18:00:59,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:59,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:59,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:59,487 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-08-30 18:00:59,489 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-08-30 18:00:59,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:00:59,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:59,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 18:00:59,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:59,583 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-08-30 18:00:59,636 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:59,637 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-08-30 18:00:59,652 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-08-30 18:00:59,671 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-08-30 18:00:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:00:59,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379551944] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:05,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:05,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-08-30 18:01:05,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968346632] [2023-08-30 18:01:05,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:05,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 18:01:05,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:05,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 18:01:05,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=131, Unknown=6, NotChecked=0, Total=182 [2023-08-30 18:01:07,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-08-30 18:01:09,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:11,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:13,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:15,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-08-30 18:01:18,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:20,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:22,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:26,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-08-30 18:01:28,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:30,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-08-30 18:01:32,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:34,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:36,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:38,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:40,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:42,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:44,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:46,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:01:46,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 489 [2023-08-30 18:01:46,211 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-08-30 18:01:46,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:46,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 489 [2023-08-30 18:01:46,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:47,773 INFO L130 PetriNetUnfolder]: 11314/18097 cut-off events. [2023-08-30 18:01:47,773 INFO L131 PetriNetUnfolder]: For 3663/3663 co-relation queries the response was YES. [2023-08-30 18:01:47,808 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 125319 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-08-30 18:01:47,840 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 141 selfloop transitions, 22 changer transitions 14/188 dead transitions. [2023-08-30 18:01:47,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 188 transitions, 967 flow [2023-08-30 18:01:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 18:01:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 18:01:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1373 transitions. [2023-08-30 18:01:47,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40111013730645634 [2023-08-30 18:01:47,844 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1373 transitions. [2023-08-30 18:01:47,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1373 transitions. [2023-08-30 18:01:47,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:47,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1373 transitions. [2023-08-30 18:01:47,849 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-08-30 18:01:47,852 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-08-30 18:01:47,852 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-08-30 18:01:47,853 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 364 flow. Second operand 7 states and 1373 transitions. [2023-08-30 18:01:47,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 188 transitions, 967 flow [2023-08-30 18:01:47,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 188 transitions, 919 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-30 18:01:47,865 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 429 flow [2023-08-30 18:01:47,866 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-08-30 18:01:47,866 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 40 predicate places. [2023-08-30 18:01:47,866 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 429 flow [2023-08-30 18:01:47,867 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-08-30 18:01:47,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:47,867 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:01:47,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:48,072 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-08-30 18:01:48,072 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-08-30 18:01:48,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:48,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1826183130, now seen corresponding path program 1 times [2023-08-30 18:01:48,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:48,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848103849] [2023-08-30 18:01:48,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:48,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848103849] [2023-08-30 18:01:48,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848103849] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:48,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659788448] [2023-08-30 18:01:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:48,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:48,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:48,133 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-08-30 18:01:48,135 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-08-30 18:01:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:48,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:01:48,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:48,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:48,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659788448] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:48,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:48,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-30 18:01:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768596761] [2023-08-30 18:01:48,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:48,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:01:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:01:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:01:48,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 489 [2023-08-30 18:01:48,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 429 flow. Second operand has 7 states, 7 states have (on average 219.42857142857142) internal successors, (1536), 7 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:48,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:48,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 489 [2023-08-30 18:01:48,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:48,525 INFO L130 PetriNetUnfolder]: 1336/2540 cut-off events. [2023-08-30 18:01:48,525 INFO L131 PetriNetUnfolder]: For 1250/1250 co-relation queries the response was YES. [2023-08-30 18:01:48,530 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 15717 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-08-30 18:01:48,533 INFO L137 encePairwiseOnDemand]: 486/489 looper letters, 92 selfloop transitions, 4 changer transitions 14/117 dead transitions. [2023-08-30 18:01:48,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 117 transitions, 637 flow [2023-08-30 18:01:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 18:01:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 18:01:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1164 transitions. [2023-08-30 18:01:48,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47607361963190187 [2023-08-30 18:01:48,536 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1164 transitions. [2023-08-30 18:01:48,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1164 transitions. [2023-08-30 18:01:48,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:48,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1164 transitions. [2023-08-30 18:01:48,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 232.8) internal successors, (1164), 5 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:48,541 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-08-30 18:01:48,541 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-08-30 18:01:48,541 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 429 flow. Second operand 5 states and 1164 transitions. [2023-08-30 18:01:48,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 117 transitions, 637 flow [2023-08-30 18:01:48,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 617 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-30 18:01:48,546 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 240 flow [2023-08-30 18:01:48,547 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-08-30 18:01:48,547 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 16 predicate places. [2023-08-30 18:01:48,547 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 240 flow [2023-08-30 18:01:48,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 219.42857142857142) internal successors, (1536), 7 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:48,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:48,548 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:01:48,563 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-08-30 18:01:48,752 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-08-30 18:01:48,752 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-08-30 18:01:48,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1127407452, now seen corresponding path program 1 times [2023-08-30 18:01:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55323615] [2023-08-30 18:01:48,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:48,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:01:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55323615] [2023-08-30 18:01:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55323615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:01:48,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:01:48,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 18:01:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838162993] [2023-08-30 18:01:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:01:48,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 18:01:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 18:01:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 18:01:48,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 489 [2023-08-30 18:01:48,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 58 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 200.4) internal successors, (1002), 5 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:48,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:48,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 489 [2023-08-30 18:01:48,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:49,118 INFO L130 PetriNetUnfolder]: 513/1008 cut-off events. [2023-08-30 18:01:49,118 INFO L131 PetriNetUnfolder]: For 777/777 co-relation queries the response was YES. [2023-08-30 18:01:49,120 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 5098 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-08-30 18:01:49,122 INFO L137 encePairwiseOnDemand]: 476/489 looper letters, 54 selfloop transitions, 13 changer transitions 4/77 dead transitions. [2023-08-30 18:01:49,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 77 transitions, 456 flow [2023-08-30 18:01:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 18:01:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 18:01:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 844 transitions. [2023-08-30 18:01:49,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43149284253578735 [2023-08-30 18:01:49,124 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 844 transitions. [2023-08-30 18:01:49,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 844 transitions. [2023-08-30 18:01:49,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:49,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 844 transitions. [2023-08-30 18:01:49,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:49,128 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-08-30 18:01:49,129 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-08-30 18:01:49,129 INFO L175 Difference]: Start difference. First operand has 84 places, 58 transitions, 240 flow. Second operand 4 states and 844 transitions. [2023-08-30 18:01:49,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 77 transitions, 456 flow [2023-08-30 18:01:49,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 441 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 18:01:49,131 INFO L231 Difference]: Finished difference. Result has 83 places, 60 transitions, 277 flow [2023-08-30 18:01:49,131 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-08-30 18:01:49,132 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 15 predicate places. [2023-08-30 18:01:49,132 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 60 transitions, 277 flow [2023-08-30 18:01:49,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 200.4) internal successors, (1002), 5 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:01:49,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:49,132 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-08-30 18:01:49,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 18:01:49,133 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-08-30 18:01:49,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -405498162, now seen corresponding path program 1 times [2023-08-30 18:01:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377859787] [2023-08-30 18:01:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:49,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:49,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377859787] [2023-08-30 18:01:49,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377859787] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952005299] [2023-08-30 18:01:49,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:49,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:49,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:49,438 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-08-30 18:01:49,440 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-08-30 18:01:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:49,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:01:49,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:49,550 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-08-30 18:01:49,597 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:49,597 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-08-30 18:01:49,611 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-08-30 18:01:49,642 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-08-30 18:01:49,657 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-08-30 18:01:49,703 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:49,703 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-08-30 18:01:49,741 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-08-30 18:01:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:01:49,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:49,836 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-08-30 18:01:49,840 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-08-30 18:02:01,899 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-08-30 18:02:02,063 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:02:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952005299] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:02,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-30 18:02:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199123513] [2023-08-30 18:02:02,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:02,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 18:02:02,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:02,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 18:02:02,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=209, Unknown=5, NotChecked=30, Total=306 [2023-08-30 18:02:02,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-08-30 18:02:02,112 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-08-30 18:02:02,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:02,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-08-30 18:02:02,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:02:02,685 INFO L130 PetriNetUnfolder]: 852/1690 cut-off events. [2023-08-30 18:02:02,685 INFO L131 PetriNetUnfolder]: For 1000/1006 co-relation queries the response was YES. [2023-08-30 18:02:02,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4462 conditions, 1690 events. 852/1690 cut-off events. For 1000/1006 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10110 event pairs, 88 based on Foata normal form. 24/1540 useless extension candidates. Maximal degree in co-relation 4402. Up to 697 conditions per place. [2023-08-30 18:02:02,690 INFO L137 encePairwiseOnDemand]: 479/489 looper letters, 104 selfloop transitions, 24 changer transitions 24/158 dead transitions. [2023-08-30 18:02:02,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 158 transitions, 928 flow [2023-08-30 18:02:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:02:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:02:02,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2348 transitions. [2023-08-30 18:02:02,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3429739994157172 [2023-08-30 18:02:02,694 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2348 transitions. [2023-08-30 18:02:02,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2348 transitions. [2023-08-30 18:02:02,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:02:02,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2348 transitions. [2023-08-30 18:02:02,698 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-08-30 18:02:02,703 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-08-30 18:02:02,704 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-08-30 18:02:02,704 INFO L175 Difference]: Start difference. First operand has 83 places, 60 transitions, 277 flow. Second operand 14 states and 2348 transitions. [2023-08-30 18:02:02,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 158 transitions, 928 flow [2023-08-30 18:02:02,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 158 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 18:02:02,708 INFO L231 Difference]: Finished difference. Result has 101 places, 75 transitions, 426 flow [2023-08-30 18:02:02,708 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-08-30 18:02:02,708 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 33 predicate places. [2023-08-30 18:02:02,708 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 75 transitions, 426 flow [2023-08-30 18:02:02,709 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-08-30 18:02:02,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:02:02,709 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-08-30 18:02:02,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-30 18:02:02,914 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-08-30 18:02:02,915 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-08-30 18:02:02,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:02:02,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1647507858, now seen corresponding path program 2 times [2023-08-30 18:02:02,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:02:02,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213831835] [2023-08-30 18:02:02,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:02:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:02:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:02:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:02:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:02:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213831835] [2023-08-30 18:02:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213831835] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:02:03,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637886603] [2023-08-30 18:02:03,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:02:03,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:02:03,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:02:03,361 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-08-30 18:02:03,363 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-08-30 18:02:03,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:02:03,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:02:03,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:02:03,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:02:03,474 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-08-30 18:02:03,552 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:03,552 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-08-30 18:02:03,571 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-08-30 18:02:03,594 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-08-30 18:02:03,611 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-08-30 18:02:03,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:02:03,661 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-08-30 18:02:03,678 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-08-30 18:02:03,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:02:03,704 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-08-30 18:02:03,727 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:03,727 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-08-30 18:02:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:02:03,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:02:03,797 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-08-30 18:02:03,820 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:02:03,821 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-08-30 18:02:03,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:02:03,826 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-08-30 18:02:03,830 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-08-30 18:02:21,929 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-08-30 18:02:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:02:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637886603] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:23,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:23,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-30 18:02:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417804018] [2023-08-30 18:02:23,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:23,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:02:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:23,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:02:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=272, Unknown=7, NotChecked=74, Total=462 [2023-08-30 18:02:25,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-30 18:02:26,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-30 18:02:26,062 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-08-30 18:02:26,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:26,062 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-30 18:02:26,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:02:26,543 INFO L130 PetriNetUnfolder]: 956/1904 cut-off events. [2023-08-30 18:02:26,543 INFO L131 PetriNetUnfolder]: For 5633/5639 co-relation queries the response was YES. [2023-08-30 18:02:26,546 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 11921 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-08-30 18:02:26,549 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 84 selfloop transitions, 25 changer transitions 16/131 dead transitions. [2023-08-30 18:02:26,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 131 transitions, 957 flow [2023-08-30 18:02:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:02:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:02:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1510 transitions. [2023-08-30 18:02:26,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34310384003635536 [2023-08-30 18:02:26,554 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1510 transitions. [2023-08-30 18:02:26,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1510 transitions. [2023-08-30 18:02:26,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:02:26,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1510 transitions. [2023-08-30 18:02:26,556 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-08-30 18:02:26,560 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-08-30 18:02:26,560 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-08-30 18:02:26,560 INFO L175 Difference]: Start difference. First operand has 101 places, 75 transitions, 426 flow. Second operand 9 states and 1510 transitions. [2023-08-30 18:02:26,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 131 transitions, 957 flow [2023-08-30 18:02:26,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 131 transitions, 934 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-30 18:02:26,568 INFO L231 Difference]: Finished difference. Result has 107 places, 81 transitions, 530 flow [2023-08-30 18:02:26,568 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-08-30 18:02:26,569 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 39 predicate places. [2023-08-30 18:02:26,569 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 81 transitions, 530 flow [2023-08-30 18:02:26,570 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-08-30 18:02:26,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:02:26,570 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-08-30 18:02:26,577 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-08-30 18:02:26,776 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-08-30 18:02:26,777 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-08-30 18:02:26,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:02:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1900505865, now seen corresponding path program 1 times [2023-08-30 18:02:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:02:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834997058] [2023-08-30 18:02:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:02:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:02:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:02:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:02:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:02:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834997058] [2023-08-30 18:02:27,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834997058] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:02:27,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909723983] [2023-08-30 18:02:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:02:27,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:02:27,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:02:27,068 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-08-30 18:02:27,070 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-08-30 18:02:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:02:27,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:02:27,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:02:27,183 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-08-30 18:02:27,222 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:27,222 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-08-30 18:02:27,238 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-08-30 18:02:27,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-08-30 18:02:27,272 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-08-30 18:02:27,303 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:27,304 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-08-30 18:02:27,343 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-08-30 18:02:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:02:27,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:02:27,419 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-08-30 18:02:27,422 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-08-30 18:02:35,461 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-08-30 18:02:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:02:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909723983] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:35,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-30 18:02:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501006410] [2023-08-30 18:02:35,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:35,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 18:02:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:35,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 18:02:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=208, Unknown=5, NotChecked=30, Total=306 [2023-08-30 18:02:35,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-08-30 18:02:35,652 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-08-30 18:02:35,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:35,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-08-30 18:02:35,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:02:36,083 INFO L130 PetriNetUnfolder]: 1058/2099 cut-off events. [2023-08-30 18:02:36,084 INFO L131 PetriNetUnfolder]: For 9539/9545 co-relation queries the response was YES. [2023-08-30 18:02:36,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8066 conditions, 2099 events. 1058/2099 cut-off events. For 9539/9545 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13462 event pairs, 186 based on Foata normal form. 12/1898 useless extension candidates. Maximal degree in co-relation 7996. Up to 1287 conditions per place. [2023-08-30 18:02:36,091 INFO L137 encePairwiseOnDemand]: 479/489 looper letters, 98 selfloop transitions, 17 changer transitions 19/140 dead transitions. [2023-08-30 18:02:36,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 140 transitions, 1095 flow [2023-08-30 18:02:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:02:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:02:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1522 transitions. [2023-08-30 18:02:36,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458304930697569 [2023-08-30 18:02:36,093 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1522 transitions. [2023-08-30 18:02:36,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1522 transitions. [2023-08-30 18:02:36,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:02:36,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1522 transitions. [2023-08-30 18:02:36,096 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-08-30 18:02:36,099 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-08-30 18:02:36,099 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-08-30 18:02:36,099 INFO L175 Difference]: Start difference. First operand has 107 places, 81 transitions, 530 flow. Second operand 9 states and 1522 transitions. [2023-08-30 18:02:36,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 140 transitions, 1095 flow [2023-08-30 18:02:36,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 140 transitions, 1063 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-30 18:02:36,114 INFO L231 Difference]: Finished difference. Result has 113 places, 86 transitions, 615 flow [2023-08-30 18:02:36,114 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-08-30 18:02:36,114 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 45 predicate places. [2023-08-30 18:02:36,114 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 86 transitions, 615 flow [2023-08-30 18:02:36,115 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-08-30 18:02:36,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:02:36,115 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-08-30 18:02:36,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-30 18:02:36,320 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-08-30 18:02:36,320 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-08-30 18:02:36,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:02:36,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1405618938, now seen corresponding path program 3 times [2023-08-30 18:02:36,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:02:36,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145032857] [2023-08-30 18:02:36,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:02:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:02:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:02:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 18:02:39,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:02:39,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145032857] [2023-08-30 18:02:39,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145032857] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:02:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642922353] [2023-08-30 18:02:39,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:02:39,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:02:39,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:02:39,050 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-08-30 18:02:39,052 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-08-30 18:02:39,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:02:39,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:02:39,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:02:39,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:02:39,164 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-08-30 18:02:39,231 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:39,232 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-08-30 18:02:39,260 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-08-30 18:02:39,283 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-08-30 18:02:39,315 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-08-30 18:02:39,356 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:39,357 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-08-30 18:02:39,412 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-08-30 18:02:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:02:39,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:02:39,536 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-08-30 18:02:39,540 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-08-30 18:02:49,589 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-08-30 18:02:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:02:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642922353] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:49,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-30 18:02:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349421585] [2023-08-30 18:02:49,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:49,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 18:02:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 18:02:49,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=611, Unknown=2, NotChecked=52, Total=812 [2023-08-30 18:02:49,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-08-30 18:02:49,832 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-08-30 18:02:49,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:49,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-08-30 18:02:49,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:03:06,548 WARN L222 SmtUtils]: Spent 16.63s on a formula simplification. DAG size of input: 41 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:03:08,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:10,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:12,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:14,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-08-30 18:03:16,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:18,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:20,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:03:22,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:24,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:26,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:28,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:30,605 WARN L539 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-08-30 18:03:32,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:34,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:36,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:38,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:40,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:42,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:44,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-08-30 18:03:46,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:48,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:50,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:52,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-08-30 18:03:54,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 [0, 1] [2023-08-30 18:03:56,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:58,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:02,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:04,163 WARN L539 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-08-30 18:04:06,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:08,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:10,203 WARN L539 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-08-30 18:04:12,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:12,856 INFO L130 PetriNetUnfolder]: 1104/2221 cut-off events. [2023-08-30 18:04:12,856 INFO L131 PetriNetUnfolder]: For 15579/15591 co-relation queries the response was YES. [2023-08-30 18:04:12,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9143 conditions, 2221 events. 1104/2221 cut-off events. For 15579/15591 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14602 event pairs, 159 based on Foata normal form. 12/2011 useless extension candidates. Maximal degree in co-relation 9069. Up to 1384 conditions per place. [2023-08-30 18:04:12,864 INFO L137 encePairwiseOnDemand]: 477/489 looper letters, 94 selfloop transitions, 29 changer transitions 18/147 dead transitions. [2023-08-30 18:04:12,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 147 transitions, 1244 flow [2023-08-30 18:04:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 18:04:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 18:04:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3173 transitions. [2023-08-30 18:04:12,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3244376278118609 [2023-08-30 18:04:12,868 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3173 transitions. [2023-08-30 18:04:12,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3173 transitions. [2023-08-30 18:04:12,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:12,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3173 transitions. [2023-08-30 18:04:12,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 158.65) internal successors, (3173), 20 states have internal predecessors, (3173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:04:12,877 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-08-30 18:04:12,877 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-08-30 18:04:12,878 INFO L175 Difference]: Start difference. First operand has 113 places, 86 transitions, 615 flow. Second operand 20 states and 3173 transitions. [2023-08-30 18:04:12,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 147 transitions, 1244 flow [2023-08-30 18:04:12,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 147 transitions, 1122 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-08-30 18:04:12,904 INFO L231 Difference]: Finished difference. Result has 131 places, 93 transitions, 680 flow [2023-08-30 18:04:12,904 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=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=680, PETRI_PLACES=131, PETRI_TRANSITIONS=93} [2023-08-30 18:04:12,905 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 63 predicate places. [2023-08-30 18:04:12,905 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 93 transitions, 680 flow [2023-08-30 18:04:12,905 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-08-30 18:04:12,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:12,906 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-08-30 18:04:12,913 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-08-30 18:04:13,111 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-08-30 18:04:13,111 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-08-30 18:04:13,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1913033255, now seen corresponding path program 2 times [2023-08-30 18:04:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490149804] [2023-08-30 18:04:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 18:04:15,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:15,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490149804] [2023-08-30 18:04:15,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490149804] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:15,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556820923] [2023-08-30 18:04:15,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:04:15,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:15,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:15,259 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-08-30 18:04:15,259 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-08-30 18:04:15,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:04:15,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:04:15,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 18:04:15,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:15,389 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-08-30 18:04:15,445 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:15,446 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-08-30 18:04:15,469 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-08-30 18:04:15,486 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-08-30 18:04:15,516 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-08-30 18:04:15,557 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:15,558 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-08-30 18:04:15,600 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-08-30 18:04:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:04:15,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:15,722 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-08-30 18:04:15,725 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-08-30 18:04:31,802 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-08-30 18:04:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:04:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556820923] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:31,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:31,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 27 [2023-08-30 18:04:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503364467] [2023-08-30 18:04:31,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:31,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-30 18:04:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:31,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-30 18:04:31,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=609, Unknown=5, NotChecked=52, Total=812 [2023-08-30 18:04:32,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 489 [2023-08-30 18:04:32,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 93 transitions, 680 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-08-30 18:04:32,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:32,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 489 [2023-08-30 18:04:32,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:33,179 INFO L130 PetriNetUnfolder]: 1299/2639 cut-off events. [2023-08-30 18:04:33,179 INFO L131 PetriNetUnfolder]: For 13474/13492 co-relation queries the response was YES. [2023-08-30 18:04:33,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10231 conditions, 2639 events. 1299/2639 cut-off events. For 13474/13492 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18395 event pairs, 193 based on Foata normal form. 24/2401 useless extension candidates. Maximal degree in co-relation 10143. Up to 1579 conditions per place. [2023-08-30 18:04:33,188 INFO L137 encePairwiseOnDemand]: 478/489 looper letters, 115 selfloop transitions, 37 changer transitions 26/184 dead transitions. [2023-08-30 18:04:33,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 184 transitions, 1547 flow [2023-08-30 18:04:33,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-30 18:04:33,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-30 18:04:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3817 transitions. [2023-08-30 18:04:33,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3252385821404226 [2023-08-30 18:04:33,192 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3817 transitions. [2023-08-30 18:04:33,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3817 transitions. [2023-08-30 18:04:33,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:33,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3817 transitions. [2023-08-30 18:04:33,196 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-08-30 18:04:33,201 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-08-30 18:04:33,202 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-08-30 18:04:33,202 INFO L175 Difference]: Start difference. First operand has 131 places, 93 transitions, 680 flow. Second operand 24 states and 3817 transitions. [2023-08-30 18:04:33,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 184 transitions, 1547 flow [2023-08-30 18:04:33,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 184 transitions, 1448 flow, removed 21 selfloop flow, removed 22 redundant places. [2023-08-30 18:04:33,226 INFO L231 Difference]: Finished difference. Result has 136 places, 107 transitions, 898 flow [2023-08-30 18:04:33,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=898, PETRI_PLACES=136, PETRI_TRANSITIONS=107} [2023-08-30 18:04:33,226 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 68 predicate places. [2023-08-30 18:04:33,226 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 107 transitions, 898 flow [2023-08-30 18:04:33,227 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-08-30 18:04:33,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:33,227 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-08-30 18:04:33,237 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-08-30 18:04:33,432 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-08-30 18:04:33,432 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-08-30 18:04:33,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:33,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1333605401, now seen corresponding path program 3 times [2023-08-30 18:04:33,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:33,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586064335] [2023-08-30 18:04:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:33,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:04:33,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586064335] [2023-08-30 18:04:33,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586064335] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482088727] [2023-08-30 18:04:33,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:04:33,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:33,743 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-08-30 18:04:33,745 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-08-30 18:04:33,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:04:33,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:04:33,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:04:33,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:33,867 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-08-30 18:04:33,921 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:33,921 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-08-30 18:04:33,937 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-08-30 18:04:33,960 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-08-30 18:04:33,989 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-08-30 18:04:34,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:04:34,026 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-08-30 18:04:34,042 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-08-30 18:04:34,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:04:34,066 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-08-30 18:04:34,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:34,093 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-08-30 18:04:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:04:34,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:34,173 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1016 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_71| Int)) (or (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)) (= (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| v_ArrVal_1016)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_71|) 0))) is different from false [2023-08-30 18:04:34,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:04:34,198 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-08-30 18:04:34,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:04:34,207 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-08-30 18:04:34,210 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-08-30 18:04:42,274 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-08-30 18:04:44,307 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-08-30 18:04:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:04:46,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482088727] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:46,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:46,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-08-30 18:04:46,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31844899] [2023-08-30 18:04:46,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:46,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:04:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:04:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=275, Unknown=2, NotChecked=74, Total=462 [2023-08-30 18:04:46,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-30 18:04:46,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 107 transitions, 898 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-08-30 18:04:46,609 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:46,609 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-30 18:04:46,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:47,164 INFO L130 PetriNetUnfolder]: 1252/2625 cut-off events. [2023-08-30 18:04:47,164 INFO L131 PetriNetUnfolder]: For 12066/12066 co-relation queries the response was YES. [2023-08-30 18:04:47,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9869 conditions, 2625 events. 1252/2625 cut-off events. For 12066/12066 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 18854 event pairs, 171 based on Foata normal form. 3/2363 useless extension candidates. Maximal degree in co-relation 9794. Up to 1641 conditions per place. [2023-08-30 18:04:47,174 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 104 selfloop transitions, 29 changer transitions 16/155 dead transitions. [2023-08-30 18:04:47,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 155 transitions, 1431 flow [2023-08-30 18:04:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:04:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:04:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1507 transitions. [2023-08-30 18:04:47,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.342422176778005 [2023-08-30 18:04:47,176 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1507 transitions. [2023-08-30 18:04:47,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1507 transitions. [2023-08-30 18:04:47,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:47,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1507 transitions. [2023-08-30 18:04:47,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.44444444444446) internal successors, (1507), 9 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:04:47,180 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-08-30 18:04:47,180 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-08-30 18:04:47,180 INFO L175 Difference]: Start difference. First operand has 136 places, 107 transitions, 898 flow. Second operand 9 states and 1507 transitions. [2023-08-30 18:04:47,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 155 transitions, 1431 flow [2023-08-30 18:04:47,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 155 transitions, 1201 flow, removed 95 selfloop flow, removed 16 redundant places. [2023-08-30 18:04:47,206 INFO L231 Difference]: Finished difference. Result has 130 places, 113 transitions, 841 flow [2023-08-30 18:04:47,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=841, PETRI_PLACES=130, PETRI_TRANSITIONS=113} [2023-08-30 18:04:47,207 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 62 predicate places. [2023-08-30 18:04:47,207 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 113 transitions, 841 flow [2023-08-30 18:04:47,207 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-08-30 18:04:47,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:47,207 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-08-30 18:04:47,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-30 18:04:47,408 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-08-30 18:04:47,409 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-08-30 18:04:47,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1372677484, now seen corresponding path program 4 times [2023-08-30 18:04:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:47,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576426490] [2023-08-30 18:04:47,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:47,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:47,731 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:04:47,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:47,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576426490] [2023-08-30 18:04:47,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576426490] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:47,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391964124] [2023-08-30 18:04:47,732 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:04:47,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:47,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:47,733 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-08-30 18:04:47,736 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-08-30 18:04:47,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:04:47,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:04:47,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:04:47,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:47,863 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-08-30 18:04:47,936 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:47,936 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-08-30 18:04:47,957 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-08-30 18:04:47,976 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-08-30 18:04:48,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:04:48,034 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-08-30 18:04:48,068 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-08-30 18:04:48,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:04:48,095 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-08-30 18:04:48,125 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-08-30 18:04:48,156 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:48,156 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-08-30 18:04:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:04:48,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:48,254 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-08-30 18:04:48,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:04:48,296 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-08-30 18:04:48,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:04:48,302 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-08-30 18:04:48,305 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-08-30 18:04:48,475 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-08-30 18:04:48,508 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-08-30 18:04:56,561 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-08-30 18:04:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 18:04:56,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391964124] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:04:56,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:04:56,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-30 18:04:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238040914] [2023-08-30 18:04:56,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:04:56,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:04:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:04:56,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:04:56,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=282, Unknown=5, NotChecked=114, Total=506 [2023-08-30 18:04:56,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-30 18:04:56,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 113 transitions, 841 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-08-30 18:04:56,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:04:56,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-30 18:04:56,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:04:57,598 INFO L130 PetriNetUnfolder]: 1258/2636 cut-off events. [2023-08-30 18:04:57,598 INFO L131 PetriNetUnfolder]: For 7906/7930 co-relation queries the response was YES. [2023-08-30 18:04:57,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9390 conditions, 2636 events. 1258/2636 cut-off events. For 7906/7930 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18892 event pairs, 179 based on Foata normal form. 3/2376 useless extension candidates. Maximal degree in co-relation 9322. Up to 1428 conditions per place. [2023-08-30 18:04:57,608 INFO L137 encePairwiseOnDemand]: 481/489 looper letters, 115 selfloop transitions, 23 changer transitions 17/161 dead transitions. [2023-08-30 18:04:57,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 161 transitions, 1388 flow [2023-08-30 18:04:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:04:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:04:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1505 transitions. [2023-08-30 18:04:57,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419677346057714 [2023-08-30 18:04:57,612 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1505 transitions. [2023-08-30 18:04:57,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1505 transitions. [2023-08-30 18:04:57,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:04:57,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1505 transitions. [2023-08-30 18:04:57,613 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-08-30 18:04:57,615 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-08-30 18:04:57,616 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-08-30 18:04:57,616 INFO L175 Difference]: Start difference. First operand has 130 places, 113 transitions, 841 flow. Second operand 9 states and 1505 transitions. [2023-08-30 18:04:57,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 161 transitions, 1388 flow [2023-08-30 18:04:57,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 161 transitions, 1328 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-30 18:04:57,640 INFO L231 Difference]: Finished difference. Result has 135 places, 115 transitions, 859 flow [2023-08-30 18:04:57,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=859, PETRI_PLACES=135, PETRI_TRANSITIONS=115} [2023-08-30 18:04:57,640 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 67 predicate places. [2023-08-30 18:04:57,640 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 115 transitions, 859 flow [2023-08-30 18:04:57,641 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-08-30 18:04:57,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:04:57,641 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-08-30 18:04:57,647 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-08-30 18:04:57,845 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-08-30 18:04:57,846 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-08-30 18:04:57,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:04:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 781814286, now seen corresponding path program 5 times [2023-08-30 18:04:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:04:57,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153766830] [2023-08-30 18:04:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:04:57,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:04:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:04:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:04:58,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:04:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153766830] [2023-08-30 18:04:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153766830] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:04:58,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530647537] [2023-08-30 18:04:58,192 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 18:04:58,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:04:58,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:04:58,193 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-08-30 18:04:58,195 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-08-30 18:04:58,428 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 18:04:58,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:04:58,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:04:58,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:04:58,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-08-30 18:04:58,494 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:58,495 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-08-30 18:04:58,514 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-08-30 18:04:58,532 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-08-30 18:04:58,550 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-08-30 18:04:58,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:04:58,605 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-08-30 18:04:58,673 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:04:58,673 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-08-30 18:04:58,699 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-08-30 18:04:58,726 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-08-30 18:04:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:04:58,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:04:58,763 WARN L839 $PredicateComparison]: unable to prove that (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)) is different from false [2023-08-30 18:04:58,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:04:58,871 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-08-30 18:04:58,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:04:58,878 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-08-30 18:04:58,882 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-08-30 18:05:00,899 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-08-30 18:05:00,911 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-08-30 18:05:08,988 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-08-30 18:05:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:05:09,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530647537] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:09,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:09,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-30 18:05:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671727321] [2023-08-30 18:05:09,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:09,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:05:09,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:09,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:05:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=12, NotChecked=114, Total=506 [2023-08-30 18:05:09,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 489 [2023-08-30 18:05:09,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 115 transitions, 859 flow. Second operand has 23 states, 23 states have (on average 157.3913043478261) internal successors, (3620), 23 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:09,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:09,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 489 [2023-08-30 18:05:09,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:09,523 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (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 .cse0 |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 .cse0 |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-08-30 18:05:11,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:12,050 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (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) (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 .cse0 |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 .cse0 |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 .cse0 |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-08-30 18:05:13,082 INFO L130 PetriNetUnfolder]: 1426/3158 cut-off events. [2023-08-30 18:05:13,083 INFO L131 PetriNetUnfolder]: For 8570/8594 co-relation queries the response was YES. [2023-08-30 18:05:13,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11197 conditions, 3158 events. 1426/3158 cut-off events. For 8570/8594 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 24537 event pairs, 236 based on Foata normal form. 14/2870 useless extension candidates. Maximal degree in co-relation 11126. Up to 1710 conditions per place. [2023-08-30 18:05:13,095 INFO L137 encePairwiseOnDemand]: 470/489 looper letters, 129 selfloop transitions, 47 changer transitions 94/276 dead transitions. [2023-08-30 18:05:13,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 276 transitions, 2188 flow [2023-08-30 18:05:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 18:05:13,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 18:05:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3759 transitions. [2023-08-30 18:05:13,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.334222459322486 [2023-08-30 18:05:13,099 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 3759 transitions. [2023-08-30 18:05:13,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 3759 transitions. [2023-08-30 18:05:13,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:13,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3759 transitions. [2023-08-30 18:05:13,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:13,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 489.0) internal successors, (11736), 24 states have internal predecessors, (11736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:13,110 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 489.0) internal successors, (11736), 24 states have internal predecessors, (11736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:13,110 INFO L175 Difference]: Start difference. First operand has 135 places, 115 transitions, 859 flow. Second operand 23 states and 3759 transitions. [2023-08-30 18:05:13,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 276 transitions, 2188 flow [2023-08-30 18:05:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 276 transitions, 2141 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-30 18:05:13,135 INFO L231 Difference]: Finished difference. Result has 162 places, 138 transitions, 1189 flow [2023-08-30 18:05:13,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1189, PETRI_PLACES=162, PETRI_TRANSITIONS=138} [2023-08-30 18:05:13,135 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 94 predicate places. [2023-08-30 18:05:13,136 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 138 transitions, 1189 flow [2023-08-30 18:05:13,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 157.3913043478261) internal successors, (3620), 23 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:13,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:13,136 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-08-30 18:05:13,164 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-08-30 18:05:13,360 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-08-30 18:05:13,360 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-08-30 18:05:13,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:13,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1031355982, now seen corresponding path program 6 times [2023-08-30 18:05:13,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:13,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581509518] [2023-08-30 18:05:13,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:13,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:13,620 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:05:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581509518] [2023-08-30 18:05:13,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581509518] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:13,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42428149] [2023-08-30 18:05:13,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 18:05:13,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:13,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:13,622 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-08-30 18:05:13,627 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-08-30 18:05:13,806 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-30 18:05:13,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:13,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:05:13,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:13,815 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-08-30 18:05:13,883 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:13,883 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-08-30 18:05:13,901 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-08-30 18:05:13,921 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-08-30 18:05:13,933 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-08-30 18:05:13,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:13,988 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-08-30 18:05:14,049 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:14,050 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-08-30 18:05:14,072 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-08-30 18:05:14,107 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-08-30 18:05:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-30 18:05:14,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:14,133 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:05:14,236 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:05:14,237 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-08-30 18:05:14,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:05:14,244 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-08-30 18:05:14,248 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-08-30 18:05:14,870 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (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)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |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))) (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)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |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) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|))))) is different from false [2023-08-30 18:05:14,882 WARN L839 $PredicateComparison]: unable to prove that (and (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_1281 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281))) (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)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (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_1281 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281))) (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) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_77| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)))) is different from false [2023-08-30 18:05:22,957 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-08-30 18:05:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:05:23,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42428149] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:23,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:23,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-08-30 18:05:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177656659] [2023-08-30 18:05:23,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:23,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:05:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:05:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=276, Unknown=11, NotChecked=108, Total=462 [2023-08-30 18:05:23,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-30 18:05:23,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 138 transitions, 1189 flow. Second operand has 22 states, 22 states have (on average 159.54545454545453) internal successors, (3510), 22 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:05:23,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:23,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-30 18:05:23,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:33,344 WARN L222 SmtUtils]: Spent 10.09s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:05:35,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:37,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:39,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:41,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:43,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:45,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:47,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:49,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:51,371 WARN L539 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-08-30 18:05:53,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:05:55,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:05:57,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:21,522 WARN L222 SmtUtils]: Spent 22.10s on a formula simplification. DAG size of input: 50 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:06:23,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:25,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:27,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:29,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:31,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:33,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:35,545 WARN L539 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-08-30 18:06:37,546 WARN L539 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-08-30 18:06:39,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-08-30 18:06:41,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:43,560 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-08-30 18:06:45,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 [1] [2023-08-30 18:06:47,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:49,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:51,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 [1] [2023-08-30 18:06:53,581 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-08-30 18:06:55,583 WARN L539 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-08-30 18:06:57,594 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-08-30 18:06:59,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:01,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:03,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-08-30 18:07:05,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:07,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:09,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:11,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:13,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:07:15,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:07:17,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:19,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:21,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:23,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:25,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:27,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-08-30 18:07:29,708 WARN L539 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-08-30 18:07:31,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:07:33,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:33,820 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int)) (or (not (= 0 (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |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))) (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))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1284) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |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))))) is different from false [2023-08-30 18:07:35,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:35,942 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1287) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1285 Int) (v_ArrVal_1287 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int)) (or (not (= 0 (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)))) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |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 (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (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))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1284) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |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))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (exists ((v_ArrVal_1285 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1285) (select |c_#memory_int| 4)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |t_funThread1of2ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-30 18:07:36,709 INFO L130 PetriNetUnfolder]: 1106/2414 cut-off events. [2023-08-30 18:07:36,710 INFO L131 PetriNetUnfolder]: For 13888/13912 co-relation queries the response was YES. [2023-08-30 18:07:36,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11383 conditions, 2414 events. 1106/2414 cut-off events. For 13888/13912 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17364 event pairs, 203 based on Foata normal form. 7/2294 useless extension candidates. Maximal degree in co-relation 11301. Up to 1598 conditions per place. [2023-08-30 18:07:36,722 INFO L137 encePairwiseOnDemand]: 474/489 looper letters, 128 selfloop transitions, 42 changer transitions 40/216 dead transitions. [2023-08-30 18:07:36,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 216 transitions, 2169 flow [2023-08-30 18:07:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 18:07:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 18:07:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2808 transitions. [2023-08-30 18:07:36,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.337784193431974 [2023-08-30 18:07:36,725 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2808 transitions. [2023-08-30 18:07:36,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2808 transitions. [2023-08-30 18:07:36,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:07:36,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2808 transitions. [2023-08-30 18:07:36,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 165.1764705882353) internal successors, (2808), 17 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:07:36,732 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-08-30 18:07:36,732 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-08-30 18:07:36,732 INFO L175 Difference]: Start difference. First operand has 162 places, 138 transitions, 1189 flow. Second operand 17 states and 2808 transitions. [2023-08-30 18:07:36,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 216 transitions, 2169 flow [2023-08-30 18:07:36,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 216 transitions, 2103 flow, removed 21 selfloop flow, removed 10 redundant places. [2023-08-30 18:07:36,764 INFO L231 Difference]: Finished difference. Result has 168 places, 143 transitions, 1302 flow [2023-08-30 18:07:36,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1302, PETRI_PLACES=168, PETRI_TRANSITIONS=143} [2023-08-30 18:07:36,764 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 100 predicate places. [2023-08-30 18:07:36,764 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 143 transitions, 1302 flow [2023-08-30 18:07:36,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.54545454545453) internal successors, (3510), 22 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:07:36,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:07:36,765 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-08-30 18:07:36,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-30 18:07:36,970 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-08-30 18:07:36,971 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-08-30 18:07:36,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:07:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash -174516702, now seen corresponding path program 7 times [2023-08-30 18:07:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:07:36,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742574538] [2023-08-30 18:07:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:07:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:07:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:07:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:07:52,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:07:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742574538] [2023-08-30 18:07:52,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742574538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:07:52,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785916975] [2023-08-30 18:07:52,214 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 18:07:52,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:07:52,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:07:52,215 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-08-30 18:07:52,216 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-08-30 18:07:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:07:52,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:07:52,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:07:52,337 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-08-30 18:07:52,420 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:07:52,420 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-08-30 18:07:52,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 13 treesize of output 15 [2023-08-30 18:07:52,470 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-08-30 18:07:52,492 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-08-30 18:07:52,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:07:52,553 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-08-30 18:07:52,608 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:07:52,609 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-08-30 18:07:52,651 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-08-30 18:07:52,715 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-08-30 18:07:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:07:52,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:07:52,894 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1375 (Array Int Int))) (or (= (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_1376)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1375) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_85|)) 0)))) is different from false [2023-08-30 18:07:52,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:07:52,909 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-08-30 18:07:52,915 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:07:52,915 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-08-30 18:07:52,919 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-08-30 18:07:52,937 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_79| Int) (v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_79| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1376)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1376)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0))))) is different from false [2023-08-30 18:07:53,137 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1372 (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_1372))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1376))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0))) (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_79| Int) (v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1372 (Array Int Int))) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1372))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_79| v_ArrVal_1376))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-30 18:08:01,246 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-08-30 18:08:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:08:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785916975] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:08:01,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:08:01,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 32 [2023-08-30 18:08:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969250994] [2023-08-30 18:08:01,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:08:01,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 18:08:01,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:08:01,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 18:08:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=797, Unknown=25, NotChecked=180, Total=1122 [2023-08-30 18:08:01,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 489 [2023-08-30 18:08:01,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 143 transitions, 1302 flow. Second operand has 34 states, 34 states have (on average 148.97058823529412) internal successors, (5065), 34 states have internal predecessors, (5065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:08:01,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:08:01,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 489 [2023-08-30 18:08:01,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:01,465 WARN L222 SmtUtils]: Spent 59.67s on a formula simplification. DAG size of input: 48 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:09:07,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 [1] [2023-08-30 18:09:08,212 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1376 Int) (v_ArrVal_1378 (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_1376)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1378 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-08-30 18:09:08,335 INFO L130 PetriNetUnfolder]: 1215/2729 cut-off events. [2023-08-30 18:09:08,335 INFO L131 PetriNetUnfolder]: For 15100/15124 co-relation queries the response was YES. [2023-08-30 18:09:08,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12884 conditions, 2729 events. 1215/2729 cut-off events. For 15100/15124 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 20471 event pairs, 182 based on Foata normal form. 10/2594 useless extension candidates. Maximal degree in co-relation 12800. Up to 1489 conditions per place. [2023-08-30 18:09:08,347 INFO L137 encePairwiseOnDemand]: 473/489 looper letters, 150 selfloop transitions, 69 changer transitions 101/326 dead transitions. [2023-08-30 18:09:08,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 326 transitions, 3333 flow [2023-08-30 18:09:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-30 18:09:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-30 18:09:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5977 transitions. [2023-08-30 18:09:08,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3134077919353993 [2023-08-30 18:09:08,352 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 5977 transitions. [2023-08-30 18:09:08,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 5977 transitions. [2023-08-30 18:09:08,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:08,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 5977 transitions. [2023-08-30 18:09:08,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 153.25641025641025) internal successors, (5977), 39 states have internal predecessors, (5977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:09:08,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 489.0) internal successors, (19560), 40 states have internal predecessors, (19560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:09:08,368 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 489.0) internal successors, (19560), 40 states have internal predecessors, (19560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:09:08,368 INFO L175 Difference]: Start difference. First operand has 168 places, 143 transitions, 1302 flow. Second operand 39 states and 5977 transitions. [2023-08-30 18:09:08,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 326 transitions, 3333 flow [2023-08-30 18:09:08,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 326 transitions, 3127 flow, removed 45 selfloop flow, removed 15 redundant places. [2023-08-30 18:09:08,404 INFO L231 Difference]: Finished difference. Result has 197 places, 158 transitions, 1571 flow [2023-08-30 18:09:08,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1571, PETRI_PLACES=197, PETRI_TRANSITIONS=158} [2023-08-30 18:09:08,404 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 129 predicate places. [2023-08-30 18:09:08,404 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 158 transitions, 1571 flow [2023-08-30 18:09:08,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 148.97058823529412) internal successors, (5065), 34 states have internal predecessors, (5065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:09:08,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:08,405 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-08-30 18:09:08,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-30 18:09:08,611 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-08-30 18:09:08,611 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-08-30 18:09:08,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2021237601, now seen corresponding path program 4 times [2023-08-30 18:09:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699640416] [2023-08-30 18:09:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:09:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699640416] [2023-08-30 18:09:08,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699640416] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:09:08,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146587166] [2023-08-30 18:09:08,810 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:09:08,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:08,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:09:08,811 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-08-30 18:09:08,813 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-08-30 18:09:08,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:09:08,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:09:08,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 18:09:08,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:09:08,949 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-08-30 18:09:08,991 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:09:08,991 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-08-30 18:09:08,998 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-08-30 18:09:09,013 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-08-30 18:09:09,051 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-08-30 18:09:09,076 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:09:09,077 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-08-30 18:09:09,135 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-08-30 18:09:09,169 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-08-30 18:09:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:09:09,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:09:09,289 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-08-30 18:09:09,292 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-08-30 18:09:09,298 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1468 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1465 (Array Int Int)) (v_ArrVal_1466 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 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1465))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1466))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1468) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_81|) 0))) is different from false [2023-08-30 18:09:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2023-08-30 18:09:09,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146587166] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:09:09,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:09:09,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2023-08-30 18:09:09,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94408537] [2023-08-30 18:09:09,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:09:09,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 18:09:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:09,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 18:09:09,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=197, Unknown=10, NotChecked=30, Total=306 [2023-08-30 18:09:09,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-08-30 18:09:09,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 158 transitions, 1571 flow. Second operand has 18 states, 18 states have (on average 161.0) internal successors, (2898), 18 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:09:09,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:09,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-08-30 18:09:09,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:21,199 WARN L222 SmtUtils]: Spent 11.66s 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-08-30 18:09:23,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:25,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:27,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:29,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:31,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:33,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-08-30 18:09:35,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-08-30 18:09:37,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:40,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:42,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:44,428 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-08-30 18:09:46,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:48,439 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-08-30 18:09:50,462 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-08-30 18:09:52,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:09:54,474 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-08-30 18:09:56,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:58,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:00,487 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-08-30 18:10:02,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:06,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:08,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:10,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:12,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-08-30 18:10:14,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-08-30 18:10:16,576 WARN L539 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-08-30 18:10:18,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:20,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:22,604 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-08-30 18:10:24,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:26,608 WARN L539 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-08-30 18:10:28,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:10:29,128 INFO L130 PetriNetUnfolder]: 1116/2470 cut-off events. [2023-08-30 18:10:29,128 INFO L131 PetriNetUnfolder]: For 14886/14904 co-relation queries the response was YES. [2023-08-30 18:10:29,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11861 conditions, 2470 events. 1116/2470 cut-off events. For 14886/14904 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 18047 event pairs, 237 based on Foata normal form. 4/2322 useless extension candidates. Maximal degree in co-relation 11762. Up to 1410 conditions per place. [2023-08-30 18:10:29,140 INFO L137 encePairwiseOnDemand]: 479/489 looper letters, 126 selfloop transitions, 26 changer transitions 44/202 dead transitions. [2023-08-30 18:10:29,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 202 transitions, 2226 flow [2023-08-30 18:10:29,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 18:10:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 18:10:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1679 transitions. [2023-08-30 18:10:29,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34335378323108384 [2023-08-30 18:10:29,141 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1679 transitions. [2023-08-30 18:10:29,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1679 transitions. [2023-08-30 18:10:29,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:10:29,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1679 transitions. [2023-08-30 18:10:29,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 167.9) internal successors, (1679), 10 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:29,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 489.0) internal successors, (5379), 11 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:29,145 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 489.0) internal successors, (5379), 11 states have internal predecessors, (5379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:29,145 INFO L175 Difference]: Start difference. First operand has 197 places, 158 transitions, 1571 flow. Second operand 10 states and 1679 transitions. [2023-08-30 18:10:29,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 202 transitions, 2226 flow [2023-08-30 18:10:29,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 202 transitions, 2096 flow, removed 28 selfloop flow, removed 23 redundant places. [2023-08-30 18:10:29,177 INFO L231 Difference]: Finished difference. Result has 180 places, 148 transitions, 1383 flow [2023-08-30 18:10:29,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1383, PETRI_PLACES=180, PETRI_TRANSITIONS=148} [2023-08-30 18:10:29,177 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 112 predicate places. [2023-08-30 18:10:29,178 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 148 transitions, 1383 flow [2023-08-30 18:10:29,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 161.0) internal successors, (2898), 18 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:29,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:10:29,178 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-08-30 18:10:29,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-30 18:10:29,378 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-08-30 18:10:29,379 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-08-30 18:10:29,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:10:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2052613846, now seen corresponding path program 8 times [2023-08-30 18:10:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:10:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794519884] [2023-08-30 18:10:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:10:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:29,586 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-08-30 18:10:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:10:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794519884] [2023-08-30 18:10:29,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794519884] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:10:29,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294021902] [2023-08-30 18:10:29,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:10:29,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:29,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:10:29,588 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-08-30 18:10:29,590 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-08-30 18:10:29,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:10:29,727 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:10:29,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 18:10:29,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:10:29,733 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-08-30 18:10:29,787 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:10:29,788 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-08-30 18:10:29,795 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-08-30 18:10:29,815 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-08-30 18:10:29,832 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-08-30 18:10:29,879 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:10:29,879 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-08-30 18:10:29,933 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-08-30 18:10:29,958 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-08-30 18:10:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-08-30 18:10:29,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:10:29,991 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_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:10:30,045 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-08-30 18:10:30,048 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-08-30 18:10:30,071 WARN L839 $PredicateComparison]: unable to prove that (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 (= 0 (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_83| v_ArrVal_1557)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89|)) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|))) is different from false [2023-08-30 18:10:30,086 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1553 (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_1553))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83| v_ArrVal_1557))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_89|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_89|))) is different from false [2023-08-30 18:10:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:10:30,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294021902] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:10:30,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:10:30,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2023-08-30 18:10:30,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712807362] [2023-08-30 18:10:30,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:10:30,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 18:10:30,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:10:30,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 18:10:30,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=155, Unknown=9, NotChecked=84, Total=306 [2023-08-30 18:10:30,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 489 [2023-08-30 18:10:30,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 148 transitions, 1383 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-08-30 18:10:30,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:10:30,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 489 [2023-08-30 18:10:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:10:30,896 INFO L130 PetriNetUnfolder]: 944/2127 cut-off events. [2023-08-30 18:10:30,897 INFO L131 PetriNetUnfolder]: For 12969/12989 co-relation queries the response was YES. [2023-08-30 18:10:30,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10283 conditions, 2127 events. 944/2127 cut-off events. For 12969/12989 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15216 event pairs, 213 based on Foata normal form. 4/2019 useless extension candidates. Maximal degree in co-relation 10204. Up to 1160 conditions per place. [2023-08-30 18:10:30,906 INFO L137 encePairwiseOnDemand]: 480/489 looper letters, 117 selfloop transitions, 19 changer transitions 52/194 dead transitions. [2023-08-30 18:10:30,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 2083 flow [2023-08-30 18:10:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:10:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:10:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1519 transitions. [2023-08-30 18:10:30,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3451488298114065 [2023-08-30 18:10:30,908 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1519 transitions. [2023-08-30 18:10:30,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1519 transitions. [2023-08-30 18:10:30,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:10:30,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1519 transitions. [2023-08-30 18:10:30,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 168.77777777777777) internal successors, (1519), 9 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:30,911 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-08-30 18:10:30,911 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-08-30 18:10:30,911 INFO L175 Difference]: Start difference. First operand has 180 places, 148 transitions, 1383 flow. Second operand 9 states and 1519 transitions. [2023-08-30 18:10:30,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 2083 flow [2023-08-30 18:10:30,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 194 transitions, 2008 flow, removed 10 selfloop flow, removed 12 redundant places. [2023-08-30 18:10:30,938 INFO L231 Difference]: Finished difference. Result has 171 places, 134 transitions, 1181 flow [2023-08-30 18:10:30,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1181, PETRI_PLACES=171, PETRI_TRANSITIONS=134} [2023-08-30 18:10:30,938 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 103 predicate places. [2023-08-30 18:10:30,938 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 134 transitions, 1181 flow [2023-08-30 18:10:30,939 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-08-30 18:10:30,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:10:30,939 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-08-30 18:10:30,944 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-08-30 18:10:31,144 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-08-30 18:10:31,144 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-08-30 18:10:31,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:10:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2005470907, now seen corresponding path program 5 times [2023-08-30 18:10:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:10:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462402952] [2023-08-30 18:10:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:10:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-08-30 18:10:31,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:10:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462402952] [2023-08-30 18:10:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462402952] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:10:31,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785710754] [2023-08-30 18:10:31,369 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 18:10:31,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:31,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:10:31,370 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-08-30 18:10:31,371 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-08-30 18:10:32,064 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 18:10:32,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:10:32,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 18:10:32,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:10:32,073 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-08-30 18:10:32,141 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:10:32,141 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-08-30 18:10:32,159 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-08-30 18:10:32,183 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-08-30 18:10:32,201 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-08-30 18:10:32,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:10:32,246 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-08-30 18:10:32,293 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:10:32,293 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-08-30 18:10:32,323 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-08-30 18:10:32,359 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-08-30 18:10:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-08-30 18:10:32,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:10:32,381 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1649 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:10:32,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:10:32,492 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-08-30 18:10:32,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:10:32,500 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-08-30 18:10:32,504 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-08-30 18:10:32,523 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int 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_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int 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_1649) |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|))))) is different from false [2023-08-30 18:10:32,551 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1643 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (= (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_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))) (forall ((v_ArrVal_1643 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_91| Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_91|) (= (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_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0)))) is different from false [2023-08-30 18:10:40,632 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-08-30 18:10:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:10:40,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785710754] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:10:40,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:10:40,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-08-30 18:10:40,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442010384] [2023-08-30 18:10:40,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:10:40,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-30 18:10:40,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:10:40,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-30 18:10:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=12, NotChecked=108, Total=462 [2023-08-30 18:10:40,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 489 [2023-08-30 18:10:40,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 134 transitions, 1181 flow. Second operand has 22 states, 22 states have (on average 159.5909090909091) internal successors, (3511), 22 states have internal predecessors, (3511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:40,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:10:40,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 489 [2023-08-30 18:10:40,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:10:41,123 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_85| 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 .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1648)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)))) (forall ((v_ArrVal_1646 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1646) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)) (= (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_1648)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))))) is different from false [2023-08-30 18:10:41,153 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (exists ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1648 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1648) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_1649 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_85| 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 .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1648)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 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|)) (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|) (forall ((v_ArrVal_1646 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1648 Int) (v_ArrVal_1649 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1646) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_85| 4)) 0)) (= (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_1648)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1649) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85|) 0))))) is different from false [2023-08-30 18:10:41,877 INFO L130 PetriNetUnfolder]: 883/2062 cut-off events. [2023-08-30 18:10:41,877 INFO L131 PetriNetUnfolder]: For 11308/11336 co-relation queries the response was YES. [2023-08-30 18:10:41,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9364 conditions, 2062 events. 883/2062 cut-off events. For 11308/11336 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14917 event pairs, 251 based on Foata normal form. 10/1941 useless extension candidates. Maximal degree in co-relation 9280. Up to 935 conditions per place. [2023-08-30 18:10:41,886 INFO L137 encePairwiseOnDemand]: 474/489 looper letters, 113 selfloop transitions, 41 changer transitions 67/227 dead transitions. [2023-08-30 18:10:41,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 227 transitions, 2179 flow [2023-08-30 18:10:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 18:10:41,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 18:10:41,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2653 transitions. [2023-08-30 18:10:41,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3390848670756646 [2023-08-30 18:10:41,889 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2653 transitions. [2023-08-30 18:10:41,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2653 transitions. [2023-08-30 18:10:41,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:10:41,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2653 transitions. [2023-08-30 18:10:41,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 165.8125) internal successors, (2653), 16 states have internal predecessors, (2653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:41,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 489.0) internal successors, (8313), 17 states have internal predecessors, (8313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:41,895 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 489.0) internal successors, (8313), 17 states have internal predecessors, (8313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:41,895 INFO L175 Difference]: Start difference. First operand has 171 places, 134 transitions, 1181 flow. Second operand 16 states and 2653 transitions. [2023-08-30 18:10:41,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 227 transitions, 2179 flow [2023-08-30 18:10:41,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 227 transitions, 2093 flow, removed 21 selfloop flow, removed 12 redundant places. [2023-08-30 18:10:41,917 INFO L231 Difference]: Finished difference. Result has 173 places, 143 transitions, 1318 flow [2023-08-30 18:10:41,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1318, PETRI_PLACES=173, PETRI_TRANSITIONS=143} [2023-08-30 18:10:41,918 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 105 predicate places. [2023-08-30 18:10:41,918 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 143 transitions, 1318 flow [2023-08-30 18:10:41,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 159.5909090909091) internal successors, (3511), 22 states have internal predecessors, (3511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:10:41,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:10:41,919 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-08-30 18:10:41,926 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-08-30 18:10:42,120 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-08-30 18:10:42,121 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-08-30 18:10:42,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:10:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2123112989, now seen corresponding path program 6 times [2023-08-30 18:10:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:10:42,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223909912] [2023-08-30 18:10:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:42,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:10:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 18:11:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:11:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223909912] [2023-08-30 18:11:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223909912] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:11:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222311791] [2023-08-30 18:11:22,968 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 18:11:22,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:11:22,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:11:22,969 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-08-30 18:11:22,969 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-08-30 18:11:23,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-30 18:11:23,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:11:23,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 18:11:23,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:11:23,309 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-08-30 18:11:23,454 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-30 18:11:23,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-30 18:11:23,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-08-30 18:11:23,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-08-30 18:11:23,571 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-08-30 18:11:23,657 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-08-30 18:11:23,714 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-08-30 18:11:23,768 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-08-30 18:11:23,823 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:11:23,823 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-08-30 18:11:23,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-08-30 18:11:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:11:23,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:11:23,931 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1741 (Array Int Int))) (= (select (select (store |c_#memory_int| |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)) is different from false [2023-08-30 18:11:24,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:11:24,117 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-08-30 18:11:24,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:11:24,123 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-08-30 18:11:24,125 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-08-30 18:11:24,291 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-08-30 18:11:24,321 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1734 (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_1734))) (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_1734 (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_1734))) (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-08-30 18:11:32,438 WARN L222 SmtUtils]: Spent 8.01s 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-08-30 18:11:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:11:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222311791] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:11:32,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:11:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 8] total 32 [2023-08-30 18:11:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447284651] [2023-08-30 18:11:32,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:11:32,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 18:11:32,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:11:32,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 18:11:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=809, Unknown=10, NotChecked=180, Total=1122 [2023-08-30 18:11:32,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 489 [2023-08-30 18:11:32,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 143 transitions, 1318 flow. Second operand has 34 states, 34 states have (on average 150.94117647058823) internal successors, (5132), 34 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:32,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:11:32,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 489 [2023-08-30 18:11:32,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:11:34,772 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |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_1740) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0)))) (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (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_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_1740) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0))))) is different from false [2023-08-30 18:11:35,099 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |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)))) (forall ((v_ArrVal_1739 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1741 (Array Int Int)) (v_ArrVal_1740 (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_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_1740) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_87| 4)) 0))))) is different from false [2023-08-30 18:11:35,456 INFO L130 PetriNetUnfolder]: 817/1892 cut-off events. [2023-08-30 18:11:35,456 INFO L131 PetriNetUnfolder]: For 11478/11480 co-relation queries the response was YES. [2023-08-30 18:11:35,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9368 conditions, 1892 events. 817/1892 cut-off events. For 11478/11480 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13294 event pairs, 145 based on Foata normal form. 9/1783 useless extension candidates. Maximal degree in co-relation 9284. Up to 798 conditions per place. [2023-08-30 18:11:35,464 INFO L137 encePairwiseOnDemand]: 471/489 looper letters, 118 selfloop transitions, 67 changer transitions 44/235 dead transitions. [2023-08-30 18:11:35,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 235 transitions, 2458 flow [2023-08-30 18:11:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-30 18:11:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-30 18:11:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4619 transitions. [2023-08-30 18:11:35,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3148602590320382 [2023-08-30 18:11:35,467 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4619 transitions. [2023-08-30 18:11:35,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4619 transitions. [2023-08-30 18:11:35,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:11:35,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4619 transitions. [2023-08-30 18:11:35,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 153.96666666666667) internal successors, (4619), 30 states have internal predecessors, (4619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:35,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 489.0) internal successors, (15159), 31 states have internal predecessors, (15159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:35,478 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 489.0) internal successors, (15159), 31 states have internal predecessors, (15159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:35,478 INFO L175 Difference]: Start difference. First operand has 173 places, 143 transitions, 1318 flow. Second operand 30 states and 4619 transitions. [2023-08-30 18:11:35,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 235 transitions, 2458 flow [2023-08-30 18:11:35,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 235 transitions, 2351 flow, removed 32 selfloop flow, removed 9 redundant places. [2023-08-30 18:11:35,501 INFO L231 Difference]: Finished difference. Result has 196 places, 167 transitions, 1615 flow [2023-08-30 18:11:35,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1615, PETRI_PLACES=196, PETRI_TRANSITIONS=167} [2023-08-30 18:11:35,502 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 128 predicate places. [2023-08-30 18:11:35,502 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 167 transitions, 1615 flow [2023-08-30 18:11:35,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 150.94117647058823) internal successors, (5132), 34 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:35,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:11:35,503 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-08-30 18:11:35,508 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-08-30 18:11:35,708 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-08-30 18:11:35,708 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-08-30 18:11:35,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:11:35,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1092134129, now seen corresponding path program 7 times [2023-08-30 18:11:35,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:11:35,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823774118] [2023-08-30 18:11:35,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:35,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:11:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:35,977 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:11:35,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:11:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823774118] [2023-08-30 18:11:35,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823774118] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:11:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584832834] [2023-08-30 18:11:35,978 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 18:11:35,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:11:35,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:11:35,981 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-08-30 18:11:35,983 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-08-30 18:11:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:36,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-30 18:11:36,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:11:36,136 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-08-30 18:11:36,178 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:11:36,178 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-08-30 18:11:36,185 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-08-30 18:11:36,201 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-08-30 18:11:36,212 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-08-30 18:11:36,238 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:11:36,238 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-08-30 18:11:36,289 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-08-30 18:11:36,323 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-08-30 18:11:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-30 18:11:36,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:11:36,360 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1831 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:11:36,416 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-08-30 18:11:36,419 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-08-30 18:11:36,424 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_95| Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_89| |v_t_funThread2of2ForFork0_~p~0#1.offset_95|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_95| v_ArrVal_1829)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_89|) 0))) is different from false [2023-08-30 18:11:36,433 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_89| Int) (v_ArrVal_1831 (Array Int Int)) (v_ArrVal_1829 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_95| Int) (v_ArrVal_1826 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_89| |v_t_funThread2of2ForFork0_~p~0#1.offset_95|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1826))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_95| v_ArrVal_1829))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1831) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_89|) 0))) is different from false [2023-08-30 18:11:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-30 18:11:36,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584832834] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:11:36,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:11:36,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2023-08-30 18:11:36,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167096646] [2023-08-30 18:11:36,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:11:36,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 18:11:36,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:11:36,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 18:11:36,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=158, Unknown=8, NotChecked=84, Total=306 [2023-08-30 18:11:36,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 489 [2023-08-30 18:11:36,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 167 transitions, 1615 flow. Second operand has 18 states, 18 states have (on average 158.55555555555554) internal successors, (2854), 18 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:36,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:11:36,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 489 [2023-08-30 18:11:36,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:11:37,751 INFO L130 PetriNetUnfolder]: 797/1892 cut-off events. [2023-08-30 18:11:37,751 INFO L131 PetriNetUnfolder]: For 15414/15424 co-relation queries the response was YES. [2023-08-30 18:11:37,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10690 conditions, 1892 events. 797/1892 cut-off events. For 15414/15424 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13481 event pairs, 190 based on Foata normal form. 9/1901 useless extension candidates. Maximal degree in co-relation 10591. Up to 805 conditions per place. [2023-08-30 18:11:37,759 INFO L137 encePairwiseOnDemand]: 478/489 looper letters, 119 selfloop transitions, 23 changer transitions 88/236 dead transitions. [2023-08-30 18:11:37,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 236 transitions, 2726 flow [2023-08-30 18:11:37,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:11:37,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:11:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2303 transitions. [2023-08-30 18:11:37,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33640081799591004 [2023-08-30 18:11:37,761 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2303 transitions. [2023-08-30 18:11:37,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2303 transitions. [2023-08-30 18:11:37,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:11:37,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2303 transitions. [2023-08-30 18:11:37,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 164.5) internal successors, (2303), 14 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:37,766 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-08-30 18:11:37,766 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-08-30 18:11:37,766 INFO L175 Difference]: Start difference. First operand has 196 places, 167 transitions, 1615 flow. Second operand 14 states and 2303 transitions. [2023-08-30 18:11:37,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 236 transitions, 2726 flow [2023-08-30 18:11:37,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 236 transitions, 2528 flow, removed 66 selfloop flow, removed 18 redundant places. [2023-08-30 18:11:37,794 INFO L231 Difference]: Finished difference. Result has 191 places, 141 transitions, 1272 flow [2023-08-30 18:11:37,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1272, PETRI_PLACES=191, PETRI_TRANSITIONS=141} [2023-08-30 18:11:37,795 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 123 predicate places. [2023-08-30 18:11:37,795 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 141 transitions, 1272 flow [2023-08-30 18:11:37,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 158.55555555555554) internal successors, (2854), 18 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:11:37,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:11:37,795 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-08-30 18:11:37,802 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-08-30 18:11:37,995 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-08-30 18:11:37,995 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-08-30 18:11:37,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:11:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1820711057, now seen corresponding path program 1 times [2023-08-30 18:11:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:11:37,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698569099] [2023-08-30 18:11:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:37,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:11:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:38,260 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:11:38,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:11:38,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698569099] [2023-08-30 18:11:38,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698569099] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:11:38,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439024986] [2023-08-30 18:11:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:38,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:11:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:11:38,261 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-08-30 18:11:38,299 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-08-30 18:11:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:38,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 18:11:38,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:11:38,436 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-08-30 18:11:38,491 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:11:38,491 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-08-30 18:11:38,500 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-08-30 18:11:38,541 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-08-30 18:11:38,564 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-08-30 18:11:38,607 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-08-30 18:11:38,609 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 16 [2023-08-30 18:11:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:11:38,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:12:02,681 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-08-30 18:12:04,685 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-08-30 18:12:06,692 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-08-30 18:12:16,718 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1924 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1924) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|))) is different from false [2023-08-30 18:12:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-30 18:12:16,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439024986] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:12:16,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:12:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 18 [2023-08-30 18:12:16,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358334486] [2023-08-30 18:12:16,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:12:16,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 18:12:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:12:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 18:12:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=185, Unknown=14, NotChecked=124, Total=380 [2023-08-30 18:12:16,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 489 [2023-08-30 18:12:16,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 141 transitions, 1272 flow. Second operand has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:12:16,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:12:16,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 489 [2023-08-30 18:12:16,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:12:24,933 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 29 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:12:29,402 INFO L130 PetriNetUnfolder]: 590/1414 cut-off events. [2023-08-30 18:12:29,402 INFO L131 PetriNetUnfolder]: For 12909/12920 co-relation queries the response was YES. [2023-08-30 18:12:29,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7963 conditions, 1414 events. 590/1414 cut-off events. For 12909/12920 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9622 event pairs, 144 based on Foata normal form. 11/1425 useless extension candidates. Maximal degree in co-relation 7872. Up to 694 conditions per place. [2023-08-30 18:12:29,409 INFO L137 encePairwiseOnDemand]: 475/489 looper letters, 137 selfloop transitions, 50 changer transitions 21/216 dead transitions. [2023-08-30 18:12:29,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 216 transitions, 2452 flow [2023-08-30 18:12:29,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-30 18:12:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-30 18:12:29,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2869 transitions. [2023-08-30 18:12:29,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3666922290388548 [2023-08-30 18:12:29,411 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2869 transitions. [2023-08-30 18:12:29,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2869 transitions. [2023-08-30 18:12:29,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:12:29,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2869 transitions. [2023-08-30 18:12:29,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 179.3125) internal successors, (2869), 16 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:12:29,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 489.0) internal successors, (8313), 17 states have internal predecessors, (8313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:12:29,417 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 489.0) internal successors, (8313), 17 states have internal predecessors, (8313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:12:29,417 INFO L175 Difference]: Start difference. First operand has 191 places, 141 transitions, 1272 flow. Second operand 16 states and 2869 transitions. [2023-08-30 18:12:29,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 216 transitions, 2452 flow [2023-08-30 18:12:29,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 216 transitions, 2341 flow, removed 27 selfloop flow, removed 17 redundant places. [2023-08-30 18:12:29,437 INFO L231 Difference]: Finished difference. Result has 176 places, 160 transitions, 1517 flow [2023-08-30 18:12:29,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=489, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1517, PETRI_PLACES=176, PETRI_TRANSITIONS=160} [2023-08-30 18:12:29,437 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 108 predicate places. [2023-08-30 18:12:29,437 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 160 transitions, 1517 flow [2023-08-30 18:12:29,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:12:29,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:12:29,438 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-08-30 18:12:29,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-08-30 18:12:29,643 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-08-30 18:12:29,644 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-08-30 18:12:29,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:12:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1543710983, now seen corresponding path program 2 times [2023-08-30 18:12:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:12:29,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469313999] [2023-08-30 18:12:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:12:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:12:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:12:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:12:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:12:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469313999] [2023-08-30 18:12:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469313999] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:12:29,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713238503] [2023-08-30 18:12:29,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:12:29,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:12:29,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:12:29,907 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-08-30 18:12:29,907 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-08-30 18:12:30,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:12:30,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:12:30,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 18:12:30,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:12:30,052 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-08-30 18:12:30,115 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:12:30,115 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-08-30 18:12:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:12:30,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:12:30,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:12:30,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:12:30,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-30 18:12:30,326 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-08-30 18:12:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-30 18:12:30,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:12:36,377 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-08-30 18:12:38,381 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_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:12:40,387 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-08-30 18:12:42,395 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-08-30 18:12:48,420 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int 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_2021))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:12:50,434 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2021 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2021) |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-30 18:12:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-30 18:12:50,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713238503] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:12:50,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:12:50,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-30 18:12:50,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961328687] [2023-08-30 18:12:50,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:12:50,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-30 18:12:50,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:12:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-30 18:12:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=392, Unknown=10, NotChecked=270, Total=756 [2023-08-30 18:12:50,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 489 [2023-08-30 18:12:50,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 160 transitions, 1517 flow. Second operand has 28 states, 28 states have (on average 174.17857142857142) internal successors, (4877), 28 states have internal predecessors, (4877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:12:50,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:12:50,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 489 [2023-08-30 18:12:50,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:13:12,624 WARN L222 SmtUtils]: Spent 22.03s on a formula simplification. DAG size of input: 27 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:13:14,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:16,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:18,634 WARN L539 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-08-30 18:13:20,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-08-30 18:13:22,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-08-30 18:13:24,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 [1] [2023-08-30 18:13:26,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:28,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:30,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:32,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:34,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:36,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:13:38,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:08,739 WARN L222 SmtUtils]: Spent 30.03s on a formula simplification. DAG size of input: 31 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:14:10,746 WARN L539 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-08-30 18:14:12,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 [1] [2023-08-30 18:14:14,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:16,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:18,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:20,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:22,803 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-08-30 18:14:24,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:26,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:28,833 WARN L539 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-08-30 18:14:30,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:32,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:34,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:14:36,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:38,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:40,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:42,894 WARN L539 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-08-30 18:14:44,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:14:46,936 WARN L539 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] Killed by 15