./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_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_75-tricky_address2_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 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --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 17:59:28,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 17:59:28,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 17:59:28,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 17:59:28,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 17:59:28,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 17:59:28,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 17:59:28,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 17:59:28,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 17:59:28,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 17:59:28,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 17:59:28,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 17:59:28,369 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 17:59:28,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 17:59:28,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 17:59:28,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 17:59:28,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 17:59:28,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 17:59:28,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 17:59:28,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 17:59:28,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 17:59:28,386 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 17:59:28,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 17:59:28,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 17:59:28,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 17:59:28,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 17:59:28,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 17:59:28,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 17:59:28,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 17:59:28,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 17:59:28,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 17:59:28,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 17:59:28,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 17:59:28,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 17:59:28,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 17:59:28,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 17:59:28,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 17:59:28,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 17:59:28,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 17:59:28,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 17:59:28,403 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 17:59:28,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 17:59:28,439 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 17:59:28,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 17:59:28,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 17:59:28,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 17:59:28,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 17:59:28,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 17:59:28,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 17:59:28,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 17:59:28,443 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 17:59:28,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 17:59:28,443 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 17:59:28,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 17:59:28,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 17:59:28,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 17:59:28,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 17:59:28,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 17:59:28,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 17:59:28,445 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 17:59:28,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 17:59:28,445 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 17:59:28,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 17:59:28,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 17:59:28,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 17:59:28,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 17:59:28,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:59:28,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 17:59:28,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 17:59:28,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 17:59:28,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 17:59:28,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 17:59:28,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 17:59:28,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 17:59:28,447 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 17:59:28,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 17:59:28,448 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 17:59:28,448 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 -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df 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 17:59:28,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 17:59:28,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 17:59:28,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 17:59:28,786 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 17:59:28,786 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 17:59:28,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-08-30 17:59:29,828 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 17:59:30,064 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 17:59:30,064 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-08-30 17:59:30,079 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b680196/110070b74ec24677904f1aaa486bc4bd/FLAG33a8772b1 [2023-08-30 17:59:30,099 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b680196/110070b74ec24677904f1aaa486bc4bd [2023-08-30 17:59:30,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 17:59:30,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 17:59:30,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 17:59:30,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 17:59:30,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 17:59:30,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e9fe4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30, skipping insertion in model container [2023-08-30 17:59:30,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 17:59:30,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 17:59:30,558 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_75-tricky_address2_racefree.i[41323,41336] [2023-08-30 17:59:30,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:59:30,620 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 17:59:30,676 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_75-tricky_address2_racefree.i[41323,41336] [2023-08-30 17:59:30,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 17:59:30,748 INFO L208 MainTranslator]: Completed translation [2023-08-30 17:59:30,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30 WrapperNode [2023-08-30 17:59:30,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 17:59:30,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 17:59:30,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 17:59:30,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 17:59:30,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,811 INFO L138 Inliner]: procedures = 270, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 190 [2023-08-30 17:59:30,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 17:59:30,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 17:59:30,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 17:59:30,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 17:59:30,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,860 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 17:59:30,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 17:59:30,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 17:59:30,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 17:59:30,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (1/1) ... [2023-08-30 17:59:30,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 17:59:30,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:30,901 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 17:59:30,909 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 17:59:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 17:59:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 17:59:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 17:59:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 17:59:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-30 17:59:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 17:59:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-30 17:59:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-30 17:59:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 17:59:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 17:59:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 17:59:30,940 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 17:59:31,128 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 17:59:31,130 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 17:59:31,396 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 17:59:31,405 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 17:59:31,406 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-30 17:59:31,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:59:31 BoogieIcfgContainer [2023-08-30 17:59:31,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 17:59:31,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 17:59:31,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 17:59:31,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 17:59:31,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 05:59:30" (1/3) ... [2023-08-30 17:59:31,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383316ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:59:31, skipping insertion in model container [2023-08-30 17:59:31,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 05:59:30" (2/3) ... [2023-08-30 17:59:31,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383316ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 05:59:31, skipping insertion in model container [2023-08-30 17:59:31,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 05:59:31" (3/3) ... [2023-08-30 17:59:31,419 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2023-08-30 17:59:31,426 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 17:59:31,434 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 17:59:31,434 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 17:59:31,434 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 17:59:31,530 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-30 17:59:31,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:59:31,679 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-08-30 17:59:31,680 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 17:59:31,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:59:31,688 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:59:31,696 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:31,700 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:59:31,711 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:31,714 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:31,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:31,748 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-08-30 17:59:31,748 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:31,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:59:31,755 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-30 17:59:34,323 INFO L134 LiptonReduction]: Checked pairs total: 15158 [2023-08-30 17:59:34,323 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-30 17:59:34,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 17:59:34,340 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;@3c4dff15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:59:34,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-30 17:59:34,344 INFO L130 PetriNetUnfolder]: 5/25 cut-off events. [2023-08-30 17:59:34,344 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:34,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:34,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 17:59:34,345 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 17:59:34,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 826457834, now seen corresponding path program 1 times [2023-08-30 17:59:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771273641] [2023-08-30 17:59:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:34,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:34,539 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 17:59:34,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:34,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771273641] [2023-08-30 17:59:34,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771273641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:34,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:59:34,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:59:34,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898685188] [2023-08-30 17:59:34,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:34,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:59:34,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:59:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:59:34,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-30 17:59:34,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 65 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:59:34,593 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:34,593 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-30 17:59:34,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:34,718 INFO L130 PetriNetUnfolder]: 301/651 cut-off events. [2023-08-30 17:59:34,718 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:34,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 651 events. 301/651 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3189 event pairs, 266 based on Foata normal form. 107/643 useless extension candidates. Maximal degree in co-relation 1189. Up to 588 conditions per place. [2023-08-30 17:59:34,722 INFO L137 encePairwiseOnDemand]: 318/341 looper letters, 36 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-30 17:59:34,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-30 17:59:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:59:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:59:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2023-08-30 17:59:34,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512218963831867 [2023-08-30 17:59:34,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2023-08-30 17:59:34,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2023-08-30 17:59:34,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:34,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2023-08-30 17:59:34,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:59:34,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 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 17:59:34,750 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 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 17:59:34,752 INFO L175 Difference]: Start difference. First operand has 45 places, 65 transitions, 135 flow. Second operand 3 states and 524 transitions. [2023-08-30 17:59:34,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-30 17:59:34,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:59:34,756 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 107 flow [2023-08-30 17:59:34,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2023-08-30 17:59:34,760 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-30 17:59:34,761 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 107 flow [2023-08-30 17:59:34,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:59:34,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:34,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:34,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 17:59:34,762 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 17:59:34,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash -669135341, now seen corresponding path program 1 times [2023-08-30 17:59:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:34,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499344127] [2023-08-30 17:59:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:34,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:34,882 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 17:59:34,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499344127] [2023-08-30 17:59:34,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499344127] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:34,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396746954] [2023-08-30 17:59:34,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:34,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:34,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:34,887 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 17:59:34,893 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 17:59:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:34,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 17:59:34,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:34,987 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 17:59:34,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:59:34,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396746954] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:34,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:59:34,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 17:59:34,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798898980] [2023-08-30 17:59:34,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:34,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:59:34,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:34,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:59:34,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 17:59:35,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 341 [2023-08-30 17:59:35,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:59:35,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:35,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 341 [2023-08-30 17:59:35,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:35,149 INFO L130 PetriNetUnfolder]: 283/635 cut-off events. [2023-08-30 17:59:35,149 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:35,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 635 events. 283/635 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3546 event pairs, 0 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 1221. Up to 555 conditions per place. [2023-08-30 17:59:35,153 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 51 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-30 17:59:35,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 243 flow [2023-08-30 17:59:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:59:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:59:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-08-30 17:59:35,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063538611925709 [2023-08-30 17:59:35,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-08-30 17:59:35,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-08-30 17:59:35,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:35,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-08-30 17:59:35,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 17:59:35,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 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 17:59:35,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 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 17:59:35,164 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 107 flow. Second operand 3 states and 518 transitions. [2023-08-30 17:59:35,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 243 flow [2023-08-30 17:59:35,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 239 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 17:59:35,167 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 111 flow [2023-08-30 17:59:35,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-30 17:59:35,168 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-08-30 17:59:35,168 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 111 flow [2023-08-30 17:59:35,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:59:35,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:35,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:35,178 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 17:59:35,375 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 17:59:35,375 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 17:59:35,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash 735439460, now seen corresponding path program 1 times [2023-08-30 17:59:35,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:35,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631598818] [2023-08-30 17:59:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:35,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:35,470 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 17:59:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631598818] [2023-08-30 17:59:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631598818] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727424074] [2023-08-30 17:59:35,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:35,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:35,473 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 17:59:35,493 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 17:59:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:35,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:59:35,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:35,569 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 17:59:35,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:35,584 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 17:59:35,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727424074] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:35,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:35,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:59:35,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535695709] [2023-08-30 17:59:35,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:35,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:59:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:59:35,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:59:35,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 341 [2023-08-30 17:59:35,609 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 111 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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 17:59:35,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:35,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 341 [2023-08-30 17:59:35,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:35,749 INFO L130 PetriNetUnfolder]: 301/637 cut-off events. [2023-08-30 17:59:35,749 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-30 17:59:35,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 637 events. 301/637 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3076 event pairs, 266 based on Foata normal form. 3/547 useless extension candidates. Maximal degree in co-relation 1245. Up to 571 conditions per place. [2023-08-30 17:59:35,752 INFO L137 encePairwiseOnDemand]: 338/341 looper letters, 36 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-30 17:59:35,752 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 205 flow [2023-08-30 17:59:35,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:59:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:59:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2023-08-30 17:59:35,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2023-08-30 17:59:35,755 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2023-08-30 17:59:35,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2023-08-30 17:59:35,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:35,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2023-08-30 17:59:35,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 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 17:59:35,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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 17:59:35,763 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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 17:59:35,763 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 111 flow. Second operand 6 states and 968 transitions. [2023-08-30 17:59:35,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 205 flow [2023-08-30 17:59:35,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 17:59:35,766 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 143 flow [2023-08-30 17:59:35,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-30 17:59:35,767 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2023-08-30 17:59:35,767 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 143 flow [2023-08-30 17:59:35,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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 17:59:35,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:35,769 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:35,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-30 17:59:35,975 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 17:59:35,975 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 17:59:35,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:35,977 INFO L85 PathProgramCache]: Analyzing trace with hash 967406523, now seen corresponding path program 2 times [2023-08-30 17:59:35,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:35,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007040769] [2023-08-30 17:59:35,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:35,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:36,129 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 17:59:36,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007040769] [2023-08-30 17:59:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007040769] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:36,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251362909] [2023-08-30 17:59:36,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:59:36,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:36,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:36,131 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 17:59:36,133 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 17:59:36,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 17:59:36,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:59:36,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 17:59:36,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:36,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 17:59:36,334 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:36,335 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 17:59:36,369 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 17:59:36,444 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 17:59:36,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:59:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251362909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:59:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 17:59:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564286666] [2023-08-30 17:59:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:36,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 17:59:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:36,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 17:59:36,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-30 17:59:36,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 341 [2023-08-30 17:59:36,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 143 flow. Second operand has 6 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 0 states have call successors, (0), 0 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 17:59:36,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:36,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 341 [2023-08-30 17:59:36,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:36,799 INFO L130 PetriNetUnfolder]: 298/678 cut-off events. [2023-08-30 17:59:36,799 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2023-08-30 17:59:36,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 678 events. 298/678 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3515 event pairs, 49 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 1314. Up to 416 conditions per place. [2023-08-30 17:59:36,802 INFO L137 encePairwiseOnDemand]: 333/341 looper letters, 44 selfloop transitions, 6 changer transitions 34/91 dead transitions. [2023-08-30 17:59:36,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 399 flow [2023-08-30 17:59:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:59:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:59:36,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 971 transitions. [2023-08-30 17:59:36,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47458455522971654 [2023-08-30 17:59:36,805 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 971 transitions. [2023-08-30 17:59:36,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 971 transitions. [2023-08-30 17:59:36,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:36,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 971 transitions. [2023-08-30 17:59:36,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 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 17:59:36,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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 17:59:36,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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 17:59:36,813 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 143 flow. Second operand 6 states and 971 transitions. [2023-08-30 17:59:36,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 399 flow [2023-08-30 17:59:36,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 385 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 17:59:36,815 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 157 flow [2023-08-30 17:59:36,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=157, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-30 17:59:36,816 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2023-08-30 17:59:36,816 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 157 flow [2023-08-30 17:59:36,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.33333333333334) internal successors, (896), 6 states have internal predecessors, (896), 0 states have call successors, (0), 0 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 17:59:36,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:36,817 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:36,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 17:59:37,023 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 17:59:37,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-30 17:59:37,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:37,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1432371976, now seen corresponding path program 1 times [2023-08-30 17:59:37,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:37,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194834794] [2023-08-30 17:59:37,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:37,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:37,097 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 17:59:37,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194834794] [2023-08-30 17:59:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194834794] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902450093] [2023-08-30 17:59:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:37,100 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 17:59:37,103 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 17:59:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:37,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:59:37,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:37,226 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 17:59:37,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:37,282 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 17:59:37,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902450093] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:37,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:37,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 17:59:37,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563640160] [2023-08-30 17:59:37,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:37,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 17:59:37,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 17:59:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 17:59:37,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 341 [2023-08-30 17:59:37,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 157 flow. Second operand has 14 states, 14 states have (on average 153.07142857142858) internal successors, (2143), 14 states have internal predecessors, (2143), 0 states have call successors, (0), 0 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 17:59:37,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:37,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 341 [2023-08-30 17:59:37,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:37,388 INFO L130 PetriNetUnfolder]: 23/80 cut-off events. [2023-08-30 17:59:37,388 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-30 17:59:37,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 80 events. 23/80 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 8 based on Foata normal form. 18/95 useless extension candidates. Maximal degree in co-relation 204. Up to 46 conditions per place. [2023-08-30 17:59:37,389 INFO L137 encePairwiseOnDemand]: 336/341 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2023-08-30 17:59:37,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 236 flow [2023-08-30 17:59:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 17:59:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 17:59:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2160 transitions. [2023-08-30 17:59:37,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45245077503142017 [2023-08-30 17:59:37,395 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2160 transitions. [2023-08-30 17:59:37,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2160 transitions. [2023-08-30 17:59:37,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:37,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2160 transitions. [2023-08-30 17:59:37,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 154.28571428571428) internal successors, (2160), 14 states have internal predecessors, (2160), 0 states have call successors, (0), 0 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 17:59:37,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 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 17:59:37,415 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 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 17:59:37,415 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 157 flow. Second operand 14 states and 2160 transitions. [2023-08-30 17:59:37,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 236 flow [2023-08-30 17:59:37,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 17:59:37,417 INFO L231 Difference]: Finished difference. Result has 46 places, 0 transitions, 0 flow [2023-08-30 17:59:37,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=46, PETRI_TRANSITIONS=0} [2023-08-30 17:59:37,418 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2023-08-30 17:59:37,418 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 0 transitions, 0 flow [2023-08-30 17:59:37,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 153.07142857142858) internal successors, (2143), 14 states have internal predecessors, (2143), 0 states have call successors, (0), 0 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 17:59:37,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-30 17:59:37,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-30 17:59:37,421 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-30 17:59:37,432 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 17:59:37,632 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 17:59:37,632 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-08-30 17:59:37,634 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-30 17:59:37,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:59:37,655 INFO L130 PetriNetUnfolder]: 45/260 cut-off events. [2023-08-30 17:59:37,655 INFO L131 PetriNetUnfolder]: For 1/2 co-relation queries the response was YES. [2023-08-30 17:59:37,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 260 events. 45/260 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 817 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:59:37,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 190 transitions, 388 flow [2023-08-30 17:59:37,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:37,658 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:59:37,658 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:37,658 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:37,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 185 transitions, 375 flow [2023-08-30 17:59:37,673 INFO L130 PetriNetUnfolder]: 44/255 cut-off events. [2023-08-30 17:59:37,673 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:37,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 255 events. 44/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 143. Up to 8 conditions per place. [2023-08-30 17:59:37,678 INFO L119 LiptonReduction]: Number of co-enabled transitions 10336 [2023-08-30 17:59:40,001 INFO L134 LiptonReduction]: Checked pairs total: 16649 [2023-08-30 17:59:40,001 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-08-30 17:59:40,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 17:59:40,004 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;@3c4dff15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:59:40,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 17:59:40,007 INFO L130 PetriNetUnfolder]: 11/41 cut-off events. [2023-08-30 17:59:40,007 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:40,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:40,007 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-30 17:59:40,008 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:59:40,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1785070566, now seen corresponding path program 1 times [2023-08-30 17:59:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:40,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833652987] [2023-08-30 17:59:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:40,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:40,030 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 17:59:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833652987] [2023-08-30 17:59:40,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833652987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:40,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:59:40,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:59:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964241452] [2023-08-30 17:59:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:40,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:59:40,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:40,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:59:40,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:59:40,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 340 [2023-08-30 17:59:40,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 66 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:59:40,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:40,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 340 [2023-08-30 17:59:40,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:40,145 INFO L130 PetriNetUnfolder]: 300/656 cut-off events. [2023-08-30 17:59:40,146 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:40,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 656 events. 300/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3223 event pairs, 266 based on Foata normal form. 108/654 useless extension candidates. Maximal degree in co-relation 1194. Up to 588 conditions per place. [2023-08-30 17:59:40,147 INFO L137 encePairwiseOnDemand]: 316/340 looper letters, 20 selfloop transitions, 2 changer transitions 19/46 dead transitions. [2023-08-30 17:59:40,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 173 flow [2023-08-30 17:59:40,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:59:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:59:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-30 17:59:40,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2023-08-30 17:59:40,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-30 17:59:40,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-30 17:59:40,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:40,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-30 17:59:40,152 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 17:59:40,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 17:59:40,153 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 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 17:59:40,154 INFO L175 Difference]: Start difference. First operand has 45 places, 66 transitions, 137 flow. Second operand 3 states and 525 transitions. [2023-08-30 17:59:40,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 173 flow [2023-08-30 17:59:40,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:59:40,155 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 69 flow [2023-08-30 17:59:40,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-08-30 17:59:40,156 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-30 17:59:40,156 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 69 flow [2023-08-30 17:59:40,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 17:59:40,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:40,157 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:40,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 17:59:40,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:59:40,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:40,157 INFO L85 PathProgramCache]: Analyzing trace with hash -523375806, now seen corresponding path program 1 times [2023-08-30 17:59:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360491925] [2023-08-30 17:59:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:40,186 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 17:59:40,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:40,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360491925] [2023-08-30 17:59:40,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360491925] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:40,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864915072] [2023-08-30 17:59:40,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:40,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:40,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:40,189 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 17:59:40,221 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 17:59:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:40,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:59:40,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:40,278 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 17:59:40,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:40,292 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 17:59:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864915072] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:40,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:59:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816305905] [2023-08-30 17:59:40,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:40,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:59:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:40,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:59:40,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:59:40,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-30 17:59:40,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 69 flow. Second operand has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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 17:59:40,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:40,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-30 17:59:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:40,345 INFO L130 PetriNetUnfolder]: 47/128 cut-off events. [2023-08-30 17:59:40,345 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:40,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 128 events. 47/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 243. Up to 108 conditions per place. [2023-08-30 17:59:40,346 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-30 17:59:40,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 131 flow [2023-08-30 17:59:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:59:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:59:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-30 17:59:40,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-30 17:59:40,349 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-30 17:59:40,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-30 17:59:40,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:40,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-30 17:59:40,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 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 17:59:40,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 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 17:59:40,356 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 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 17:59:40,357 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 69 flow. Second operand 6 states and 952 transitions. [2023-08-30 17:59:40,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 131 flow [2023-08-30 17:59:40,357 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 17:59:40,358 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2023-08-30 17:59:40,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, 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 17:59:40,359 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2023-08-30 17:59:40,359 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2023-08-30 17:59:40,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 155.57142857142858) internal successors, (1089), 7 states have internal predecessors, (1089), 0 states have call successors, (0), 0 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 17:59:40,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:40,360 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-30 17:59:40,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 17:59:40,566 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 17:59:40,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:59:40,567 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1162836454, now seen corresponding path program 2 times [2023-08-30 17:59:40,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:40,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400616797] [2023-08-30 17:59:40,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:40,655 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 17:59:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:40,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400616797] [2023-08-30 17:59:40,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400616797] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:40,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473626144] [2023-08-30 17:59:40,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:59:40,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:40,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:40,656 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 17:59:40,658 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 17:59:40,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 17:59:40,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:59:40,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:59:40,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:40,735 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 17:59:40,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:40,773 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 17:59:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473626144] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:40,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:40,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 17:59:40,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113678260] [2023-08-30 17:59:40,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:40,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 17:59:40,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:40,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 17:59:40,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 17:59:40,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 340 [2023-08-30 17:59:40,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 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 17:59:40,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:40,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 340 [2023-08-30 17:59:40,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:40,891 INFO L130 PetriNetUnfolder]: 47/134 cut-off events. [2023-08-30 17:59:40,891 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-30 17:59:40,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 134 events. 47/134 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 358 event pairs, 42 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 234. Up to 108 conditions per place. [2023-08-30 17:59:40,892 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 20 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2023-08-30 17:59:40,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 199 flow [2023-08-30 17:59:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 17:59:40,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 17:59:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1885 transitions. [2023-08-30 17:59:40,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46200980392156865 [2023-08-30 17:59:40,898 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1885 transitions. [2023-08-30 17:59:40,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1885 transitions. [2023-08-30 17:59:40,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:40,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1885 transitions. [2023-08-30 17:59:40,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 157.08333333333334) internal successors, (1885), 12 states have internal predecessors, (1885), 0 states have call successors, (0), 0 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 17:59:40,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 0 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 17:59:40,909 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 340.0) internal successors, (4420), 13 states have internal predecessors, (4420), 0 states have call successors, (0), 0 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 17:59:40,910 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 12 states and 1885 transitions. [2023-08-30 17:59:40,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 199 flow [2023-08-30 17:59:40,913 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 17:59:40,914 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 171 flow [2023-08-30 17:59:40,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, 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 17:59:40,917 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2023-08-30 17:59:40,917 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 171 flow [2023-08-30 17:59:40,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 155.30769230769232) internal successors, (2019), 13 states have internal predecessors, (2019), 0 states have call successors, (0), 0 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 17:59:40,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:40,918 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-30 17:59:40,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 17:59:41,124 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 17:59:41,125 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 17:59:41,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash -834996966, now seen corresponding path program 3 times [2023-08-30 17:59:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499074450] [2023-08-30 17:59:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 17:59:41,149 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 17:59:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 17:59:41,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 17:59:41,177 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 17:59:41,177 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 17:59:41,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 17:59:41,178 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-30 17:59:41,178 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 17:59:41,179 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 17:59:41,179 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-30 17:59:41,200 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-30 17:59:41,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 17:59:41,237 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-08-30 17:59:41,237 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 17:59:41,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-30 17:59:41,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 17:59:41,244 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-30 17:59:41,244 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 17:59:41,244 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-30 17:59:41,244 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-30 17:59:41,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 17:59:41,277 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-08-30 17:59:41,277 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 17:59:41,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-30 17:59:41,297 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-30 17:59:44,018 INFO L134 LiptonReduction]: Checked pairs total: 49651 [2023-08-30 17:59:44,018 INFO L136 LiptonReduction]: Total number of compositions: 216 [2023-08-30 17:59:44,020 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 17:59:44,020 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;@3c4dff15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 17:59:44,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 17:59:44,022 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2023-08-30 17:59:44,023 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 17:59:44,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:44,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 17:59:44,023 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 17:59:44,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash -200231614, now seen corresponding path program 1 times [2023-08-30 17:59:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533873259] [2023-08-30 17:59:44,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:44,043 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 17:59:44,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:44,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533873259] [2023-08-30 17:59:44,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533873259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:44,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:59:44,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 17:59:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425032803] [2023-08-30 17:59:44,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:44,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:59:44,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:44,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:59:44,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 17:59:44,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-30 17:59:44,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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 17:59:44,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:44,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-30 17:59:44,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:45,230 INFO L130 PetriNetUnfolder]: 9872/15757 cut-off events. [2023-08-30 17:59:45,231 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-30 17:59:45,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30205 conditions, 15757 events. 9872/15757 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 104375 event pairs, 9112 based on Foata normal form. 2730/16056 useless extension candidates. Maximal degree in co-relation 12164. Up to 14349 conditions per place. [2023-08-30 17:59:45,302 INFO L137 encePairwiseOnDemand]: 441/476 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-30 17:59:45,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-30 17:59:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:59:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:59:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-30 17:59:45,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2023-08-30 17:59:45,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-30 17:59:45,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-30 17:59:45,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:45,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-30 17:59:45,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 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 17:59:45,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 17:59:45,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 17:59:45,310 INFO L175 Difference]: Start difference. First operand has 68 places, 101 transitions, 220 flow. Second operand 3 states and 720 transitions. [2023-08-30 17:59:45,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-30 17:59:45,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:59:45,313 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 168 flow [2023-08-30 17:59:45,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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 17:59:45,314 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-30 17:59:45,314 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 168 flow [2023-08-30 17:59:45,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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 17:59:45,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:45,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:45,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 17:59:45,315 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 17:59:45,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1798379354, now seen corresponding path program 1 times [2023-08-30 17:59:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455922924] [2023-08-30 17:59:45,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:45,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:45,346 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 17:59:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:45,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455922924] [2023-08-30 17:59:45,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455922924] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:45,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986216686] [2023-08-30 17:59:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:45,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:45,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:45,349 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 17:59:45,401 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 17:59:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:45,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 17:59:45,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:45,444 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 17:59:45,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:59:45,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986216686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:45,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:59:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 17:59:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800417666] [2023-08-30 17:59:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:45,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 17:59:45,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:45,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 17:59:45,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 17:59:45,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 476 [2023-08-30 17:59:45,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 17:59:45,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:45,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 476 [2023-08-30 17:59:45,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:46,581 INFO L130 PetriNetUnfolder]: 9675/15570 cut-off events. [2023-08-30 17:59:46,581 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-30 17:59:46,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30030 conditions, 15570 events. 9675/15570 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 105458 event pairs, 4312 based on Foata normal form. 0/13126 useless extension candidates. Maximal degree in co-relation 30017. Up to 14317 conditions per place. [2023-08-30 17:59:46,659 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 72 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-30 17:59:46,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 350 flow [2023-08-30 17:59:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 17:59:46,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 17:59:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2023-08-30 17:59:46,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49299719887955185 [2023-08-30 17:59:46,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2023-08-30 17:59:46,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2023-08-30 17:59:46,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:46,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2023-08-30 17:59:46,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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 17:59:46,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 17:59:46,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 476.0) internal successors, (1904), 4 states have internal predecessors, (1904), 0 states have call successors, (0), 0 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 17:59:46,668 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 168 flow. Second operand 3 states and 704 transitions. [2023-08-30 17:59:46,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 350 flow [2023-08-30 17:59:46,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 87 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 17:59:46,673 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 176 flow [2023-08-30 17:59:46,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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 17:59:46,675 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-30 17:59:46,675 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 176 flow [2023-08-30 17:59:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 17:59:46,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:46,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:46,684 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 17:59:46,881 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 17:59:46,882 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 17:59:46,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1146753669, now seen corresponding path program 1 times [2023-08-30 17:59:46,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:46,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228465677] [2023-08-30 17:59:46,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:46,917 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 17:59:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:46,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228465677] [2023-08-30 17:59:46,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228465677] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:46,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248739515] [2023-08-30 17:59:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:46,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:46,919 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 17:59:46,921 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 17:59:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:46,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 17:59:46,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:47,008 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 17:59:47,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:47,023 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 17:59:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248739515] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:47,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 17:59:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344424425] [2023-08-30 17:59:47,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:47,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 17:59:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:47,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 17:59:47,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 17:59:47,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-30 17:59:47,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 176 flow. Second operand has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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 17:59:47,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:47,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-30 17:59:47,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:48,099 INFO L130 PetriNetUnfolder]: 9912/15619 cut-off events. [2023-08-30 17:59:48,099 INFO L131 PetriNetUnfolder]: For 612/612 co-relation queries the response was YES. [2023-08-30 17:59:48,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30593 conditions, 15619 events. 9912/15619 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 101714 event pairs, 9112 based on Foata normal form. 3/13422 useless extension candidates. Maximal degree in co-relation 30565. Up to 14334 conditions per place. [2023-08-30 17:59:48,155 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 56 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-30 17:59:48,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 310 flow [2023-08-30 17:59:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:59:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:59:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1317 transitions. [2023-08-30 17:59:48,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46113445378151263 [2023-08-30 17:59:48,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1317 transitions. [2023-08-30 17:59:48,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1317 transitions. [2023-08-30 17:59:48,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:48,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1317 transitions. [2023-08-30 17:59:48,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.5) internal successors, (1317), 6 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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 17:59:48,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 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 17:59:48,178 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 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 17:59:48,178 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 176 flow. Second operand 6 states and 1317 transitions. [2023-08-30 17:59:48,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 310 flow [2023-08-30 17:59:48,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 74 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 17:59:48,181 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 210 flow [2023-08-30 17:59:48,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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 17:59:48,182 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 12 predicate places. [2023-08-30 17:59:48,183 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 210 flow [2023-08-30 17:59:48,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 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 17:59:48,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:48,184 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:48,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-30 17:59:48,396 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 17:59:48,396 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 17:59:48,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash -737928083, now seen corresponding path program 2 times [2023-08-30 17:59:48,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:48,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190319679] [2023-08-30 17:59:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:48,468 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 17:59:48,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190319679] [2023-08-30 17:59:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190319679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:48,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784685715] [2023-08-30 17:59:48,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 17:59:48,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:48,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:48,470 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 17:59:48,472 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 17:59:48,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 17:59:48,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 17:59:48,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 17:59:48,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:48,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-30 17:59:48,720 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:48,722 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 17:59:48,750 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 17:59:48,806 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 17:59:48,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 17:59:48,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784685715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:48,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 17:59:48,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 17:59:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45084670] [2023-08-30 17:59:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:48,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 17:59:48,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:48,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 17:59:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-30 17:59:48,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 476 [2023-08-30 17:59:48,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 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 17:59:48,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:48,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 476 [2023-08-30 17:59:48,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:50,193 INFO L130 PetriNetUnfolder]: 9983/16224 cut-off events. [2023-08-30 17:59:50,193 INFO L131 PetriNetUnfolder]: For 588/588 co-relation queries the response was YES. [2023-08-30 17:59:50,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31924 conditions, 16224 events. 9983/16224 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 113021 event pairs, 2197 based on Foata normal form. 0/14287 useless extension candidates. Maximal degree in co-relation 31888. Up to 11885 conditions per place. [2023-08-30 17:59:50,240 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 122 selfloop transitions, 14 changer transitions 14/163 dead transitions. [2023-08-30 17:59:50,240 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 163 transitions, 719 flow [2023-08-30 17:59:50,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 17:59:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 17:59:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1357 transitions. [2023-08-30 17:59:50,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47514005602240894 [2023-08-30 17:59:50,243 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1357 transitions. [2023-08-30 17:59:50,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1357 transitions. [2023-08-30 17:59:50,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:50,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1357 transitions. [2023-08-30 17:59:50,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.16666666666666) internal successors, (1357), 6 states have internal predecessors, (1357), 0 states have call successors, (0), 0 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 17:59:50,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 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 17:59:50,250 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 476.0) internal successors, (3332), 7 states have internal predecessors, (3332), 0 states have call successors, (0), 0 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 17:59:50,250 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 210 flow. Second operand 6 states and 1357 transitions. [2023-08-30 17:59:50,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 163 transitions, 719 flow [2023-08-30 17:59:50,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 163 transitions, 705 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 17:59:50,253 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 293 flow [2023-08-30 17:59:50,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, 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=293, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-30 17:59:50,254 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 20 predicate places. [2023-08-30 17:59:50,254 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 293 flow [2023-08-30 17:59:50,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 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 17:59:50,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:50,254 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 17:59:50,261 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 17:59:50,459 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 17:59:50,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:59:50,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:50,460 INFO L85 PathProgramCache]: Analyzing trace with hash -261072776, now seen corresponding path program 1 times [2023-08-30 17:59:50,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:50,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273290151] [2023-08-30 17:59:50,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:50,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:50,536 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 17:59:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273290151] [2023-08-30 17:59:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273290151] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339103400] [2023-08-30 17:59:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:50,538 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 17:59:50,542 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 17:59:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:50,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 17:59:50,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:50,657 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 17:59:50,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:50,711 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 17:59:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339103400] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 17:59:50,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 17:59:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 17:59:50,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994201193] [2023-08-30 17:59:50,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 17:59:50,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 17:59:50,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:50,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 17:59:50,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 17:59:50,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 476 [2023-08-30 17:59:50,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 293 flow. Second operand has 14 states, 14 states have (on average 208.35714285714286) internal successors, (2917), 14 states have internal predecessors, (2917), 0 states have call successors, (0), 0 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 17:59:50,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:50,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 476 [2023-08-30 17:59:50,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:52,022 INFO L130 PetriNetUnfolder]: 9753/15908 cut-off events. [2023-08-30 17:59:52,022 INFO L131 PetriNetUnfolder]: For 4955/4955 co-relation queries the response was YES. [2023-08-30 17:59:52,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35637 conditions, 15908 events. 9753/15908 cut-off events. For 4955/4955 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 112984 event pairs, 162 based on Foata normal form. 22/15015 useless extension candidates. Maximal degree in co-relation 35578. Up to 14254 conditions per place. [2023-08-30 17:59:52,082 INFO L137 encePairwiseOnDemand]: 471/476 looper letters, 114 selfloop transitions, 14 changer transitions 0/141 dead transitions. [2023-08-30 17:59:52,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 141 transitions, 721 flow [2023-08-30 17:59:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 17:59:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 17:59:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3003 transitions. [2023-08-30 17:59:52,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45063025210084034 [2023-08-30 17:59:52,089 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3003 transitions. [2023-08-30 17:59:52,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3003 transitions. [2023-08-30 17:59:52,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:52,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3003 transitions. [2023-08-30 17:59:52,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 214.5) internal successors, (3003), 14 states have internal predecessors, (3003), 0 states have call successors, (0), 0 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 17:59:52,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 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 17:59:52,103 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 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 17:59:52,103 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 293 flow. Second operand 14 states and 3003 transitions. [2023-08-30 17:59:52,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 141 transitions, 721 flow [2023-08-30 17:59:52,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 141 transitions, 721 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 17:59:52,118 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 363 flow [2023-08-30 17:59:52,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=363, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2023-08-30 17:59:52,119 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 34 predicate places. [2023-08-30 17:59:52,119 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 363 flow [2023-08-30 17:59:52,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 208.35714285714286) internal successors, (2917), 14 states have internal predecessors, (2917), 0 states have call successors, (0), 0 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 17:59:52,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:52,120 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 17:59:52,131 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 17:59:52,331 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 17:59:52,332 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 17:59:52,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1144227296, now seen corresponding path program 1 times [2023-08-30 17:59:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820844524] [2023-08-30 17:59:52,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:52,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:52,526 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 17:59:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:52,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820844524] [2023-08-30 17:59:52,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820844524] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 17:59:52,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 17:59:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 17:59:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894460726] [2023-08-30 17:59:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 17:59:52,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 17:59:52,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 17:59:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 17:59:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 17:59:52,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 476 [2023-08-30 17:59:52,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 0 states have call successors, (0), 0 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 17:59:52,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 17:59:52,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 476 [2023-08-30 17:59:52,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 17:59:53,255 INFO L130 PetriNetUnfolder]: 5583/10230 cut-off events. [2023-08-30 17:59:53,255 INFO L131 PetriNetUnfolder]: For 3774/3774 co-relation queries the response was YES. [2023-08-30 17:59:53,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23770 conditions, 10230 events. 5583/10230 cut-off events. For 3774/3774 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 75558 event pairs, 2154 based on Foata normal form. 1470/10804 useless extension candidates. Maximal degree in co-relation 23697. Up to 5369 conditions per place. [2023-08-30 17:59:53,290 INFO L137 encePairwiseOnDemand]: 455/476 looper letters, 116 selfloop transitions, 21 changer transitions 2/149 dead transitions. [2023-08-30 17:59:53,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 149 transitions, 840 flow [2023-08-30 17:59:53,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 17:59:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 17:59:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 874 transitions. [2023-08-30 17:59:53,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45903361344537813 [2023-08-30 17:59:53,293 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 874 transitions. [2023-08-30 17:59:53,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 874 transitions. [2023-08-30 17:59:53,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 17:59:53,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 874 transitions. [2023-08-30 17:59:53,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 218.5) internal successors, (874), 4 states have internal predecessors, (874), 0 states have call successors, (0), 0 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 17:59:53,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 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 17:59:53,298 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 476.0) internal successors, (2380), 5 states have internal predecessors, (2380), 0 states have call successors, (0), 0 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 17:59:53,298 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 363 flow. Second operand 4 states and 874 transitions. [2023-08-30 17:59:53,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 149 transitions, 840 flow [2023-08-30 17:59:53,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 149 transitions, 767 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-08-30 17:59:53,310 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 399 flow [2023-08-30 17:59:53,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2023-08-30 17:59:53,311 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 28 predicate places. [2023-08-30 17:59:53,311 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 399 flow [2023-08-30 17:59:53,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 0 states have call successors, (0), 0 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 17:59:53,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 17:59:53,312 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 17:59:53,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 17:59:53,312 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-30 17:59:53,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 17:59:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash 239282032, now seen corresponding path program 1 times [2023-08-30 17:59:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 17:59:53,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68488743] [2023-08-30 17:59:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 17:59:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:54,078 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 17:59:54,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 17:59:54,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68488743] [2023-08-30 17:59:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68488743] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 17:59:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658973647] [2023-08-30 17:59:54,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 17:59:54,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 17:59:54,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 17:59:54,081 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 17:59:54,102 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 17:59:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 17:59:54,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 17:59:54,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 17:59:54,217 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 17:59:54,315 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:54,315 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 17:59:54,336 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 17:59:54,376 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 17:59:54,402 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 16 treesize of output 12 [2023-08-30 17:59:54,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 17:59:54,445 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 19 treesize of output 21 [2023-08-30 17:59:54,471 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 22 treesize of output 17 [2023-08-30 17:59:54,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 17:59:54,531 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 19 treesize of output 21 [2023-08-30 17:59:54,644 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 17:59:54,645 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 25 treesize of output 11 [2023-08-30 17:59:54,708 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 17:59:54,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 17:59:54,785 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_55| Int) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_55| 28))) (or (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_55|) (< |v_t_funThread2of2ForFork0_~i~0#1_55| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_464) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0))))) is different from false [2023-08-30 17:59:54,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 17:59:54,920 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 29 treesize of output 30 [2023-08-30 17:59:54,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 17:59:54,933 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 48 treesize of output 38 [2023-08-30 17:59:54,941 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 25 treesize of output 18 [2023-08-30 18:00:07,423 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:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658973647] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:07,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-30 18:00:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695505875] [2023-08-30 18:00:07,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:07,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 18:00:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:07,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 18:00:07,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=4, NotChecked=36, Total=420 [2023-08-30 18:00:07,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:00:07,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 399 flow. Second operand has 21 states, 21 states have (on average 149.42857142857142) internal successors, (3138), 21 states have internal predecessors, (3138), 0 states have call successors, (0), 0 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:07,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:07,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:00:07,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00:11,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:00:13,023 INFO L130 PetriNetUnfolder]: 9235/16865 cut-off events. [2023-08-30 18:00:13,023 INFO L131 PetriNetUnfolder]: For 9003/9054 co-relation queries the response was YES. [2023-08-30 18:00:13,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46141 conditions, 16865 events. 9235/16865 cut-off events. For 9003/9054 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 135354 event pairs, 882 based on Foata normal form. 66/15526 useless extension candidates. Maximal degree in co-relation 44864. Up to 7556 conditions per place. [2023-08-30 18:00:13,082 INFO L137 encePairwiseOnDemand]: 452/476 looper letters, 349 selfloop transitions, 113 changer transitions 143/614 dead transitions. [2023-08-30 18:00:13,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 614 transitions, 3510 flow [2023-08-30 18:00:13,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-30 18:00:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-30 18:00:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3618 transitions. [2023-08-30 18:00:13,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619447779111645 [2023-08-30 18:00:13,092 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3618 transitions. [2023-08-30 18:00:13,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3618 transitions. [2023-08-30 18:00:13,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:13,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3618 transitions. [2023-08-30 18:00:13,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 172.28571428571428) internal successors, (3618), 21 states have internal predecessors, (3618), 0 states have call successors, (0), 0 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:13,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 476.0) internal successors, (10472), 22 states have internal predecessors, (10472), 0 states have call successors, (0), 0 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:13,114 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 476.0) internal successors, (10472), 22 states have internal predecessors, (10472), 0 states have call successors, (0), 0 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:13,114 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 399 flow. Second operand 21 states and 3618 transitions. [2023-08-30 18:00:13,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 614 transitions, 3510 flow [2023-08-30 18:00:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 614 transitions, 3509 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 18:00:13,137 INFO L231 Difference]: Finished difference. Result has 125 places, 211 transitions, 1280 flow [2023-08-30 18:00:13,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1280, PETRI_PLACES=125, PETRI_TRANSITIONS=211} [2023-08-30 18:00:13,138 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 57 predicate places. [2023-08-30 18:00:13,138 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 211 transitions, 1280 flow [2023-08-30 18:00:13,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.42857142857142) internal successors, (3138), 21 states have internal predecessors, (3138), 0 states have call successors, (0), 0 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:13,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:13,140 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:00:13,149 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:00:13,345 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,SelfDestructingSolverStorable15 [2023-08-30 18:00:13,345 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:00:13,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1186553578, now seen corresponding path program 2 times [2023-08-30 18:00:13,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:13,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800169832] [2023-08-30 18:00:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:13,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:14,078 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:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800169832] [2023-08-30 18:00:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800169832] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119722635] [2023-08-30 18:00:14,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:00:14,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:14,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:14,081 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:00:14,082 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:00:14,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:00:14,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:00:14,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 18:00:14,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:14,206 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:14,317 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:14,318 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:14,345 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:14,380 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:14,427 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 16 treesize of output 12 [2023-08-30 18:00:14,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:00:14,496 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 19 treesize of output 21 [2023-08-30 18:00:14,545 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:14,546 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 25 treesize of output 11 [2023-08-30 18:00:14,593 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 22 treesize of output 17 [2023-08-30 18:00:14,667 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:14,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:14,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:14,813 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 29 treesize of output 30 [2023-08-30 18:00:14,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:00:14,827 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 48 treesize of output 38 [2023-08-30 18:00:14,834 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 25 treesize of output 18 [2023-08-30 18:00:29,235 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_545 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_67| Int)) (or (forall ((v_ArrVal_550 Int) (|v_t_funThread2of2ForFork0_~i~0#1_57| Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_57| |v_t_funThread1of2ForFork0_~i~0#1_67|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_545) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_67| 28) |~#a~0.offset|) v_ArrVal_550) (+ |~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_57| 28))) 0))) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_67|) (< |v_t_funThread1of2ForFork0_~i~0#1_67| 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) is different from false [2023-08-30 18:00:34,219 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:00:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119722635] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:00:34,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:00:34,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-30 18:00:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260632957] [2023-08-30 18:00:34,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:00:34,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:00:34,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:00:34,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:00:34,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=361, Unknown=5, NotChecked=40, Total=506 [2023-08-30 18:00:34,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:00:34,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 211 transitions, 1280 flow. Second operand has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 0 states have call successors, (0), 0 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:34,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:00:34,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:00:34,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:00: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 [1] [2023-08-30 18:00:50,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:00:52,423 INFO L130 PetriNetUnfolder]: 13039/24377 cut-off events. [2023-08-30 18:00:52,424 INFO L131 PetriNetUnfolder]: For 40566/40618 co-relation queries the response was YES. [2023-08-30 18:00:52,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80613 conditions, 24377 events. 13039/24377 cut-off events. For 40566/40618 co-relation queries the response was YES. Maximal size of possible extension queue 991. Compared 214341 event pairs, 2091 based on Foata normal form. 109/22326 useless extension candidates. Maximal degree in co-relation 78784. Up to 8799 conditions per place. [2023-08-30 18:00:52,549 INFO L137 encePairwiseOnDemand]: 452/476 looper letters, 456 selfloop transitions, 149 changer transitions 191/805 dead transitions. [2023-08-30 18:00:52,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 805 transitions, 5953 flow [2023-08-30 18:00:52,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-30 18:00:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-30 18:00:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3795 transitions. [2023-08-30 18:00:52,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36239495798319327 [2023-08-30 18:00:52,555 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3795 transitions. [2023-08-30 18:00:52,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3795 transitions. [2023-08-30 18:00:52,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:00:52,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3795 transitions. [2023-08-30 18:00:52,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 172.5) internal successors, (3795), 22 states have internal predecessors, (3795), 0 states have call successors, (0), 0 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,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 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,571 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 476.0) internal successors, (10948), 23 states have internal predecessors, (10948), 0 states have call successors, (0), 0 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,571 INFO L175 Difference]: Start difference. First operand has 125 places, 211 transitions, 1280 flow. Second operand 22 states and 3795 transitions. [2023-08-30 18:00:52,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 805 transitions, 5953 flow [2023-08-30 18:00:52,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 805 transitions, 5949 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-30 18:00:52,831 INFO L231 Difference]: Finished difference. Result has 159 places, 295 transitions, 2481 flow [2023-08-30 18:00:52,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2481, PETRI_PLACES=159, PETRI_TRANSITIONS=295} [2023-08-30 18:00:52,832 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 91 predicate places. [2023-08-30 18:00:52,832 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 295 transitions, 2481 flow [2023-08-30 18:00:52,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.30434782608697) internal successors, (3434), 23 states have internal predecessors, (3434), 0 states have call successors, (0), 0 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,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:00:52,833 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:00:52,838 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:00:53,035 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,SelfDestructingSolverStorable16 [2023-08-30 18:00:53,035 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:00:53,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:00:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1783488006, now seen corresponding path program 1 times [2023-08-30 18:00:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:00:53,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443862813] [2023-08-30 18:00:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:00:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:53,713 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:53,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:00:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443862813] [2023-08-30 18:00:53,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443862813] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:00:53,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256687429] [2023-08-30 18:00:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:00:53,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:00:53,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:00:53,716 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:00:53,721 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:00:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:00:53,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 18:00:53,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:00:53,849 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:53,926 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:53,927 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:53,950 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:53,977 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:54,003 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 16 treesize of output 12 [2023-08-30 18:00:54,049 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:00:54,049 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 25 treesize of output 11 [2023-08-30 18:00:54,125 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 22 treesize of output 17 [2023-08-30 18:00:54,183 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:54,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:00:54,275 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 21 treesize of output 19 [2023-08-30 18:00:54,280 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 15 treesize of output 8 [2023-08-30 18:01:08,528 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_69| Int) (|~#a~0.offset| Int) (v_ArrVal_635 Int) (|v_t_funThread2of2ForFork0_~i~0#1_59| Int) (v_ArrVal_631 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_59| 0) (= |v_t_funThread2of2ForFork0_~i~0#1_59| |v_t_funThread1of2ForFork0_~i~0#1_69|) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_59|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_631) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_59| 28) |~#a~0.offset|) v_ArrVal_635) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_69| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-30 18:01:08,874 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:01:08,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256687429] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:08,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:08,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2023-08-30 18:01:08,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429509703] [2023-08-30 18:01:08,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:08,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-30 18:01:08,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:08,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-30 18:01:08,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=250, Unknown=5, NotChecked=34, Total=380 [2023-08-30 18:01:08,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 476 [2023-08-30 18:01:08,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 295 transitions, 2481 flow. Second operand has 20 states, 20 states have (on average 147.55) internal successors, (2951), 20 states have internal predecessors, (2951), 0 states have call successors, (0), 0 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:08,890 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:08,890 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 476 [2023-08-30 18:01:08,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:16,505 INFO L130 PetriNetUnfolder]: 15399/28976 cut-off events. [2023-08-30 18:01:16,506 INFO L131 PetriNetUnfolder]: For 88177/88226 co-relation queries the response was YES. [2023-08-30 18:01:16,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108019 conditions, 28976 events. 15399/28976 cut-off events. For 88177/88226 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 262895 event pairs, 3881 based on Foata normal form. 53/26506 useless extension candidates. Maximal degree in co-relation 105227. Up to 15884 conditions per place. [2023-08-30 18:01:16,914 INFO L137 encePairwiseOnDemand]: 455/476 looper letters, 424 selfloop transitions, 99 changer transitions 154/686 dead transitions. [2023-08-30 18:01:16,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 686 transitions, 6093 flow [2023-08-30 18:01:16,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 18:01:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 18:01:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3020 transitions. [2023-08-30 18:01:16,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3524743230625584 [2023-08-30 18:01:16,919 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3020 transitions. [2023-08-30 18:01:16,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3020 transitions. [2023-08-30 18:01:16,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:01:16,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3020 transitions. [2023-08-30 18:01:16,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 167.77777777777777) internal successors, (3020), 18 states have internal predecessors, (3020), 0 states have call successors, (0), 0 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:16,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 0 states have call successors, (0), 0 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:16,932 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 0 states have call successors, (0), 0 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:16,933 INFO L175 Difference]: Start difference. First operand has 159 places, 295 transitions, 2481 flow. Second operand 18 states and 3020 transitions. [2023-08-30 18:01:16,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 686 transitions, 6093 flow [2023-08-30 18:01:18,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 686 transitions, 6085 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-30 18:01:18,090 INFO L231 Difference]: Finished difference. Result has 188 places, 334 transitions, 3206 flow [2023-08-30 18:01:18,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=2473, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3206, PETRI_PLACES=188, PETRI_TRANSITIONS=334} [2023-08-30 18:01:18,091 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 120 predicate places. [2023-08-30 18:01:18,091 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 334 transitions, 3206 flow [2023-08-30 18:01:18,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 147.55) internal successors, (2951), 20 states have internal predecessors, (2951), 0 states have call successors, (0), 0 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:18,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:01:18,092 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:18,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-30 18:01:18,299 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:01:18,299 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:01:18,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:01:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2039347774, now seen corresponding path program 2 times [2023-08-30 18:01:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:01:18,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747287809] [2023-08-30 18:01:18,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:01:18,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:01:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:01:19,247 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:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:01:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747287809] [2023-08-30 18:01:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747287809] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:01:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044791814] [2023-08-30 18:01:19,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:01:19,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:01:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:01:19,249 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:01:19,252 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:01:19,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:01:19,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:01:19,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-30 18:01:19,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:01:19,468 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:19,607 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:19,608 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:19,638 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:19,676 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:19,723 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 16 treesize of output 12 [2023-08-30 18:01:19,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:01:19,791 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 19 treesize of output 21 [2023-08-30 18:01:19,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:01:19,846 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 25 treesize of output 11 [2023-08-30 18:01:19,896 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 22 treesize of output 17 [2023-08-30 18:01:19,989 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:19,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:01:20,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:20,174 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 29 treesize of output 30 [2023-08-30 18:01:20,186 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:01:20,187 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 48 treesize of output 38 [2023-08-30 18:01:20,195 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 25 treesize of output 18 [2023-08-30 18:01:42,649 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_61| Int) (v_ArrVal_716 (Array Int Int))) (or (forall ((v_ArrVal_720 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_71| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_716) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_61| 28) |~#a~0.offset|) v_ArrVal_720) (+ |~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_71| 28))) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_61| |v_t_funThread1of2ForFork0_~i~0#1_71|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_61|) (< |v_t_funThread2of2ForFork0_~i~0#1_61| 0)))) is different from false [2023-08-30 18:01:46,704 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:01:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044791814] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:01:46,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:01:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2023-08-30 18:01:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241834930] [2023-08-30 18:01:46,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:01:46,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 18:01:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:01:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 18:01:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=400, Unknown=5, NotChecked=42, Total=552 [2023-08-30 18:01:46,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 476 [2023-08-30 18:01:46,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 334 transitions, 3206 flow. Second operand has 24 states, 24 states have (on average 147.20833333333334) internal successors, (3533), 24 states have internal predecessors, (3533), 0 states have call successors, (0), 0 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,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:01:46,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 476 [2023-08-30 18:01:46,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:01:55,236 WARN L539 Checker$ProtectedHtc]: 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:57,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:02:03,219 INFO L130 PetriNetUnfolder]: 18311/34733 cut-off events. [2023-08-30 18:02:03,219 INFO L131 PetriNetUnfolder]: For 139797/139893 co-relation queries the response was YES. [2023-08-30 18:02:03,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138902 conditions, 34733 events. 18311/34733 cut-off events. For 139797/139893 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 327130 event pairs, 3862 based on Foata normal form. 116/31889 useless extension candidates. Maximal degree in co-relation 135873. Up to 17486 conditions per place. [2023-08-30 18:02:03,530 INFO L137 encePairwiseOnDemand]: 449/476 looper letters, 505 selfloop transitions, 159 changer transitions 192/865 dead transitions. [2023-08-30 18:02:03,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 865 transitions, 8403 flow [2023-08-30 18:02:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-30 18:02:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-30 18:02:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4319 transitions. [2023-08-30 18:02:03,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34898190045248867 [2023-08-30 18:02:03,535 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 4319 transitions. [2023-08-30 18:02:03,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 4319 transitions. [2023-08-30 18:02:03,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:02:03,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4319 transitions. [2023-08-30 18:02:03,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 166.1153846153846) internal successors, (4319), 26 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:02:03,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 476.0) internal successors, (12852), 27 states have internal predecessors, (12852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:02:03,550 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 476.0) internal successors, (12852), 27 states have internal predecessors, (12852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:02:03,550 INFO L175 Difference]: Start difference. First operand has 188 places, 334 transitions, 3206 flow. Second operand 26 states and 4319 transitions. [2023-08-30 18:02:03,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 865 transitions, 8403 flow [2023-08-30 18:02:05,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 865 transitions, 8194 flow, removed 78 selfloop flow, removed 5 redundant places. [2023-08-30 18:02:05,165 INFO L231 Difference]: Finished difference. Result has 215 places, 403 transitions, 4324 flow [2023-08-30 18:02:05,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3110, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=4324, PETRI_PLACES=215, PETRI_TRANSITIONS=403} [2023-08-30 18:02:05,166 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 147 predicate places. [2023-08-30 18:02:05,166 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 403 transitions, 4324 flow [2023-08-30 18:02:05,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 147.20833333333334) internal successors, (3533), 24 states have internal predecessors, (3533), 0 states have call successors, (0), 0 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:05,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:02:05,167 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:05,172 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:05,367 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:05,368 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:05,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:02:05,368 INFO L85 PathProgramCache]: Analyzing trace with hash -567793192, now seen corresponding path program 3 times [2023-08-30 18:02:05,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:02:05,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533696871] [2023-08-30 18:02:05,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:02:05,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:02:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:02:08,851 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:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:02:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533696871] [2023-08-30 18:02:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533696871] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:02:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782689298] [2023-08-30 18:02:08,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:02:08,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:02:08,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:02:08,865 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:08,868 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:08,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-30 18:02:08,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:02:08,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 18:02:08,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:02:08,993 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:09,061 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:09,061 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:09,094 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:09,113 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:09,156 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 16 treesize of output 12 [2023-08-30 18:02:09,208 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:09,209 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 25 treesize of output 11 [2023-08-30 18:02:09,287 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 22 treesize of output 17 [2023-08-30 18:02:09,354 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:09,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:02:09,492 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 21 treesize of output 19 [2023-08-30 18:02:09,496 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 15 treesize of output 8 [2023-08-30 18:02:29,799 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_802 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_63| Int) (v_ArrVal_805 Int) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_73| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_802) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|) v_ArrVal_805) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_63| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_63| 0) (= |v_t_funThread2of2ForFork0_~i~0#1_63| |v_t_funThread1of2ForFork0_~i~0#1_73|) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_63|))) is different from false [2023-08-30 18:02:30,248 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:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782689298] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:02:30,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:02:30,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 29 [2023-08-30 18:02:30,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784820035] [2023-08-30 18:02:30,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:02:30,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-30 18:02:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:02:30,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-30 18:02:30,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=693, Unknown=5, NotChecked=56, Total=930 [2023-08-30 18:02:30,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-08-30 18:02:30,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 403 transitions, 4324 flow. Second operand has 31 states, 31 states have (on average 144.03225806451613) internal successors, (4465), 31 states have internal predecessors, (4465), 0 states have call successors, (0), 0 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:30,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:02:30,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-08-30 18:02:30,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:02:39,287 INFO L130 PetriNetUnfolder]: 18809/35930 cut-off events. [2023-08-30 18:02:39,287 INFO L131 PetriNetUnfolder]: For 208666/208891 co-relation queries the response was YES. [2023-08-30 18:02:39,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160112 conditions, 35930 events. 18809/35930 cut-off events. For 208666/208891 co-relation queries the response was YES. Maximal size of possible extension queue 1468. Compared 342528 event pairs, 3982 based on Foata normal form. 63/32924 useless extension candidates. Maximal degree in co-relation 157769. Up to 20556 conditions per place. [2023-08-30 18:02:39,846 INFO L137 encePairwiseOnDemand]: 458/476 looper letters, 485 selfloop transitions, 162 changer transitions 166/822 dead transitions. [2023-08-30 18:02:39,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 822 transitions, 9098 flow [2023-08-30 18:02:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-30 18:02:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-30 18:02:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4439 transitions. [2023-08-30 18:02:39,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3330582232893157 [2023-08-30 18:02:39,851 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4439 transitions. [2023-08-30 18:02:39,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4439 transitions. [2023-08-30 18:02:39,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:02:39,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4439 transitions. [2023-08-30 18:02:39,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 158.53571428571428) internal successors, (4439), 28 states have internal predecessors, (4439), 0 states have call successors, (0), 0 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:39,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 476.0) internal successors, (13804), 29 states have internal predecessors, (13804), 0 states have call successors, (0), 0 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:39,866 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 476.0) internal successors, (13804), 29 states have internal predecessors, (13804), 0 states have call successors, (0), 0 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:39,866 INFO L175 Difference]: Start difference. First operand has 215 places, 403 transitions, 4324 flow. Second operand 28 states and 4439 transitions. [2023-08-30 18:02:39,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 822 transitions, 9098 flow [2023-08-30 18:02:41,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 822 transitions, 8883 flow, removed 75 selfloop flow, removed 3 redundant places. [2023-08-30 18:02:41,735 INFO L231 Difference]: Finished difference. Result has 242 places, 430 transitions, 4955 flow [2023-08-30 18:02:41,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=4123, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4955, PETRI_PLACES=242, PETRI_TRANSITIONS=430} [2023-08-30 18:02:41,736 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 174 predicate places. [2023-08-30 18:02:41,736 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 430 transitions, 4955 flow [2023-08-30 18:02:41,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 144.03225806451613) internal successors, (4465), 31 states have internal predecessors, (4465), 0 states have call successors, (0), 0 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:41,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:02:41,737 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:41,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-30 18:02:41,943 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:41,943 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:41,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:02:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1012129974, now seen corresponding path program 4 times [2023-08-30 18:02:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:02:41,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874161366] [2023-08-30 18:02:41,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:02:41,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:02:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:02:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:02:46,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:02:46,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874161366] [2023-08-30 18:02:46,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874161366] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:02:46,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735516484] [2023-08-30 18:02:46,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:02:46,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:02:46,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:02:46,015 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:46,016 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:46,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:02:46,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:02:46,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 18:02:46,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:02:46,133 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:46,238 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:46,238 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:46,273 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:46,299 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 16 treesize of output 12 [2023-08-30 18:02:46,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:02:46,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 19 treesize of output 21 [2023-08-30 18:02:46,383 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 22 treesize of output 17 [2023-08-30 18:02:46,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:02:46,437 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 19 treesize of output 21 [2023-08-30 18:02:46,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 18:02:46,557 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:02:46,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 25 treesize of output 11 [2023-08-30 18:02:46,635 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:02:46,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:02:49,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:02:49,027 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 29 treesize of output 30 [2023-08-30 18:02:49,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:02:49,038 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 48 treesize of output 38 [2023-08-30 18:02:49,044 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 25 treesize of output 18 [2023-08-30 18:02:51,105 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_ArrVal_891 Int) (|v_t_funThread2of2ForFork0_~i~0#1_65| Int) (|~#a~0.offset| Int) (v_ArrVal_893 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28) |~#a~0.offset|) v_ArrVal_891)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28) |~#a~0.offset|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_65| Int)) (or (forall ((v_ArrVal_891 Int) (|~#a~0.offset| Int) (v_ArrVal_893 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_65| |v_t_funThread1of2ForFork0_~i~0#1_75|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28) |~#a~0.offset|) v_ArrVal_891)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28) |~#a~0.offset|)) 0))) (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|))))) is different from false [2023-08-30 18:02:53,251 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_886 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_65| Int)) (or (forall ((v_ArrVal_891 Int) (|~#a~0.offset| Int) (v_ArrVal_893 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_65| |v_t_funThread1of2ForFork0_~i~0#1_75|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_886))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28) |~#a~0.offset|) v_ArrVal_891))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28) |~#a~0.offset|)) 0))) (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|))) (or (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_891 Int) (|v_t_funThread2of2ForFork0_~i~0#1_65| Int) (|~#a~0.offset| Int) (v_ArrVal_893 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_75| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_886))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_75| 28) |~#a~0.offset|) v_ArrVal_891))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-30 18:03:01,511 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:03:02,214 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:03:02,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735516484] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:03:02,215 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:03:02,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 7, 8] total 34 [2023-08-30 18:03:02,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197713347] [2023-08-30 18:03:02,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:03:02,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-30 18:03:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:03:02,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-30 18:03:02,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=905, Unknown=6, NotChecked=130, Total=1260 [2023-08-30 18:03:02,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 476 [2023-08-30 18:03:02,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 430 transitions, 4955 flow. Second operand has 36 states, 36 states have (on average 136.75) internal successors, (4923), 36 states have internal predecessors, (4923), 0 states have call successors, (0), 0 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:03:02,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:03:02,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 476 [2023-08-30 18:03:02,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:03:48,973 WARN L222 SmtUtils]: Spent 46.28s on a formula simplification. DAG size of input: 72 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:03:50,982 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:03:52,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:03:55,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:03:57,015 WARN L539 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:59,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:01,074 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:04:03,213 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:04:05,221 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:04:07,225 WARN L539 Checker$ProtectedHtc]: 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:09,558 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:04:11,601 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:04:13,612 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:04:15,631 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:04:17,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:19,262 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:04:21,283 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:04:23,289 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:04:25,305 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:04:27,313 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:04:29,329 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:04:31,464 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:04:33,743 WARN L539 Checker$ProtectedHtc]: 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:35,753 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:04:37,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:39,777 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:04:41,825 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:04:43,845 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:04:46,269 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:04:48,285 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:04:50,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:04:52,336 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:04:54,678 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_891 Int) (|v_t_funThread2of2ForFork0_~i~0#1_65| Int) (v_ArrVal_892 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28))) (or (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_892) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)))) (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_891)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_65| Int) (v_ArrVal_893 (Array Int Int))) (let ((.cse1 (* |v_t_funThread2of2ForFork0_~i~0#1_65| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_65| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_65|) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset| 4)) 0)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_893) |c_~#a~0.base|) (+ .cse1 |c_~#a~0.offset|))))))) is different from false [2023-08-30 18:05:08,009 INFO L130 PetriNetUnfolder]: 19374/37291 cut-off events. [2023-08-30 18:05:08,010 INFO L131 PetriNetUnfolder]: For 262240/262468 co-relation queries the response was YES. [2023-08-30 18:05:08,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174084 conditions, 37291 events. 19374/37291 cut-off events. For 262240/262468 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 361201 event pairs, 4089 based on Foata normal form. 55/34141 useless extension candidates. Maximal degree in co-relation 171423. Up to 20259 conditions per place. [2023-08-30 18:05:08,984 INFO L137 encePairwiseOnDemand]: 442/476 looper letters, 487 selfloop transitions, 248 changer transitions 259/1003 dead transitions. [2023-08-30 18:05:08,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1003 transitions, 11735 flow [2023-08-30 18:05:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-30 18:05:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-30 18:05:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5965 transitions. [2023-08-30 18:05:08,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3132878151260504 [2023-08-30 18:05:08,992 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 5965 transitions. [2023-08-30 18:05:08,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 5965 transitions. [2023-08-30 18:05:08,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:08,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 5965 transitions. [2023-08-30 18:05:09,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 149.125) internal successors, (5965), 40 states have internal predecessors, (5965), 0 states have call successors, (0), 0 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,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 476.0) internal successors, (19516), 41 states have internal predecessors, (19516), 0 states have call successors, (0), 0 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,019 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 476.0) internal successors, (19516), 41 states have internal predecessors, (19516), 0 states have call successors, (0), 0 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,019 INFO L175 Difference]: Start difference. First operand has 242 places, 430 transitions, 4955 flow. Second operand 40 states and 5965 transitions. [2023-08-30 18:05:09,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 1003 transitions, 11735 flow [2023-08-30 18:05:11,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1003 transitions, 11594 flow, removed 7 selfloop flow, removed 16 redundant places. [2023-08-30 18:05:11,914 INFO L231 Difference]: Finished difference. Result has 276 places, 499 transitions, 6420 flow [2023-08-30 18:05:11,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=4827, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=6420, PETRI_PLACES=276, PETRI_TRANSITIONS=499} [2023-08-30 18:05:11,915 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 208 predicate places. [2023-08-30 18:05:11,915 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 499 transitions, 6420 flow [2023-08-30 18:05:11,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 136.75) internal successors, (4923), 36 states have internal predecessors, (4923), 0 states have call successors, (0), 0 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:11,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:11,917 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:05:11,926 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:05:12,122 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:05:12,123 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:05:12,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash -2146447490, now seen corresponding path program 1 times [2023-08-30 18:05:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:12,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725888363] [2023-08-30 18:05:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:12,277 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:05:12,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725888363] [2023-08-30 18:05:12,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725888363] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:12,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60033665] [2023-08-30 18:05:12,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:12,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:12,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:12,280 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:05:12,283 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:05:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:12,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-30 18:05:12,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:12,487 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:05:12,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:12,543 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:05:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60033665] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:12,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-30 18:05:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180449026] [2023-08-30 18:05:12,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:12,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 18:05:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:12,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 18:05:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-30 18:05:12,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 476 [2023-08-30 18:05:12,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 499 transitions, 6420 flow. Second operand has 9 states, 9 states have (on average 212.77777777777777) internal successors, (1915), 9 states have internal predecessors, (1915), 0 states have call successors, (0), 0 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:12,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:12,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 476 [2023-08-30 18:05:12,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:14,021 INFO L130 PetriNetUnfolder]: 2598/5501 cut-off events. [2023-08-30 18:05:14,021 INFO L131 PetriNetUnfolder]: For 49305/49373 co-relation queries the response was YES. [2023-08-30 18:05:14,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30649 conditions, 5501 events. 2598/5501 cut-off events. For 49305/49373 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 45444 event pairs, 364 based on Foata normal form. 796/5955 useless extension candidates. Maximal degree in co-relation 30246. Up to 3721 conditions per place. [2023-08-30 18:05:14,080 INFO L137 encePairwiseOnDemand]: 473/476 looper letters, 264 selfloop transitions, 9 changer transitions 284/567 dead transitions. [2023-08-30 18:05:14,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 567 transitions, 8084 flow [2023-08-30 18:05:14,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 18:05:14,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 18:05:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1128 transitions. [2023-08-30 18:05:14,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47394957983193275 [2023-08-30 18:05:14,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1128 transitions. [2023-08-30 18:05:14,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1128 transitions. [2023-08-30 18:05:14,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:14,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1128 transitions. [2023-08-30 18:05:14,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 225.6) internal successors, (1128), 5 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:14,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 476.0) internal successors, (2856), 6 states have internal predecessors, (2856), 0 states have call successors, (0), 0 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:14,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 476.0) internal successors, (2856), 6 states have internal predecessors, (2856), 0 states have call successors, (0), 0 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:14,087 INFO L175 Difference]: Start difference. First operand has 276 places, 499 transitions, 6420 flow. Second operand 5 states and 1128 transitions. [2023-08-30 18:05:14,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 567 transitions, 8084 flow [2023-08-30 18:05:14,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 567 transitions, 7426 flow, removed 144 selfloop flow, removed 40 redundant places. [2023-08-30 18:05:14,478 INFO L231 Difference]: Finished difference. Result has 202 places, 179 transitions, 1828 flow [2023-08-30 18:05:14,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=3572, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1828, PETRI_PLACES=202, PETRI_TRANSITIONS=179} [2023-08-30 18:05:14,479 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 134 predicate places. [2023-08-30 18:05:14,480 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 179 transitions, 1828 flow [2023-08-30 18:05:14,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 212.77777777777777) internal successors, (1915), 9 states have internal predecessors, (1915), 0 states have call successors, (0), 0 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:14,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:14,480 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:14,489 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:05:14,686 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:05:14,687 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:05:14,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:14,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1195206668, now seen corresponding path program 3 times [2023-08-30 18:05:14,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:14,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814700831] [2023-08-30 18:05:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:14,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:15,364 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:05:15,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814700831] [2023-08-30 18:05:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814700831] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:15,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804819677] [2023-08-30 18:05:15,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:05:15,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:15,366 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:05:15,369 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:05:15,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 18:05:15,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:15,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 18:05:15,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:15,528 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:15,606 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:15,607 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:15,629 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:15,648 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 16 treesize of output 12 [2023-08-30 18:05:15,706 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:15,747 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:15,748 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 25 treesize of output 11 [2023-08-30 18:05:15,871 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 22 treesize of output 17 [2023-08-30 18:05:15,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 18:05:15,988 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:05:15,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:16,015 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1061) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-08-30 18:05:16,267 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 21 treesize of output 19 [2023-08-30 18:05:16,275 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 15 treesize of output 8 [2023-08-30 18:05:18,294 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_79| Int) (|v_t_funThread2of2ForFork0_~i~0#1_68| Int) (v_ArrVal_1059 Int) (|~#a~0.offset| Int) (v_ArrVal_1061 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_68| |v_t_funThread1of2ForFork0_~i~0#1_79|) (< |v_t_funThread2of2ForFork0_~i~0#1_68| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_68| 28) |~#a~0.offset|) v_ArrVal_1059)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1061) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_68|))) is different from false [2023-08-30 18:05:20,330 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_79| Int) (|v_t_funThread2of2ForFork0_~i~0#1_68| Int) (v_ArrVal_1059 Int) (|~#a~0.offset| Int) (v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_68| |v_t_funThread1of2ForFork0_~i~0#1_79|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1055))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_68| 28) |~#a~0.offset|) v_ArrVal_1059))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1061) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_79| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_68| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_68|))) is different from false [2023-08-30 18:05:20,627 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:05:20,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804819677] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:20,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:20,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2023-08-30 18:05:20,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401582650] [2023-08-30 18:05:20,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:20,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 18:05:20,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 18:05:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=236, Unknown=4, NotChecked=102, Total=420 [2023-08-30 18:05:20,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:05:20,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 179 transitions, 1828 flow. Second operand has 21 states, 21 states have (on average 149.85714285714286) internal successors, (3147), 21 states have internal predecessors, (3147), 0 states have call successors, (0), 0 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:20,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:20,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:05:20,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:22,009 INFO L130 PetriNetUnfolder]: 1369/2920 cut-off events. [2023-08-30 18:05:22,009 INFO L131 PetriNetUnfolder]: For 17402/17422 co-relation queries the response was YES. [2023-08-30 18:05:22,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13874 conditions, 2920 events. 1369/2920 cut-off events. For 17402/17422 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22015 event pairs, 304 based on Foata normal form. 6/2625 useless extension candidates. Maximal degree in co-relation 13718. Up to 1982 conditions per place. [2023-08-30 18:05:22,038 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 164 selfloop transitions, 14 changer transitions 42/226 dead transitions. [2023-08-30 18:05:22,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 226 transitions, 2578 flow [2023-08-30 18:05:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:05:22,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:05:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1418 transitions. [2023-08-30 18:05:22,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33099906629318393 [2023-08-30 18:05:22,055 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1418 transitions. [2023-08-30 18:05:22,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1418 transitions. [2023-08-30 18:05:22,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:22,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1418 transitions. [2023-08-30 18:05:22,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.55555555555554) internal successors, (1418), 9 states have internal predecessors, (1418), 0 states have call successors, (0), 0 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:22,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 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:22,080 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 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:22,080 INFO L175 Difference]: Start difference. First operand has 202 places, 179 transitions, 1828 flow. Second operand 9 states and 1418 transitions. [2023-08-30 18:05:22,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 226 transitions, 2578 flow [2023-08-30 18:05:22,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 226 transitions, 2180 flow, removed 49 selfloop flow, removed 31 redundant places. [2023-08-30 18:05:22,178 INFO L231 Difference]: Finished difference. Result has 161 places, 170 transitions, 1415 flow [2023-08-30 18:05:22,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1451, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1415, PETRI_PLACES=161, PETRI_TRANSITIONS=170} [2023-08-30 18:05:22,179 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 93 predicate places. [2023-08-30 18:05:22,179 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 170 transitions, 1415 flow [2023-08-30 18:05:22,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 149.85714285714286) internal successors, (3147), 21 states have internal predecessors, (3147), 0 states have call successors, (0), 0 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:22,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:22,180 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:22,190 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:05:22,387 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:05:22,388 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:05:22,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:22,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1535173166, now seen corresponding path program 4 times [2023-08-30 18:05:22,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081973217] [2023-08-30 18:05:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:22,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:22,886 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:05:22,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:22,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081973217] [2023-08-30 18:05:22,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081973217] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:22,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056327895] [2023-08-30 18:05:22,886 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 18:05:22,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:22,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:22,888 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:05:22,909 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:05:23,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 18:05:23,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:23,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 18:05:23,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:23,050 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:23,138 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:23,139 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:23,160 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:23,324 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:23,352 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 16 treesize of output 12 [2023-08-30 18:05:23,423 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:23,424 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 25 treesize of output 11 [2023-08-30 18:05:23,505 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 22 treesize of output 17 [2023-08-30 18:05:23,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 18:05:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:05:23,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:23,624 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1151 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1151) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)))) is different from false [2023-08-30 18:05:23,785 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 21 treesize of output 19 [2023-08-30 18:05:23,790 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 15 treesize of output 8 [2023-08-30 18:05:23,804 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 21 treesize of output 19 [2023-08-30 18:05:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 2 not checked. [2023-08-30 18:05:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056327895] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:25,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:25,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-30 18:05:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812349932] [2023-08-30 18:05:25,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:25,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 18:05:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:25,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 18:05:25,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=153, Unknown=1, NotChecked=26, Total=240 [2023-08-30 18:05:25,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 476 [2023-08-30 18:05:25,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 170 transitions, 1415 flow. Second operand has 16 states, 16 states have (on average 150.6875) internal successors, (2411), 16 states have internal predecessors, (2411), 0 states have call successors, (0), 0 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:25,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:25,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 476 [2023-08-30 18:05:25,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:26,350 INFO L130 PetriNetUnfolder]: 1295/2805 cut-off events. [2023-08-30 18:05:26,351 INFO L131 PetriNetUnfolder]: For 10292/10320 co-relation queries the response was YES. [2023-08-30 18:05:26,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12445 conditions, 2805 events. 1295/2805 cut-off events. For 10292/10320 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 21174 event pairs, 263 based on Foata normal form. 7/2526 useless extension candidates. Maximal degree in co-relation 12226. Up to 1671 conditions per place. [2023-08-30 18:05:26,374 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 156 selfloop transitions, 14 changer transitions 60/236 dead transitions. [2023-08-30 18:05:26,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 236 transitions, 2282 flow [2023-08-30 18:05:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 18:05:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 18:05:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2038 transitions. [2023-08-30 18:05:26,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3293471234647705 [2023-08-30 18:05:26,381 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2038 transitions. [2023-08-30 18:05:26,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2038 transitions. [2023-08-30 18:05:26,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:26,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2038 transitions. [2023-08-30 18:05:26,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 156.76923076923077) internal successors, (2038), 13 states have internal predecessors, (2038), 0 states have call successors, (0), 0 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:26,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 476.0) internal successors, (6664), 14 states have internal predecessors, (6664), 0 states have call successors, (0), 0 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:26,415 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 476.0) internal successors, (6664), 14 states have internal predecessors, (6664), 0 states have call successors, (0), 0 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:26,415 INFO L175 Difference]: Start difference. First operand has 161 places, 170 transitions, 1415 flow. Second operand 13 states and 2038 transitions. [2023-08-30 18:05:26,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 236 transitions, 2282 flow [2023-08-30 18:05:26,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 236 transitions, 2222 flow, removed 16 selfloop flow, removed 12 redundant places. [2023-08-30 18:05:26,463 INFO L231 Difference]: Finished difference. Result has 157 places, 159 transitions, 1332 flow [2023-08-30 18:05:26,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1332, PETRI_PLACES=157, PETRI_TRANSITIONS=159} [2023-08-30 18:05:26,464 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2023-08-30 18:05:26,464 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 159 transitions, 1332 flow [2023-08-30 18:05:26,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 150.6875) internal successors, (2411), 16 states have internal predecessors, (2411), 0 states have call successors, (0), 0 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:26,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:26,465 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:26,474 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:05:26,671 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:05:26,671 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:05:26,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:26,672 INFO L85 PathProgramCache]: Analyzing trace with hash -280518816, now seen corresponding path program 5 times [2023-08-30 18:05:26,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:26,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316876041] [2023-08-30 18:05:26,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:26,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:27,961 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:05:27,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:27,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316876041] [2023-08-30 18:05:27,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316876041] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:27,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750423684] [2023-08-30 18:05:27,961 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 18:05:27,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:27,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:27,963 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:05:27,967 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:05:28,412 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 18:05:28,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:28,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 18:05:28,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:28,420 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:28,528 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:28,528 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:28,583 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:28,621 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:28,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-30 18:05:28,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:28,740 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 19 treesize of output 21 [2023-08-30 18:05:28,785 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:28,785 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 25 treesize of output 11 [2023-08-30 18:05:28,845 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 22 treesize of output 17 [2023-08-30 18:05:28,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 18:05:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:05:28,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:29,067 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_72| Int) (v_ArrVal_1239 (Array Int Int)) (v_ArrVal_1241 Int) (v_ArrVal_1242 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_72| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1239) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1241)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2023-08-30 18:05:29,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:05:29,096 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 29 treesize of output 30 [2023-08-30 18:05:29,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:05:29,106 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 48 treesize of output 38 [2023-08-30 18:05:29,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-08-30 18:05:31,163 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_72| Int) (v_ArrVal_1241 Int) (|~#a~0.offset| Int) (v_ArrVal_1242 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1241)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_72| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_72| |v_t_funThread1of2ForFork0_~i~0#1_83|))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_72| Int) (v_ArrVal_1241 Int) (|~#a~0.offset| Int) (v_ArrVal_1242 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1241)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_72| 28) |~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0)))))) is different from false [2023-08-30 18:05:33,279 WARN L839 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_72| Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1241 Int) (|~#a~0.offset| Int) (v_ArrVal_1242 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1236))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1241))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_72| 28) |~#a~0.offset|)) 0)))) (forall ((v_ArrVal_1236 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_83| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_83|) (< |v_t_funThread1of2ForFork0_~i~0#1_83| 0) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_72| Int) (v_ArrVal_1241 Int) (|~#a~0.offset| Int) (v_ArrVal_1242 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1236))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|) v_ArrVal_1241))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_72| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_72| |v_t_funThread1of2ForFork0_~i~0#1_83|)))))) is different from false [2023-08-30 18:05:41,184 WARN L222 SmtUtils]: Spent 7.71s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:05:41,591 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:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750423684] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:41,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-30 18:05:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743453558] [2023-08-30 18:05:41,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:41,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-30 18:05:41,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-30 18:05:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=325, Unknown=9, NotChecked=120, Total=552 [2023-08-30 18:05:41,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-08-30 18:05:41,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 159 transitions, 1332 flow. Second operand has 24 states, 24 states have (on average 144.33333333333334) internal successors, (3464), 24 states have internal predecessors, (3464), 0 states have call successors, (0), 0 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:41,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:41,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-08-30 18:05:41,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:42,464 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (forall ((v_ArrVal_1241 Int) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_1241)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) .cse2) 0)) (forall ((v_ArrVal_1242 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) .cse2) 0)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_72| Int) (v_ArrVal_1241 Int) (v_ArrVal_1242 (Array Int Int))) (let ((.cse3 (* |v_t_funThread2of2ForFork0_~i~0#1_72| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_1241)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset|)) 0) (not (= 0 (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset| 4))))))))) is different from false [2023-08-30 18:05:42,649 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (and (forall ((v_ArrVal_1241 Int) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1241)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) .cse0) 0)) (forall ((v_ArrVal_1242 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1242) |c_~#a~0.base|) .cse0) 0)))) is different from false [2023-08-30 18:05:43,183 INFO L130 PetriNetUnfolder]: 1140/2510 cut-off events. [2023-08-30 18:05:43,184 INFO L131 PetriNetUnfolder]: For 9643/9657 co-relation queries the response was YES. [2023-08-30 18:05:43,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11239 conditions, 2510 events. 1140/2510 cut-off events. For 9643/9657 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18675 event pairs, 240 based on Foata normal form. 6/2264 useless extension candidates. Maximal degree in co-relation 11044. Up to 1473 conditions per place. [2023-08-30 18:05:43,199 INFO L137 encePairwiseOnDemand]: 461/476 looper letters, 150 selfloop transitions, 31 changer transitions 72/259 dead transitions. [2023-08-30 18:05:43,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 259 transitions, 2497 flow [2023-08-30 18:05:43,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 18:05:43,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 18:05:43,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2553 transitions. [2023-08-30 18:05:43,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31549678695007416 [2023-08-30 18:05:43,202 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2553 transitions. [2023-08-30 18:05:43,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2553 transitions. [2023-08-30 18:05:43,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:43,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2553 transitions. [2023-08-30 18:05:43,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 150.1764705882353) internal successors, (2553), 17 states have internal predecessors, (2553), 0 states have call successors, (0), 0 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:43,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 0 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:43,211 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 476.0) internal successors, (8568), 18 states have internal predecessors, (8568), 0 states have call successors, (0), 0 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:43,211 INFO L175 Difference]: Start difference. First operand has 157 places, 159 transitions, 1332 flow. Second operand 17 states and 2553 transitions. [2023-08-30 18:05:43,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 259 transitions, 2497 flow [2023-08-30 18:05:43,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 259 transitions, 2435 flow, removed 17 selfloop flow, removed 14 redundant places. [2023-08-30 18:05:43,253 INFO L231 Difference]: Finished difference. Result has 157 places, 167 transitions, 1437 flow [2023-08-30 18:05:43,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1437, PETRI_PLACES=157, PETRI_TRANSITIONS=167} [2023-08-30 18:05:43,254 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2023-08-30 18:05:43,254 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 167 transitions, 1437 flow [2023-08-30 18:05:43,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 144.33333333333334) internal successors, (3464), 24 states have internal predecessors, (3464), 0 states have call successors, (0), 0 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:43,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:43,255 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:43,262 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:43,461 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:43,461 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:43,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:43,461 INFO L85 PathProgramCache]: Analyzing trace with hash -9212436, now seen corresponding path program 6 times [2023-08-30 18:05:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:43,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120878057] [2023-08-30 18:05:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:05:43,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:43,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120878057] [2023-08-30 18:05:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120878057] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145031740] [2023-08-30 18:05:43,733 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 18:05:43,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:43,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:43,737 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:43,787 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:44,181 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-30 18:05:44,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:44,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 18:05:44,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:44,188 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:44,241 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:44,242 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:44,255 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:44,273 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:44,300 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 16 treesize of output 12 [2023-08-30 18:05:44,342 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:44,342 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 25 treesize of output 11 [2023-08-30 18:05:44,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-08-30 18:05:44,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 18:05:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:05:44,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:44,494 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1332 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1332) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-08-30 18:05:44,619 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 60 treesize of output 56 [2023-08-30 18:05:44,627 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:05:44,628 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 46 treesize of output 41 [2023-08-30 18:05:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 2 not checked. [2023-08-30 18:05:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145031740] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:05:44,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:05:44,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-30 18:05:44,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772116637] [2023-08-30 18:05:44,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:05:44,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 18:05:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:05:44,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 18:05:44,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=152, Unknown=1, NotChecked=26, Total=240 [2023-08-30 18:05:44,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 476 [2023-08-30 18:05:44,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 167 transitions, 1437 flow. Second operand has 16 states, 16 states have (on average 150.75) internal successors, (2412), 16 states have internal predecessors, (2412), 0 states have call successors, (0), 0 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:44,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:05:44,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 476 [2023-08-30 18:05:44,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:05:45,470 INFO L130 PetriNetUnfolder]: 946/2120 cut-off events. [2023-08-30 18:05:45,471 INFO L131 PetriNetUnfolder]: For 11748/11762 co-relation queries the response was YES. [2023-08-30 18:05:45,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10730 conditions, 2120 events. 946/2120 cut-off events. For 11748/11762 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15377 event pairs, 261 based on Foata normal form. 4/1931 useless extension candidates. Maximal degree in co-relation 10462. Up to 1390 conditions per place. [2023-08-30 18:05:45,482 INFO L137 encePairwiseOnDemand]: 467/476 looper letters, 144 selfloop transitions, 6 changer transitions 60/216 dead transitions. [2023-08-30 18:05:45,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 216 transitions, 2263 flow [2023-08-30 18:05:45,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:05:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:05:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1418 transitions. [2023-08-30 18:05:45,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33099906629318393 [2023-08-30 18:05:45,485 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1418 transitions. [2023-08-30 18:05:45,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1418 transitions. [2023-08-30 18:05:45,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:05:45,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1418 transitions. [2023-08-30 18:05:45,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.55555555555554) internal successors, (1418), 9 states have internal predecessors, (1418), 0 states have call successors, (0), 0 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:45,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 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:45,489 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 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:45,489 INFO L175 Difference]: Start difference. First operand has 157 places, 167 transitions, 1437 flow. Second operand 9 states and 1418 transitions. [2023-08-30 18:05:45,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 216 transitions, 2263 flow [2023-08-30 18:05:45,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 216 transitions, 2198 flow, removed 22 selfloop flow, removed 12 redundant places. [2023-08-30 18:05:45,524 INFO L231 Difference]: Finished difference. Result has 148 places, 153 transitions, 1266 flow [2023-08-30 18:05:45,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1266, PETRI_PLACES=148, PETRI_TRANSITIONS=153} [2023-08-30 18:05:45,524 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 80 predicate places. [2023-08-30 18:05:45,525 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 153 transitions, 1266 flow [2023-08-30 18:05:45,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 150.75) internal successors, (2412), 16 states have internal predecessors, (2412), 0 states have call successors, (0), 0 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:45,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:05:45,525 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:45,531 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:05:45,725 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:05:45,726 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:05:45,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:05:45,726 INFO L85 PathProgramCache]: Analyzing trace with hash -858990792, now seen corresponding path program 5 times [2023-08-30 18:05:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:05:45,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643972556] [2023-08-30 18:05:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:05:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:05:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:05:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:05:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:05:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643972556] [2023-08-30 18:05:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643972556] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:05:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744292288] [2023-08-30 18:05:46,281 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 18:05:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:05:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:05:46,282 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:05:46,307 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:05:46,720 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-30 18:05:46,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:05:46,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-30 18:05:46,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:05:46,728 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:46,808 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:46,808 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:46,834 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:46,864 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:46,886 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 16 treesize of output 12 [2023-08-30 18:05:46,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:46,928 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 19 treesize of output 21 [2023-08-30 18:05:46,948 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 22 treesize of output 17 [2023-08-30 18:05:46,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:05:46,980 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 19 treesize of output 21 [2023-08-30 18:05:47,033 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:05:47,033 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 25 treesize of output 11 [2023-08-30 18:05:47,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-08-30 18:05:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:05:47,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:05:47,129 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1424 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1424) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-08-30 18:05:47,208 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int) (v_ArrVal_1424 (Array Int Int)) (v_ArrVal_1423 (Array Int Int)) (v_ArrVal_1422 Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1424) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1423) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0)) 0))))) is different from false [2023-08-30 18:05:47,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:05:47,289 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 29 treesize of output 30 [2023-08-30 18:05:47,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:05:47,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 48 treesize of output 38 [2023-08-30 18:05:47,307 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 25 treesize of output 18 [2023-08-30 18:05:49,350 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|) (forall ((v_ArrVal_1424 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_76| Int) (v_ArrVal_1422 Int) (|~#a~0.offset| Int)) (or (= |v_t_funThread2of2ForFork0_~i~0#1_76| |v_t_funThread1of2ForFork0_~i~0#1_87|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_76| 28) |~#a~0.offset|) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1424) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|)) 0))))) (or (forall ((|v_t_funThread1of2ForFork0_~i~0#1_87| Int) (v_ArrVal_1424 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_76| Int) (v_ArrVal_1422 Int) (|~#a~0.offset| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_87| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_76| 28) |~#a~0.offset|) v_ArrVal_1422)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1424) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_87|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-30 18:05:59,615 WARN L222 SmtUtils]: Spent 10.07s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:06:08,122 WARN L222 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:06:08,974 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:06:08,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744292288] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:06:08,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:06:08,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-30 18:06:08,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147917563] [2023-08-30 18:06:08,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:06:08,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:06:08,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:06:08,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:06:08,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=286, Unknown=5, NotChecked=114, Total=506 [2023-08-30 18:06:11,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:13,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:15,259 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:06:17,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:19,385 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:21,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:23,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:06:25,626 WARN L539 Checker$ProtectedHtc]: 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,717 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:27,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 476 [2023-08-30 18:06:27,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 153 transitions, 1266 flow. Second operand has 23 states, 23 states have (on average 149.3913043478261) internal successors, (3436), 23 states have internal predecessors, (3436), 0 states have call successors, (0), 0 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:06:27,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:06:27,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 476 [2023-08-30 18:06:27,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:06:28,962 INFO L130 PetriNetUnfolder]: 780/1728 cut-off events. [2023-08-30 18:06:28,962 INFO L131 PetriNetUnfolder]: For 9151/9153 co-relation queries the response was YES. [2023-08-30 18:06:28,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8727 conditions, 1728 events. 780/1728 cut-off events. For 9151/9153 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12038 event pairs, 171 based on Foata normal form. 4/1592 useless extension candidates. Maximal degree in co-relation 8479. Up to 1259 conditions per place. [2023-08-30 18:06:28,978 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 151 selfloop transitions, 18 changer transitions 13/188 dead transitions. [2023-08-30 18:06:28,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 188 transitions, 1901 flow [2023-08-30 18:06:28,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 18:06:28,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 18:06:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1398 transitions. [2023-08-30 18:06:28,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32633053221288516 [2023-08-30 18:06:28,981 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1398 transitions. [2023-08-30 18:06:28,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1398 transitions. [2023-08-30 18:06:28,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:06:28,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1398 transitions. [2023-08-30 18:06:28,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 155.33333333333334) internal successors, (1398), 9 states have internal predecessors, (1398), 0 states have call successors, (0), 0 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:06:28,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 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:06:28,985 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 476.0) internal successors, (4760), 10 states have internal predecessors, (4760), 0 states have call successors, (0), 0 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:06:28,985 INFO L175 Difference]: Start difference. First operand has 148 places, 153 transitions, 1266 flow. Second operand 9 states and 1398 transitions. [2023-08-30 18:06:28,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 188 transitions, 1901 flow [2023-08-30 18:06:29,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 188 transitions, 1847 flow, removed 21 selfloop flow, removed 9 redundant places. [2023-08-30 18:06:29,009 INFO L231 Difference]: Finished difference. Result has 141 places, 161 transitions, 1349 flow [2023-08-30 18:06:29,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1349, PETRI_PLACES=141, PETRI_TRANSITIONS=161} [2023-08-30 18:06:29,010 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 73 predicate places. [2023-08-30 18:06:29,010 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 161 transitions, 1349 flow [2023-08-30 18:06:29,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.3913043478261) internal successors, (3436), 23 states have internal predecessors, (3436), 0 states have call successors, (0), 0 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:06:29,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:06:29,011 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:06:29,021 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:06:29,218 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:06:29,219 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:06:29,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:06:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1740544610, now seen corresponding path program 1 times [2023-08-30 18:06:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:06:29,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129599175] [2023-08-30 18:06:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:06:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:06:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:06:29,728 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:06:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:06:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129599175] [2023-08-30 18:06:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129599175] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:06:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092807203] [2023-08-30 18:06:29,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:06:29,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:06:29,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:06:29,732 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:06:29,734 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:06:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:06:29,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 18:06:29,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:06:29,895 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:06:29,962 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:06:29,962 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:06:29,984 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:06:30,007 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:06:30,067 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:06:30,180 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 48 treesize of output 41 [2023-08-30 18:06:30,226 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:06:30,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:06:32,038 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1517 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1517) |c_~#a~0.base|))) is different from false [2023-08-30 18:06:32,135 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:06:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092807203] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:06:32,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:06:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-08-30 18:06:32,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517309863] [2023-08-30 18:06:32,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:06:32,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:06:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:06:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:06:32,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=376, Unknown=1, NotChecked=40, Total=506 [2023-08-30 18:06:32,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-08-30 18:06:32,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 161 transitions, 1349 flow. Second operand has 23 states, 23 states have (on average 168.2608695652174) internal successors, (3870), 23 states have internal predecessors, (3870), 0 states have call successors, (0), 0 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:06:32,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:06:32,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-08-30 18:06:32,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:06:40,324 WARN L222 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 21 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:06:41,291 INFO L130 PetriNetUnfolder]: 767/1802 cut-off events. [2023-08-30 18:06:41,292 INFO L131 PetriNetUnfolder]: For 10046/10058 co-relation queries the response was YES. [2023-08-30 18:06:41,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9171 conditions, 1802 events. 767/1802 cut-off events. For 10046/10058 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13258 event pairs, 179 based on Foata normal form. 23/1731 useless extension candidates. Maximal degree in co-relation 8755. Up to 1095 conditions per place. [2023-08-30 18:06:41,308 INFO L137 encePairwiseOnDemand]: 463/476 looper letters, 162 selfloop transitions, 39 changer transitions 16/228 dead transitions. [2023-08-30 18:06:41,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 228 transitions, 2368 flow [2023-08-30 18:06:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-30 18:06:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-30 18:06:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2588 transitions. [2023-08-30 18:06:41,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36246498599439775 [2023-08-30 18:06:41,312 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2588 transitions. [2023-08-30 18:06:41,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2588 transitions. [2023-08-30 18:06:41,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:06:41,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2588 transitions. [2023-08-30 18:06:41,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 172.53333333333333) internal successors, (2588), 15 states have internal predecessors, (2588), 0 states have call successors, (0), 0 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:06:41,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 0 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:06:41,321 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 476.0) internal successors, (7616), 16 states have internal predecessors, (7616), 0 states have call successors, (0), 0 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:06:41,321 INFO L175 Difference]: Start difference. First operand has 141 places, 161 transitions, 1349 flow. Second operand 15 states and 2588 transitions. [2023-08-30 18:06:41,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 228 transitions, 2368 flow [2023-08-30 18:06:41,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 228 transitions, 2290 flow, removed 27 selfloop flow, removed 5 redundant places. [2023-08-30 18:06:41,352 INFO L231 Difference]: Finished difference. Result has 157 places, 185 transitions, 1678 flow [2023-08-30 18:06:41,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1678, PETRI_PLACES=157, PETRI_TRANSITIONS=185} [2023-08-30 18:06:41,353 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2023-08-30 18:06:41,353 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 185 transitions, 1678 flow [2023-08-30 18:06:41,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.2608695652174) internal successors, (3870), 23 states have internal predecessors, (3870), 0 states have call successors, (0), 0 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:06:41,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:06:41,354 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:06:41,366 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:06:41,561 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:06:41,562 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:06:41,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:06:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1958141083, now seen corresponding path program 1 times [2023-08-30 18:06:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:06:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310996505] [2023-08-30 18:06:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:06:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:06:41,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:06:42,040 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:06:42,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:06:42,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310996505] [2023-08-30 18:06:42,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310996505] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:06:42,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733435136] [2023-08-30 18:06:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:06:42,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:06:42,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:06:42,042 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:06:42,045 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:06:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:06:42,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 18:06:42,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:06:42,239 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:06:42,338 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:06:42,338 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:06:42,355 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:06:42,517 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:06:42,579 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 48 treesize of output 41 [2023-08-30 18:06:42,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 13 treesize of output 15 [2023-08-30 18:06:42,672 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:06:42,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:06:42,999 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_80| Int) (v_ArrVal_1618 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1618) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_80| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_80| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_80|))) is different from false [2023-08-30 18:06:45,875 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_80| Int) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_1618 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_80| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1618) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_80| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_80|))) is different from false [2023-08-30 18:06:45,970 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1613 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_80| Int) (|~#a~0.offset| Int) (|t_funThread1of2ForFork0_~i~0#1| Int) (v_ArrVal_1618 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_80| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_80|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1613))) (store .cse0 |c_~#a~0.base| (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* |t_funThread1of2ForFork0_~i~0#1| 28) |~#a~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1618) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_80| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-30 18:06:46,193 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:06:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733435136] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:06:46,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:06:46,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 21 [2023-08-30 18:06:46,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047728887] [2023-08-30 18:06:46,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:06:46,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-30 18:06:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:06:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-30 18:06:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=294, Unknown=9, NotChecked=114, Total=506 [2023-08-30 18:06:46,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-08-30 18:06:46,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 185 transitions, 1678 flow. Second operand has 23 states, 23 states have (on average 168.52173913043478) internal successors, (3876), 23 states have internal predecessors, (3876), 0 states have call successors, (0), 0 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:06:46,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:06:46,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-08-30 18:06:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:06:47,158 INFO L130 PetriNetUnfolder]: 785/1845 cut-off events. [2023-08-30 18:06:47,159 INFO L131 PetriNetUnfolder]: For 11421/11451 co-relation queries the response was YES. [2023-08-30 18:06:47,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9731 conditions, 1845 events. 785/1845 cut-off events. For 11421/11451 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13782 event pairs, 120 based on Foata normal form. 21/1764 useless extension candidates. Maximal degree in co-relation 9423. Up to 511 conditions per place. [2023-08-30 18:06:47,174 INFO L137 encePairwiseOnDemand]: 466/476 looper letters, 65 selfloop transitions, 4 changer transitions 157/234 dead transitions. [2023-08-30 18:06:47,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 234 transitions, 2584 flow [2023-08-30 18:06:47,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 18:06:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 18:06:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2072 transitions. [2023-08-30 18:06:47,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2023-08-30 18:06:47,178 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2072 transitions. [2023-08-30 18:06:47,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2072 transitions. [2023-08-30 18:06:47,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:06:47,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2072 transitions. [2023-08-30 18:06:47,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 172.66666666666666) internal successors, (2072), 12 states have internal predecessors, (2072), 0 states have call successors, (0), 0 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:06:47,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 0 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:06:47,184 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 476.0) internal successors, (6188), 13 states have internal predecessors, (6188), 0 states have call successors, (0), 0 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:06:47,184 INFO L175 Difference]: Start difference. First operand has 157 places, 185 transitions, 1678 flow. Second operand 12 states and 2072 transitions. [2023-08-30 18:06:47,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 234 transitions, 2584 flow [2023-08-30 18:06:47,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 234 transitions, 2411 flow, removed 66 selfloop flow, removed 11 redundant places. [2023-08-30 18:06:47,220 INFO L231 Difference]: Finished difference. Result has 156 places, 75 transitions, 556 flow [2023-08-30 18:06:47,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=556, PETRI_PLACES=156, PETRI_TRANSITIONS=75} [2023-08-30 18:06:47,225 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 88 predicate places. [2023-08-30 18:06:47,226 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 75 transitions, 556 flow [2023-08-30 18:06:47,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.52173913043478) internal successors, (3876), 23 states have internal predecessors, (3876), 0 states have call successors, (0), 0 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:06:47,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:06:47,227 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:06:47,236 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:06:47,434 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:06:47,434 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:06:47,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:06:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1139005814, now seen corresponding path program 2 times [2023-08-30 18:06:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:06:47,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673128149] [2023-08-30 18:06:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:06:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:06:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:06:48,457 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:06:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:06:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673128149] [2023-08-30 18:06:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673128149] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:06:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461317176] [2023-08-30 18:06:48,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:06:48,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:06:48,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:06:48,459 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:06:48,461 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:06:48,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:06:48,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:06:48,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 18:06:48,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:06:48,631 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:06:48,730 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:06:48,731 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:06:48,755 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:06:48,782 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:06:48,864 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:06:48,929 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 40 treesize of output 40 [2023-08-30 18:06:49,009 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 45 treesize of output 40 [2023-08-30 18:06:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:06:49,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:06:55,328 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_93| Int) (v_ArrVal_1718 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_93| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (+ (- 1) |c_t_funThread2of2ForFork0_#t~mem38#1|)) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_93| 28) |c_~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_93|))) is different from false [2023-08-30 18:06:55,342 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_93| Int) (v_ArrVal_1718 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_93| 0) (= (select (let ((.cse0 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#a~0.base|) .cse0 (+ (- 1) (select (select |c_#memory_int| |c_~#a~0.base|) .cse0)))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_93| 28) |c_~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_93|))) is different from false [2023-08-30 18:06:57,642 WARN L839 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|v_t_funThread1of2ForFork0_~i~0#1_93| Int) (v_ArrVal_1718 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_93| 0) (= (select (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse2 (select .cse0 .cse1))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#a~0.base|) .cse1 .cse2))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_93| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_93|))) is different from false [2023-08-30 18:06:59,722 WARN L839 $PredicateComparison]: unable to prove that (forall ((|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|v_t_funThread1of2ForFork0_~i~0#1_93| Int) (v_ArrVal_1718 (Array Int Int)) (v_ArrVal_1715 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_93| 0) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1715))) (let ((.cse1 (select .cse0 |c_~#a~0.base|)) (.cse2 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse3 (select .cse1 .cse2))) (store (select (store (store .cse0 |c_~#a~0.base| (store .cse1 .cse2 (+ .cse3 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1718) |c_~#a~0.base|) .cse2 .cse3)))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_93| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_93|))) is different from false [2023-08-30 18:06:59,953 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:06:59,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461317176] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:06:59,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:06:59,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 28 [2023-08-30 18:06:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431093020] [2023-08-30 18:06:59,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:06:59,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-30 18:06:59,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:06:59,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-30 18:06:59,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=544, Unknown=11, NotChecked=204, Total=870 [2023-08-30 18:06:59,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 476 [2023-08-30 18:06:59,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 75 transitions, 556 flow. Second operand has 30 states, 30 states have (on average 144.33333333333334) internal successors, (4330), 30 states have internal predecessors, (4330), 0 states have call successors, (0), 0 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:06:59,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:06:59,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 476 [2023-08-30 18:06:59,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:07:03,344 INFO L130 PetriNetUnfolder]: 181/490 cut-off events. [2023-08-30 18:07:03,345 INFO L131 PetriNetUnfolder]: For 2117/2117 co-relation queries the response was YES. [2023-08-30 18:07:03,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2336 conditions, 490 events. 181/490 cut-off events. For 2117/2117 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2682 event pairs, 29 based on Foata normal form. 6/496 useless extension candidates. Maximal degree in co-relation 2293. Up to 154 conditions per place. [2023-08-30 18:07:03,347 INFO L137 encePairwiseOnDemand]: 464/476 looper letters, 36 selfloop transitions, 13 changer transitions 68/121 dead transitions. [2023-08-30 18:07:03,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 1176 flow [2023-08-30 18:07:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 18:07:03,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 18:07:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2630 transitions. [2023-08-30 18:07:03,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3069561157796452 [2023-08-30 18:07:03,350 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2630 transitions. [2023-08-30 18:07:03,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2630 transitions. [2023-08-30 18:07:03,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:07:03,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2630 transitions. [2023-08-30 18:07:03,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 146.11111111111111) internal successors, (2630), 18 states have internal predecessors, (2630), 0 states have call successors, (0), 0 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:03,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 0 states have call successors, (0), 0 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:03,356 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 476.0) internal successors, (9044), 19 states have internal predecessors, (9044), 0 states have call successors, (0), 0 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:03,356 INFO L175 Difference]: Start difference. First operand has 156 places, 75 transitions, 556 flow. Second operand 18 states and 2630 transitions. [2023-08-30 18:07:03,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 1176 flow [2023-08-30 18:07:03,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 121 transitions, 1055 flow, removed 41 selfloop flow, removed 21 redundant places. [2023-08-30 18:07:03,365 INFO L231 Difference]: Finished difference. Result has 111 places, 49 transitions, 326 flow [2023-08-30 18:07:03,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=326, PETRI_PLACES=111, PETRI_TRANSITIONS=49} [2023-08-30 18:07:03,366 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 43 predicate places. [2023-08-30 18:07:03,366 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 49 transitions, 326 flow [2023-08-30 18:07:03,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 144.33333333333334) internal successors, (4330), 30 states have internal predecessors, (4330), 0 states have call successors, (0), 0 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:03,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:07:03,367 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:07:03,375 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:07:03,568 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:07:03,569 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:07:03,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:07:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1063167678, now seen corresponding path program 3 times [2023-08-30 18:07:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:07:03,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781400008] [2023-08-30 18:07:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:07:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:07:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:07:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:07:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:07:03,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781400008] [2023-08-30 18:07:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781400008] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:07:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239746859] [2023-08-30 18:07:03,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 18:07:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:07:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:07:03,926 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:07:03,927 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:07:04,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-30 18:07:04,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:07:04,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-30 18:07:04,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:07:04,095 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:04,144 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:07:04,144 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:04,162 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:04,180 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:04,235 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:07:04,257 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 29 treesize of output 31 [2023-08-30 18:07:04,346 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 48 treesize of output 41 [2023-08-30 18:07:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-30 18:07:04,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:07:05,894 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1820 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_95| Int)) (or (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1820) |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1)))) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_95| 28))) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_95|) (< |v_t_funThread1of2ForFork0_~i~0#1_95| 0))) is different from false [2023-08-30 18:07:05,906 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1820 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_95| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_95|) (< |v_t_funThread1of2ForFork0_~i~0#1_95| 0) (= (select (let ((.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) .cse1 (+ |c_t_funThread2of2ForFork0_#t~mem35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1820) |c_~#a~0.base|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_95| 28))) 0))) is different from false [2023-08-30 18:07:07,922 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1820 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (|v_t_funThread1of2ForFork0_~i~0#1_95| Int)) (or (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_95|) (= (select (let ((.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select |c_#memory_int| |c_~#a~0.base|))) (store .cse2 .cse1 (+ (select .cse2 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1820) |c_~#a~0.base|))) (store .cse0 .cse1 (+ (- 1) (select .cse0 .cse1))))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|)) 0) (< |v_t_funThread1of2ForFork0_~i~0#1_95| 0))) is different from false [2023-08-30 18:07:09,994 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1820 (Array Int Int)) (|~#a~0.offset| Int) (|t_funThread2of2ForFork0_~i~0#1| Int) (v_ArrVal_1817 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_95| Int)) (or (= (select (let ((.cse1 (+ (* 28 |t_funThread2of2ForFork0_~i~0#1|) |~#a~0.offset|))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1817))) (store .cse2 |c_~#a~0.base| (let ((.cse3 (select .cse2 |c_~#a~0.base|))) (store .cse3 .cse1 (+ (select .cse3 .cse1) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1820) |c_~#a~0.base|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) (- 1))))) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_95| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread1of2ForFork0_~i~0#1_95|) (< |v_t_funThread1of2ForFork0_~i~0#1_95| 0))) is different from false [2023-08-30 18:07:10,226 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:07:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239746859] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:07:10,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:07:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 23 [2023-08-30 18:07:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854078833] [2023-08-30 18:07:10,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:07:10,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-30 18:07:10,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:07:10,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-30 18:07:10,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=345, Unknown=4, NotChecked=164, Total=600 [2023-08-30 18:07:10,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 476 [2023-08-30 18:07:10,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 49 transitions, 326 flow. Second operand has 25 states, 25 states have (on average 168.28) internal successors, (4207), 25 states have internal predecessors, (4207), 0 states have call successors, (0), 0 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:10,299 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:07:10,299 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 476 [2023-08-30 18:07:10,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:07:28,431 WARN L222 SmtUtils]: Spent 18.09s on a formula simplification. DAG size of input: 45 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:07:30,445 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:07:32,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:34,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:36,464 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:07:38,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:40,506 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:07:42,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:07:44,567 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:07:46,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:48,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:07:50,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:07:52,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:07:54,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:07:56,632 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:07:58,637 WARN L539 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:08:18,839 WARN L222 SmtUtils]: Spent 20.13s on a formula simplification. DAG size of input: 59 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 18:08:20,849 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:08:23,523 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:08:25,534 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:08:27,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:08:29,544 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:08:31,549 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:08:33,561 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:08:35,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:08:37,590 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:08:39,592 WARN L539 Checker$ProtectedHtc]: 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:08:41,603 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:08:43,624 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:08:45,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:08:47,807 WARN L539 Checker$ProtectedHtc]: 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:08:49,815 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:08:52,314 WARN L539 Checker$ProtectedHtc]: 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:08:54,326 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:08:56,335 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:08:58,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 18:09:00,442 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:02,461 WARN L539 Checker$ProtectedHtc]: 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:04,479 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:09:06,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:08,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:09:10,561 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:09:12,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:09:14,576 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:16,675 WARN L539 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:19,204 INFO L130 PetriNetUnfolder]: 17/99 cut-off events. [2023-08-30 18:09:19,204 INFO L131 PetriNetUnfolder]: For 418/420 co-relation queries the response was YES. [2023-08-30 18:09:19,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 99 events. 17/99 cut-off events. For 418/420 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 211 event pairs, 2 based on Foata normal form. 7/106 useless extension candidates. Maximal degree in co-relation 398. Up to 16 conditions per place. [2023-08-30 18:09:19,205 INFO L137 encePairwiseOnDemand]: 464/476 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2023-08-30 18:09:19,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 62 transitions, 504 flow [2023-08-30 18:09:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:09:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:09:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2364 transitions. [2023-08-30 18:09:19,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3547418967587035 [2023-08-30 18:09:19,208 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2364 transitions. [2023-08-30 18:09:19,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2364 transitions. [2023-08-30 18:09:19,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:19,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2364 transitions. [2023-08-30 18:09:19,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 168.85714285714286) internal successors, (2364), 14 states have internal predecessors, (2364), 0 states have call successors, (0), 0 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:19,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 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:19,216 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 476.0) internal successors, (7140), 15 states have internal predecessors, (7140), 0 states have call successors, (0), 0 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:19,216 INFO L175 Difference]: Start difference. First operand has 111 places, 49 transitions, 326 flow. Second operand 14 states and 2364 transitions. [2023-08-30 18:09:19,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 62 transitions, 504 flow [2023-08-30 18:09:19,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 62 transitions, 396 flow, removed 37 selfloop flow, removed 21 redundant places. [2023-08-30 18:09:19,219 INFO L231 Difference]: Finished difference. Result has 86 places, 0 transitions, 0 flow [2023-08-30 18:09:19,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=476, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=86, PETRI_TRANSITIONS=0} [2023-08-30 18:09:19,220 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 18 predicate places. [2023-08-30 18:09:19,220 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 0 transitions, 0 flow [2023-08-30 18:09:19,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 168.28) internal successors, (4207), 25 states have internal predecessors, (4207), 0 states have call successors, (0), 0 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:19,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-30 18:09:19,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-30 18:09:19,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-30 18:09:19,221 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-30 18:09:19,235 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:09:19,428 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:09:19,429 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 3, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 18:09:19,431 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-30 18:09:19,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 18:09:19,513 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-08-30 18:09:19,513 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 18:09:19,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-30 18:09:19,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 18:09:19,521 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 260 transitions, 538 flow [2023-08-30 18:09:19,521 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 18:09:19,521 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-30 18:09:19,521 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 260 transitions, 538 flow [2023-08-30 18:09:19,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 260 transitions, 538 flow [2023-08-30 18:09:19,559 INFO L130 PetriNetUnfolder]: 75/424 cut-off events. [2023-08-30 18:09:19,559 INFO L131 PetriNetUnfolder]: For 6/8 co-relation queries the response was YES. [2023-08-30 18:09:19,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 424 events. 75/424 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 262. Up to 12 conditions per place. [2023-08-30 18:09:19,575 INFO L119 LiptonReduction]: Number of co-enabled transitions 31416 [2023-08-30 18:09:23,263 INFO L134 LiptonReduction]: Checked pairs total: 54189 [2023-08-30 18:09:23,263 INFO L136 LiptonReduction]: Total number of compositions: 212 [2023-08-30 18:09:23,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-30 18:09:23,265 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;@3c4dff15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 18:09:23,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-30 18:09:23,273 INFO L130 PetriNetUnfolder]: 38/115 cut-off events. [2023-08-30 18:09:23,273 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 18:09:23,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:23,274 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-30 18:09:23,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:09:23,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2023237836, now seen corresponding path program 1 times [2023-08-30 18:09:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:23,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514637709] [2023-08-30 18:09:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 18:09:23,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:23,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514637709] [2023-08-30 18:09:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514637709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:09:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:09:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 18:09:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839156073] [2023-08-30 18:09:23,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:09:23,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:09:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:09:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 18:09:23,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 472 [2023-08-30 18:09:23,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 100 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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:23,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:23,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 472 [2023-08-30 18:09:23,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:24,268 INFO L130 PetriNetUnfolder]: 9849/15756 cut-off events. [2023-08-30 18:09:24,269 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-30 18:09:24,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30204 conditions, 15756 events. 9849/15756 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 104674 event pairs, 9112 based on Foata normal form. 2729/16053 useless extension candidates. Maximal degree in co-relation 12153. Up to 14349 conditions per place. [2023-08-30 18:09:24,319 INFO L137 encePairwiseOnDemand]: 438/472 looper letters, 36 selfloop transitions, 2 changer transitions 23/70 dead transitions. [2023-08-30 18:09:24,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 272 flow [2023-08-30 18:09:24,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:09:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:09:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2023-08-30 18:09:24,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507768361581921 [2023-08-30 18:09:24,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 719 transitions. [2023-08-30 18:09:24,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 719 transitions. [2023-08-30 18:09:24,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:24,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 719 transitions. [2023-08-30 18:09:24,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 18:09:24,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 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:24,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 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:24,323 INFO L175 Difference]: Start difference. First operand has 68 places, 100 transitions, 218 flow. Second operand 3 states and 719 transitions. [2023-08-30 18:09:24,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 272 flow [2023-08-30 18:09:24,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:09:24,325 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 116 flow [2023-08-30 18:09:24,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, 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=116, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2023-08-30 18:09:24,326 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-30 18:09:24,326 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 116 flow [2023-08-30 18:09:24,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 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:24,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:24,326 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-30 18:09:24,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-30 18:09:24,327 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:09:24,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1786261897, now seen corresponding path program 1 times [2023-08-30 18:09:24,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:24,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479764951] [2023-08-30 18:09:24,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 18:09:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:24,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479764951] [2023-08-30 18:09:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479764951] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:09:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793324851] [2023-08-30 18:09:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:24,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:24,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:09:24,354 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:09:24,357 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:09:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:24,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:09:24,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:09:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 18:09:24,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:09:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 18:09:24,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793324851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:09:24,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:09:24,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 18:09:24,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685293198] [2023-08-30 18:09:24,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:09:24,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:09:24,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:24,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:09:24,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:09:24,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 472 [2023-08-30 18:09:24,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 47 transitions, 116 flow. Second operand has 7 states, 7 states have (on average 210.71428571428572) internal successors, (1475), 7 states have internal predecessors, (1475), 0 states have call successors, (0), 0 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:24,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:24,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 472 [2023-08-30 18:09:24,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:24,814 INFO L130 PetriNetUnfolder]: 1738/2923 cut-off events. [2023-08-30 18:09:24,814 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-30 18:09:24,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5649 conditions, 2923 events. 1738/2923 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16159 event pairs, 1617 based on Foata normal form. 0/2391 useless extension candidates. Maximal degree in co-relation 5636. Up to 2647 conditions per place. [2023-08-30 18:09:24,828 INFO L137 encePairwiseOnDemand]: 469/472 looper letters, 36 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-30 18:09:24,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 210 flow [2023-08-30 18:09:24,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:09:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:09:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1298 transitions. [2023-08-30 18:09:24,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-30 18:09:24,831 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1298 transitions. [2023-08-30 18:09:24,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1298 transitions. [2023-08-30 18:09:24,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:24,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1298 transitions. [2023-08-30 18:09:24,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 0 states have call successors, (0), 0 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:24,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 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:24,835 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 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:24,836 INFO L175 Difference]: Start difference. First operand has 71 places, 47 transitions, 116 flow. Second operand 6 states and 1298 transitions. [2023-08-30 18:09:24,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 210 flow [2023-08-30 18:09:24,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 204 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 18:09:24,837 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 146 flow [2023-08-30 18:09:24,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-30 18:09:24,838 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2023-08-30 18:09:24,838 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 146 flow [2023-08-30 18:09:24,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.71428571428572) internal successors, (1475), 7 states have internal predecessors, (1475), 0 states have call successors, (0), 0 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:24,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:24,838 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-30 18:09:24,850 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:09:25,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:25,045 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:09:25,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash -170507148, now seen corresponding path program 2 times [2023-08-30 18:09:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798283575] [2023-08-30 18:09:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:25,128 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 18:09:25,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798283575] [2023-08-30 18:09:25,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798283575] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:09:25,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806919561] [2023-08-30 18:09:25,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:09:25,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:25,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:09:25,133 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:09:25,177 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:09:25,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 18:09:25,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:09:25,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 18:09:25,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:09:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 18:09:25,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:09:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-30 18:09:25,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806919561] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:09:25,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:09:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-30 18:09:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075654061] [2023-08-30 18:09:25,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:09:25,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-30 18:09:25,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:25,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-30 18:09:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-30 18:09:25,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 472 [2023-08-30 18:09:25,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 146 flow. Second operand has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 0 states have call successors, (0), 0 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:25,479 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:25,479 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 472 [2023-08-30 18:09:25,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:25,723 INFO L130 PetriNetUnfolder]: 1738/2929 cut-off events. [2023-08-30 18:09:25,724 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2023-08-30 18:09:25,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5680 conditions, 2929 events. 1738/2929 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 16125 event pairs, 1617 based on Foata normal form. 6/2404 useless extension candidates. Maximal degree in co-relation 5621. Up to 2647 conditions per place. [2023-08-30 18:09:25,740 INFO L137 encePairwiseOnDemand]: 469/472 looper letters, 36 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2023-08-30 18:09:25,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 276 flow [2023-08-30 18:09:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-30 18:09:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-30 18:09:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2561 transitions. [2023-08-30 18:09:25,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521539548022599 [2023-08-30 18:09:25,746 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2561 transitions. [2023-08-30 18:09:25,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2561 transitions. [2023-08-30 18:09:25,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:25,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2561 transitions. [2023-08-30 18:09:25,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 213.41666666666666) internal successors, (2561), 12 states have internal predecessors, (2561), 0 states have call successors, (0), 0 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:25,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 472.0) internal successors, (6136), 13 states have internal predecessors, (6136), 0 states have call successors, (0), 0 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:25,763 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 472.0) internal successors, (6136), 13 states have internal predecessors, (6136), 0 states have call successors, (0), 0 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:25,763 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 146 flow. Second operand 12 states and 2561 transitions. [2023-08-30 18:09:25,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 276 flow [2023-08-30 18:09:25,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 262 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 18:09:25,764 INFO L231 Difference]: Finished difference. Result has 74 places, 56 transitions, 216 flow [2023-08-30 18:09:25,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=216, PETRI_PLACES=74, PETRI_TRANSITIONS=56} [2023-08-30 18:09:25,765 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2023-08-30 18:09:25,765 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 56 transitions, 216 flow [2023-08-30 18:09:25,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 210.3846153846154) internal successors, (2735), 13 states have internal predecessors, (2735), 0 states have call successors, (0), 0 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:25,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:25,766 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2023-08-30 18:09:25,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-30 18:09:25,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:25,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-30 18:09:25,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:25,967 INFO L85 PathProgramCache]: Analyzing trace with hash 447921236, now seen corresponding path program 3 times [2023-08-30 18:09:25,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:25,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596728163] [2023-08-30 18:09:25,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:25,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 18:09:25,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 18:09:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 18:09:26,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 18:09:26,016 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 18:09:26,016 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-30 18:09:26,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-08-30 18:09:26,016 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-30 18:09:26,017 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-30 18:09:26,017 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-30 18:09:26,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-30 18:09:26,063 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 18:09:26,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 330 transitions, 690 flow [2023-08-30 18:09:26,181 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2023-08-30 18:09:26,181 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-08-30 18:09:26,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 619 events. 110/619 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2706 event pairs, 1 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 432. Up to 16 conditions per place. [2023-08-30 18:09:26,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 330 transitions, 690 flow [2023-08-30 18:09:26,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 278 places, 330 transitions, 690 flow [2023-08-30 18:09:26,200 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 18:09:26,200 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 278 places, 330 transitions, 690 flow [2023-08-30 18:09:26,200 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 278 places, 330 transitions, 690 flow [2023-08-30 18:09:26,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 330 transitions, 690 flow [2023-08-30 18:09:26,270 INFO L130 PetriNetUnfolder]: 110/619 cut-off events. [2023-08-30 18:09:26,270 INFO L131 PetriNetUnfolder]: For 19/22 co-relation queries the response was YES. [2023-08-30 18:09:26,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 619 events. 110/619 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2706 event pairs, 1 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 432. Up to 16 conditions per place. [2023-08-30 18:09:26,308 INFO L119 LiptonReduction]: Number of co-enabled transitions 61608 [2023-08-30 18:09:30,150 INFO L134 LiptonReduction]: Checked pairs total: 111186 [2023-08-30 18:09:30,150 INFO L136 LiptonReduction]: Total number of compositions: 274 [2023-08-30 18:09:30,152 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 18:09:30,152 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;@3c4dff15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 18:09:30,152 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-30 18:09:30,154 INFO L130 PetriNetUnfolder]: 7/23 cut-off events. [2023-08-30 18:09:30,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 18:09:30,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:30,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-30 18:09:30,154 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:09:30,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:30,155 INFO L85 PathProgramCache]: Analyzing trace with hash 258191094, now seen corresponding path program 1 times [2023-08-30 18:09:30,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630894647] [2023-08-30 18:09:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:30,172 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:09:30,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:30,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630894647] [2023-08-30 18:09:30,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630894647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:09:30,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:09:30,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 18:09:30,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718164343] [2023-08-30 18:09:30,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:09:30,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:09:30,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:09:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 18:09:30,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 604 [2023-08-30 18:09:30,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 131 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 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:30,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:30,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 604 [2023-08-30 18:09:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:09:55,803 INFO L130 PetriNetUnfolder]: 252661/348965 cut-off events. [2023-08-30 18:09:55,804 INFO L131 PetriNetUnfolder]: For 3589/3589 co-relation queries the response was YES. [2023-08-30 18:09:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681977 conditions, 348965 events. 252661/348965 cut-off events. For 3589/3589 co-relation queries the response was YES. Maximal size of possible extension queue 8440. Compared 2626051 event pairs, 240676 based on Foata normal form. 57687/354412 useless extension candidates. Maximal degree in co-relation 94389. Up to 330814 conditions per place. [2023-08-30 18:09:58,027 INFO L137 encePairwiseOnDemand]: 559/604 looper letters, 73 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2023-08-30 18:09:58,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 90 transitions, 360 flow [2023-08-30 18:09:58,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:09:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:09:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 913 transitions. [2023-08-30 18:09:58,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038631346578366 [2023-08-30 18:09:58,030 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 913 transitions. [2023-08-30 18:09:58,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 913 transitions. [2023-08-30 18:09:58,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:09:58,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 913 transitions. [2023-08-30 18:09:58,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 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:58,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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:58,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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:58,033 INFO L175 Difference]: Start difference. First operand has 88 places, 131 transitions, 292 flow. Second operand 3 states and 913 transitions. [2023-08-30 18:09:58,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 90 transitions, 360 flow [2023-08-30 18:09:58,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:09:58,037 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 220 flow [2023-08-30 18:09:58,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2023-08-30 18:09:58,037 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2023-08-30 18:09:58,037 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 220 flow [2023-08-30 18:09:58,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 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:58,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:09:58,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:09:58,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-08-30 18:09:58,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:09:58,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:09:58,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1517144130, now seen corresponding path program 1 times [2023-08-30 18:09:58,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:09:58,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145677835] [2023-08-30 18:09:58,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:58,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:09:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:58,063 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:09:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:09:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145677835] [2023-08-30 18:09:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145677835] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:09:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371294672] [2023-08-30 18:09:58,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:09:58,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:09:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:09:58,066 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:09:58,069 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:09:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:09:58,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-30 18:09:58,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:09:58,221 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:09:58,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:09:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371294672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:09:58,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:09:58,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-30 18:09:58,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478149335] [2023-08-30 18:09:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:09:58,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 18:09:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:09:58,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 18:09:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 18:09:58,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 604 [2023-08-30 18:09:58,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 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:58,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:09:58,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 604 [2023-08-30 18:09:58,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:10:19,538 INFO L130 PetriNetUnfolder]: 252584/348596 cut-off events. [2023-08-30 18:10:19,538 INFO L131 PetriNetUnfolder]: For 3555/3555 co-relation queries the response was YES. [2023-08-30 18:10:20,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681684 conditions, 348596 events. 252584/348596 cut-off events. For 3555/3555 co-relation queries the response was YES. Maximal size of possible extension queue 8487. Compared 2620959 event pairs, 157576 based on Foata normal form. 0/296520 useless extension candidates. Maximal degree in co-relation 681670. Up to 330782 conditions per place. [2023-08-30 18:10:21,066 INFO L137 encePairwiseOnDemand]: 601/604 looper letters, 90 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2023-08-30 18:10:21,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 438 flow [2023-08-30 18:10:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 18:10:21,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 18:10:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2023-08-30 18:10:21,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48951434878587197 [2023-08-30 18:10:21,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 887 transitions. [2023-08-30 18:10:21,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 887 transitions. [2023-08-30 18:10:21,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:10:21,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 887 transitions. [2023-08-30 18:10:21,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 295.6666666666667) internal successors, (887), 3 states have internal predecessors, (887), 0 states have call successors, (0), 0 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:21,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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:21,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 604.0) internal successors, (2416), 4 states have internal predecessors, (2416), 0 states have call successors, (0), 0 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:21,070 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 220 flow. Second operand 3 states and 887 transitions. [2023-08-30 18:10:21,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 438 flow [2023-08-30 18:10:21,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 107 transitions, 434 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 18:10:21,073 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 228 flow [2023-08-30 18:10:21,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2023-08-30 18:10:21,074 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2023-08-30 18:10:21,074 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 228 flow [2023-08-30 18:10:21,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 0 states have call successors, (0), 0 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:21,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:10:21,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:10:21,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-30 18:10:21,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-30 18:10:21,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:10:21,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:10:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1905250772, now seen corresponding path program 1 times [2023-08-30 18:10:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:10:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088900861] [2023-08-30 18:10:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:10:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 18:10:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:10:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088900861] [2023-08-30 18:10:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088900861] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:10:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727962975] [2023-08-30 18:10:21,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:21,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:21,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:10:21,309 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:10:21,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-30 18:10:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:21,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 18:10:21,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:10:21,455 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:10:21,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:10:21,465 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:10:21,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727962975] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:10:21,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:10:21,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-30 18:10:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53378953] [2023-08-30 18:10:21,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:10:21,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 18:10:21,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:10:21,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 18:10:21,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-30 18:10:21,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 604 [2023-08-30 18:10:21,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 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:21,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:10:21,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 604 [2023-08-30 18:10:21,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:10:45,575 INFO L130 PetriNetUnfolder]: 254329/349484 cut-off events. [2023-08-30 18:10:45,576 INFO L131 PetriNetUnfolder]: For 12214/12214 co-relation queries the response was YES. [2023-08-30 18:10:46,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691246 conditions, 349484 events. 254329/349484 cut-off events. For 12214/12214 co-relation queries the response was YES. Maximal size of possible extension queue 8447. Compared 2598994 event pairs, 240676 based on Foata normal form. 3/301654 useless extension candidates. Maximal degree in co-relation 691217. Up to 330799 conditions per place. [2023-08-30 18:10:47,069 INFO L137 encePairwiseOnDemand]: 601/604 looper letters, 74 selfloop transitions, 5 changer transitions 0/94 dead transitions. [2023-08-30 18:10:47,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 398 flow [2023-08-30 18:10:47,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:10:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:10:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1665 transitions. [2023-08-30 18:10:47,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594370860927152 [2023-08-30 18:10:47,071 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1665 transitions. [2023-08-30 18:10:47,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1665 transitions. [2023-08-30 18:10:47,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:10:47,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1665 transitions. [2023-08-30 18:10:47,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 277.5) internal successors, (1665), 6 states have internal predecessors, (1665), 0 states have call successors, (0), 0 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:47,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 0 states have call successors, (0), 0 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:47,076 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 0 states have call successors, (0), 0 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:47,076 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 228 flow. Second operand 6 states and 1665 transitions. [2023-08-30 18:10:47,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 398 flow [2023-08-30 18:10:47,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 94 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 18:10:47,088 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 262 flow [2023-08-30 18:10:47,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=262, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2023-08-30 18:10:47,089 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2023-08-30 18:10:47,089 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 262 flow [2023-08-30 18:10:47,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 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:47,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:10:47,089 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:10:47,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-30 18:10:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-30 18:10:47,296 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:10:47,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:10:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 409718028, now seen corresponding path program 2 times [2023-08-30 18:10:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:10:47,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195440287] [2023-08-30 18:10:47,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:10:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:10:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:10:47,337 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:10:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:10:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195440287] [2023-08-30 18:10:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195440287] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:10:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411503425] [2023-08-30 18:10:47,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 18:10:47,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:10:47,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:10:47,339 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:10:47,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-30 18:10:47,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 18:10:47,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 18:10:47,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-30 18:10:47,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:10:47,485 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:47,517 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:10:47,518 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:47,540 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:47,583 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:10:47,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 18:10:47,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411503425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:10:47,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 18:10:47,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-30 18:10:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347902921] [2023-08-30 18:10:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:10:47,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 18:10:47,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:10:47,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 18:10:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-30 18:10:47,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 604 [2023-08-30 18:10:47,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:47,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:10:47,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 604 [2023-08-30 18:10:47,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:11:10,765 INFO L130 PetriNetUnfolder]: 258704/355149 cut-off events. [2023-08-30 18:11:10,765 INFO L131 PetriNetUnfolder]: For 12764/12764 co-relation queries the response was YES. [2023-08-30 18:11:11,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708560 conditions, 355149 events. 258704/355149 cut-off events. For 12764/12764 co-relation queries the response was YES. Maximal size of possible extension queue 9438. Compared 2669970 event pairs, 73068 based on Foata normal form. 0/311382 useless extension candidates. Maximal degree in co-relation 708523. Up to 302995 conditions per place. [2023-08-30 18:11:12,433 INFO L137 encePairwiseOnDemand]: 592/604 looper letters, 190 selfloop transitions, 18 changer transitions 0/223 dead transitions. [2023-08-30 18:11:12,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 223 transitions, 987 flow [2023-08-30 18:11:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 18:11:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 18:11:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1737 transitions. [2023-08-30 18:11:12,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793046357615894 [2023-08-30 18:11:12,435 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1737 transitions. [2023-08-30 18:11:12,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1737 transitions. [2023-08-30 18:11:12,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:11:12,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1737 transitions. [2023-08-30 18:11:12,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 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:12,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 0 states have call successors, (0), 0 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:12,438 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 604.0) internal successors, (4228), 7 states have internal predecessors, (4228), 0 states have call successors, (0), 0 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:12,438 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 262 flow. Second operand 6 states and 1737 transitions. [2023-08-30 18:11:12,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 223 transitions, 987 flow [2023-08-30 18:11:12,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 223 transitions, 973 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-30 18:11:12,445 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 375 flow [2023-08-30 18:11:12,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2023-08-30 18:11:12,446 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 20 predicate places. [2023-08-30 18:11:12,446 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 110 transitions, 375 flow [2023-08-30 18:11:12,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.5) internal successors, (1533), 6 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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:12,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:11:12,446 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 18:11:12,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-08-30 18:11:12,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-30 18:11:12,647 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:11:12,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:11:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash -375198459, now seen corresponding path program 1 times [2023-08-30 18:11:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:11:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440746084] [2023-08-30 18:11:12,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:11:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:12,679 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:11:12,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:11:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440746084] [2023-08-30 18:11:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440746084] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:11:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796383387] [2023-08-30 18:11:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:12,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:11:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:11:12,681 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:11:12,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-30 18:11:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:12,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 18:11:12,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:11:12,875 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:11:12,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:11:12,933 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:11:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796383387] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:11:12,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:11:12,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-30 18:11:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776481269] [2023-08-30 18:11:12,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:11:12,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 18:11:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:11:12,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 18:11:12,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-30 18:11:12,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 604 [2023-08-30 18:11:12,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 110 transitions, 375 flow. Second operand has 14 states, 14 states have (on average 263.14285714285717) internal successors, (3684), 14 states have internal predecessors, (3684), 0 states have call successors, (0), 0 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:12,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:11:12,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 604 [2023-08-30 18:11:12,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:11:37,005 INFO L130 PetriNetUnfolder]: 259411/360314 cut-off events. [2023-08-30 18:11:37,005 INFO L131 PetriNetUnfolder]: For 144850/144850 co-relation queries the response was YES. [2023-08-30 18:11:38,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808227 conditions, 360314 events. 259411/360314 cut-off events. For 144850/144850 co-relation queries the response was YES. Maximal size of possible extension queue 9517. Compared 2792293 event pairs, 79293 based on Foata normal form. 22/337819 useless extension candidates. Maximal degree in co-relation 808167. Up to 344537 conditions per place. [2023-08-30 18:11:39,423 INFO L137 encePairwiseOnDemand]: 599/604 looper letters, 138 selfloop transitions, 14 changer transitions 0/167 dead transitions. [2023-08-30 18:11:39,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 167 transitions, 857 flow [2023-08-30 18:11:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-30 18:11:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-30 18:11:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3793 transitions. [2023-08-30 18:11:39,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44855723746452225 [2023-08-30 18:11:39,425 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3793 transitions. [2023-08-30 18:11:39,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3793 transitions. [2023-08-30 18:11:39,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:11:39,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3793 transitions. [2023-08-30 18:11:39,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 270.92857142857144) internal successors, (3793), 14 states have internal predecessors, (3793), 0 states have call successors, (0), 0 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:39,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 604.0) internal successors, (9060), 15 states have internal predecessors, (9060), 0 states have call successors, (0), 0 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:39,431 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 604.0) internal successors, (9060), 15 states have internal predecessors, (9060), 0 states have call successors, (0), 0 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:39,431 INFO L175 Difference]: Start difference. First operand has 108 places, 110 transitions, 375 flow. Second operand 14 states and 3793 transitions. [2023-08-30 18:11:39,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 167 transitions, 857 flow [2023-08-30 18:11:39,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 167 transitions, 857 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 18:11:39,793 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 451 flow [2023-08-30 18:11:39,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=451, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2023-08-30 18:11:39,794 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 34 predicate places. [2023-08-30 18:11:39,794 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 451 flow [2023-08-30 18:11:39,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 263.14285714285717) internal successors, (3684), 14 states have internal predecessors, (3684), 0 states have call successors, (0), 0 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:39,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:11:39,795 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:11:39,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-08-30 18:11:40,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-30 18:11:40,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:11:40,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:11:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash 823062819, now seen corresponding path program 1 times [2023-08-30 18:11:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:11:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691363509] [2023-08-30 18:11:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:11:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:40,094 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:11:40,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:11:40,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691363509] [2023-08-30 18:11:40,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691363509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 18:11:40,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 18:11:40,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 18:11:40,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048233507] [2023-08-30 18:11:40,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 18:11:40,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 18:11:40,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:11:40,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 18:11:40,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 18:11:40,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 604 [2023-08-30 18:11:40,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 451 flow. Second operand has 5 states, 5 states have (on average 241.4) internal successors, (1207), 5 states have internal predecessors, (1207), 0 states have call successors, (0), 0 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:40,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:11:40,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 604 [2023-08-30 18:11:40,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:11:52,200 INFO L130 PetriNetUnfolder]: 111889/174653 cut-off events. [2023-08-30 18:11:52,200 INFO L131 PetriNetUnfolder]: For 66289/66289 co-relation queries the response was YES. [2023-08-30 18:11:52,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399357 conditions, 174653 events. 111889/174653 cut-off events. For 66289/66289 co-relation queries the response was YES. Maximal size of possible extension queue 4594. Compared 1520737 event pairs, 44163 based on Foata normal form. 30514/188224 useless extension candidates. Maximal degree in co-relation 399283. Up to 95489 conditions per place. [2023-08-30 18:11:53,212 INFO L137 encePairwiseOnDemand]: 576/604 looper letters, 156 selfloop transitions, 28 changer transitions 0/196 dead transitions. [2023-08-30 18:11:53,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 196 transitions, 1104 flow [2023-08-30 18:11:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 18:11:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 18:11:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1102 transitions. [2023-08-30 18:11:53,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45612582781456956 [2023-08-30 18:11:53,214 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1102 transitions. [2023-08-30 18:11:53,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1102 transitions. [2023-08-30 18:11:53,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 18:11:53,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1102 transitions. [2023-08-30 18:11:53,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 275.5) internal successors, (1102), 4 states have internal predecessors, (1102), 0 states have call successors, (0), 0 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:53,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 604.0) internal successors, (3020), 5 states have internal predecessors, (3020), 0 states have call successors, (0), 0 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:53,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 604.0) internal successors, (3020), 5 states have internal predecessors, (3020), 0 states have call successors, (0), 0 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:53,216 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 451 flow. Second operand 4 states and 1102 transitions. [2023-08-30 18:11:53,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 196 transitions, 1104 flow [2023-08-30 18:11:53,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 196 transitions, 1031 flow, removed 26 selfloop flow, removed 10 redundant places. [2023-08-30 18:11:53,395 INFO L231 Difference]: Finished difference. Result has 116 places, 132 transitions, 524 flow [2023-08-30 18:11:53,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=604, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=116, PETRI_TRANSITIONS=132} [2023-08-30 18:11:53,395 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2023-08-30 18:11:53,395 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 132 transitions, 524 flow [2023-08-30 18:11:53,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 241.4) internal successors, (1207), 5 states have internal predecessors, (1207), 0 states have call successors, (0), 0 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:53,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 18:11:53,396 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:11:53,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-08-30 18:11:53,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-08-30 18:11:53,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 18:11:53,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1646308287, now seen corresponding path program 1 times [2023-08-30 18:11:53,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 18:11:53,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109516418] [2023-08-30 18:11:53,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:53,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 18:11:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:53,711 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:11:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 18:11:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109516418] [2023-08-30 18:11:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109516418] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 18:11:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171687758] [2023-08-30 18:11:53,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 18:11:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 18:11:53,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 18:11:53,713 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 18:11:53,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-08-30 18:11:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 18:11:53,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-30 18:11:53,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 18:11:53,907 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:53,985 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:11:53,985 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:54,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-30 18:11:54,027 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:54,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-30 18:11:54,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:11:54,078 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 19 treesize of output 21 [2023-08-30 18:11:54,093 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 22 treesize of output 17 [2023-08-30 18:11:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 18:11:54,123 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 19 treesize of output 21 [2023-08-30 18:11:54,167 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 18:11:54,167 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 25 treesize of output 11 [2023-08-30 18:11:54,210 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:11:54,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 18:11:54,263 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of3ForFork0_~i~0#1_59| Int) (v_ArrVal_2169 (Array Int Int))) (let ((.cse0 (* 28 |v_t_funThread2of3ForFork0_~i~0#1_59|))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2169) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset|)) 0) (< |v_t_funThread2of3ForFork0_~i~0#1_59| 0) (<= 10 |v_t_funThread2of3ForFork0_~i~0#1_59|)))) is different from false [2023-08-30 18:11:54,350 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:11:54,350 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 29 treesize of output 30 [2023-08-30 18:11:54,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 18:11:54,358 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 48 treesize of output 38 [2023-08-30 18:11:54,362 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 25 treesize of output 18 [2023-08-30 18:11:56,465 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2163 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2163) |c_~#a~0.base|)))) is different from false [2023-08-30 18:11:59,156 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:11:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171687758] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 18:11:59,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 18:11:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-08-30 18:11:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376275184] [2023-08-30 18:11:59,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 18:11:59,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-30 18:11:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 18:11:59,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-30 18:11:59,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=247, Unknown=2, NotChecked=70, Total=420 [2023-08-30 18:11:59,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 604 [2023-08-30 18:11:59,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 132 transitions, 524 flow. Second operand has 21 states, 21 states have (on average 190.42857142857142) internal successors, (3999), 21 states have internal predecessors, (3999), 0 states have call successors, (0), 0 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:59,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 18:11:59,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 604 [2023-08-30 18:11:59,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 18:12:02,103 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:12:05,403 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:12:08,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:12:17,778 WARN L539 Checker$ProtectedHtc]: 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:12:19,808 WARN L539 Checker$ProtectedHtc]: 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:12:26,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 18:12:29,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:12:31,613 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:12:37,188 INFO L130 PetriNetUnfolder]: 179643/279850 cut-off events. [2023-08-30 18:12:37,188 INFO L131 PetriNetUnfolder]: For 162392/162902 co-relation queries the response was YES. [2023-08-30 18:12:38,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768016 conditions, 279850 events. 179643/279850 cut-off events. For 162392/162902 co-relation queries the response was YES. Maximal size of possible extension queue 7233. Compared 2560854 event pairs, 19216 based on Foata normal form. 583/254310 useless extension candidates. Maximal degree in co-relation 757997. Up to 142201 conditions per place. Killed by 15