./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c --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/weaver/popl20-horseshoe.wvr.c -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 9a1ebdea5e08fe7fb177f9715317eb0e1f1a80d35c0ea62e77ce19d6486e2cb1 --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 20:23:13,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 20:23:13,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 20:23:13,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 20:23:13,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 20:23:13,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 20:23:13,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 20:23:13,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 20:23:13,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 20:23:13,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 20:23:13,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 20:23:13,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 20:23:13,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 20:23:13,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 20:23:13,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 20:23:13,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 20:23:13,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 20:23:13,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 20:23:13,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 20:23:13,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 20:23:13,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 20:23:13,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 20:23:13,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 20:23:13,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 20:23:13,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 20:23:13,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 20:23:13,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 20:23:13,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 20:23:13,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 20:23:13,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 20:23:13,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 20:23:13,090 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 20:23:13,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 20:23:13,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 20:23:13,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 20:23:13,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 20:23:13,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 20:23:13,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 20:23:13,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 20:23:13,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 20:23:13,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 20:23:13,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 20:23:13,117 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 20:23:13,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 20:23:13,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 20:23:13,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 20:23:13,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 20:23:13,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 20:23:13,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 20:23:13,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 20:23:13,120 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 20:23:13,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 20:23:13,121 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 20:23:13,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 20:23:13,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 20:23:13,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 20:23:13,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 20:23:13,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 20:23:13,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 20:23:13,122 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 20:23:13,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 20:23:13,123 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 20:23:13,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 20:23:13,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 20:23:13,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 20:23:13,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 20:23:13,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:23:13,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 20:23:13,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 20:23:13,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 20:23:13,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 20:23:13,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 20:23:13,125 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 20:23:13,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 20:23:13,125 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 20:23:13,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 20:23:13,126 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 20:23:13,126 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 -> 9a1ebdea5e08fe7fb177f9715317eb0e1f1a80d35c0ea62e77ce19d6486e2cb1 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 20:23:13,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 20:23:13,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 20:23:13,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 20:23:13,438 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 20:23:13,439 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 20:23:13,440 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2023-08-30 20:23:14,637 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 20:23:14,829 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 20:23:14,829 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2023-08-30 20:23:14,835 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7042163/7112d2e59b6f41eaaad39092c041fdcd/FLAG9fb1356a8 [2023-08-30 20:23:14,848 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7042163/7112d2e59b6f41eaaad39092c041fdcd [2023-08-30 20:23:14,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 20:23:14,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 20:23:14,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 20:23:14,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 20:23:14,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 20:23:14,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:23:14" (1/1) ... [2023-08-30 20:23:14,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f89ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:14, skipping insertion in model container [2023-08-30 20:23:14,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:23:14" (1/1) ... [2023-08-30 20:23:14,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 20:23:14,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 20:23:15,016 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c[3424,3437] [2023-08-30 20:23:15,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:23:15,032 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 20:23:15,053 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c[3424,3437] [2023-08-30 20:23:15,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:23:15,062 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:23:15,063 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:23:15,069 INFO L208 MainTranslator]: Completed translation [2023-08-30 20:23:15,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15 WrapperNode [2023-08-30 20:23:15,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 20:23:15,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 20:23:15,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 20:23:15,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 20:23:15,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,132 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 252 [2023-08-30 20:23:15,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 20:23:15,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 20:23:15,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 20:23:15,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 20:23:15,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,187 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,189 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 20:23:15,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 20:23:15,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 20:23:15,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 20:23:15,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (1/1) ... [2023-08-30 20:23:15,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:23:15,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:23:15,229 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 20:23:15,266 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 20:23:15,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 20:23:15,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 20:23:15,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 20:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 20:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 20:23:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 20:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 20:23:15,330 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 20:23:15,330 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 20:23:15,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 20:23:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 20:23:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 20:23:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 20:23:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 20:23:15,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 20:23:15,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 20:23:15,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 20:23:15,333 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 20:23:15,483 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 20:23:15,484 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 20:23:15,804 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 20:23:16,025 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 20:23:16,026 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-30 20:23:16,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:23:16 BoogieIcfgContainer [2023-08-30 20:23:16,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 20:23:16,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 20:23:16,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 20:23:16,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 20:23:16,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:23:14" (1/3) ... [2023-08-30 20:23:16,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559e3f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:23:16, skipping insertion in model container [2023-08-30 20:23:16,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:23:15" (2/3) ... [2023-08-30 20:23:16,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559e3f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:23:16, skipping insertion in model container [2023-08-30 20:23:16,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:23:16" (3/3) ... [2023-08-30 20:23:16,037 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2023-08-30 20:23:16,045 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 20:23:16,053 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 20:23:16,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 20:23:16,054 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 20:23:16,146 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 20:23:16,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 201 transitions, 426 flow [2023-08-30 20:23:16,288 INFO L130 PetriNetUnfolder]: 18/198 cut-off events. [2023-08-30 20:23:16,289 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:23:16,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 18/198 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 116 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2023-08-30 20:23:16,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 201 transitions, 426 flow [2023-08-30 20:23:16,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 180 places, 188 transitions, 394 flow [2023-08-30 20:23:16,311 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 20:23:16,319 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 188 transitions, 394 flow [2023-08-30 20:23:16,321 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 180 places, 188 transitions, 394 flow [2023-08-30 20:23:16,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 188 transitions, 394 flow [2023-08-30 20:23:16,356 INFO L130 PetriNetUnfolder]: 18/188 cut-off events. [2023-08-30 20:23:16,356 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:23:16,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 18/188 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 162. Up to 3 conditions per place. [2023-08-30 20:23:16,359 INFO L119 LiptonReduction]: Number of co-enabled transitions 1456 [2023-08-30 20:23:22,642 INFO L134 LiptonReduction]: Checked pairs total: 2169 [2023-08-30 20:23:22,642 INFO L136 LiptonReduction]: Total number of compositions: 199 [2023-08-30 20:23:22,654 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 20:23:22,660 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;@8185846, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 20:23:22,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 20:23:22,666 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2023-08-30 20:23:22,666 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:23:22,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:23:22,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:23:22,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:23:22,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:23:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1991589664, now seen corresponding path program 1 times [2023-08-30 20:23:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:23:22,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176295269] [2023-08-30 20:23:22,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:23:22,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:23:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:23:22,895 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 20:23:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:23:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176295269] [2023-08-30 20:23:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176295269] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:23:22,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:23:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 20:23:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444170049] [2023-08-30 20:23:22,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:23:22,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 20:23:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:23:22,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 20:23:22,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 20:23:22,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 400 [2023-08-30 20:23:22,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:22,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:23:22,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 400 [2023-08-30 20:23:22,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:23:23,099 INFO L130 PetriNetUnfolder]: 321/458 cut-off events. [2023-08-30 20:23:23,099 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2023-08-30 20:23:23,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 458 events. 321/458 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1470 event pairs, 166 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 732. Up to 449 conditions per place. [2023-08-30 20:23:23,108 INFO L137 encePairwiseOnDemand]: 399/400 looper letters, 24 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-30 20:23:23,109 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 120 flow [2023-08-30 20:23:23,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 20:23:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 20:23:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 377 transitions. [2023-08-30 20:23:23,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47125 [2023-08-30 20:23:23,129 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 377 transitions. [2023-08-30 20:23:23,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 377 transitions. [2023-08-30 20:23:23,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:23:23,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 377 transitions. [2023-08-30 20:23:23,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.5) internal successors, (377), 2 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 400.0) internal successors, (1200), 3 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,145 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 400.0) internal successors, (1200), 3 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,147 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 2 states and 377 transitions. [2023-08-30 20:23:23,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 120 flow [2023-08-30 20:23:23,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 20:23:23,153 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 60 flow [2023-08-30 20:23:23,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-08-30 20:23:23,158 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-08-30 20:23:23,160 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 60 flow [2023-08-30 20:23:23,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 185.0) internal successors, (370), 2 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:23:23,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:23:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 20:23:23,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:23:23,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:23:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1850484059, now seen corresponding path program 1 times [2023-08-30 20:23:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:23:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785678905] [2023-08-30 20:23:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:23:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:23:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:23:23,477 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 20:23:23,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:23:23,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785678905] [2023-08-30 20:23:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785678905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:23:23,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:23:23,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:23:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590080603] [2023-08-30 20:23:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:23:23,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:23:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:23:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:23:23,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:23:23,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 400 [2023-08-30 20:23:23,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:23:23,544 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 400 [2023-08-30 20:23:23,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:23:23,659 INFO L130 PetriNetUnfolder]: 326/478 cut-off events. [2023-08-30 20:23:23,659 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 20:23:23,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 478 events. 326/478 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1521 event pairs, 167 based on Foata normal form. 16/336 useless extension candidates. Maximal degree in co-relation 962. Up to 449 conditions per place. [2023-08-30 20:23:23,661 INFO L137 encePairwiseOnDemand]: 394/400 looper letters, 23 selfloop transitions, 2 changer transitions 11/39 dead transitions. [2023-08-30 20:23:23,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 159 flow [2023-08-30 20:23:23,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:23:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:23:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2023-08-30 20:23:23,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.439375 [2023-08-30 20:23:23,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 703 transitions. [2023-08-30 20:23:23,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 703 transitions. [2023-08-30 20:23:23,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:23:23,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 703 transitions. [2023-08-30 20:23:23,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 400.0) internal successors, (2000), 5 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,671 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 60 flow. Second operand 4 states and 703 transitions. [2023-08-30 20:23:23,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 159 flow [2023-08-30 20:23:23,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 159 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 20:23:23,673 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 78 flow [2023-08-30 20:23:23,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2023-08-30 20:23:23,674 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-08-30 20:23:23,674 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 28 transitions, 78 flow [2023-08-30 20:23:23,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:23:23,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:23:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 20:23:23,675 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:23:23,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:23:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1330974784, now seen corresponding path program 1 times [2023-08-30 20:23:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:23:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664226543] [2023-08-30 20:23:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:23:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:23:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:23:23,808 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 20:23:23,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:23:23,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664226543] [2023-08-30 20:23:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664226543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:23:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:23:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 20:23:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327638608] [2023-08-30 20:23:23,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:23:23,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:23:23,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:23:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:23:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:23:23,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 400 [2023-08-30 20:23:23,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:23,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:23:23,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 400 [2023-08-30 20:23:23,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:23:24,013 INFO L130 PetriNetUnfolder]: 368/551 cut-off events. [2023-08-30 20:23:24,013 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2023-08-30 20:23:24,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 551 events. 368/551 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1947 event pairs, 194 based on Foata normal form. 24/403 useless extension candidates. Maximal degree in co-relation 1341. Up to 447 conditions per place. [2023-08-30 20:23:24,016 INFO L137 encePairwiseOnDemand]: 392/400 looper letters, 23 selfloop transitions, 3 changer transitions 12/41 dead transitions. [2023-08-30 20:23:24,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 190 flow [2023-08-30 20:23:24,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:23:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:23:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 871 transitions. [2023-08-30 20:23:24,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4355 [2023-08-30 20:23:24,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 871 transitions. [2023-08-30 20:23:24,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 871 transitions. [2023-08-30 20:23:24,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:23:24,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 871 transitions. [2023-08-30 20:23:24,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,026 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,026 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 78 flow. Second operand 5 states and 871 transitions. [2023-08-30 20:23:24,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 190 flow [2023-08-30 20:23:24,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 186 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 20:23:24,029 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 96 flow [2023-08-30 20:23:24,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2023-08-30 20:23:24,030 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-08-30 20:23:24,033 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 96 flow [2023-08-30 20:23:24,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:23:24,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:23:24,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 20:23:24,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:23:24,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:23:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash 80366818, now seen corresponding path program 1 times [2023-08-30 20:23:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:23:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945581683] [2023-08-30 20:23:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:23:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:23:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:23:24,244 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 20:23:24,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:23:24,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945581683] [2023-08-30 20:23:24,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945581683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:23:24,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:23:24,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 20:23:24,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699934915] [2023-08-30 20:23:24,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:23:24,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 20:23:24,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:23:24,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 20:23:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 20:23:24,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 400 [2023-08-30 20:23:24,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:23:24,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 400 [2023-08-30 20:23:24,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:23:24,352 INFO L130 PetriNetUnfolder]: 340/486 cut-off events. [2023-08-30 20:23:24,352 INFO L131 PetriNetUnfolder]: For 145/169 co-relation queries the response was YES. [2023-08-30 20:23:24,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 486 events. 340/486 cut-off events. For 145/169 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1458 event pairs, 48 based on Foata normal form. 10/329 useless extension candidates. Maximal degree in co-relation 1360. Up to 390 conditions per place. [2023-08-30 20:23:24,355 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 33 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-08-30 20:23:24,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 200 flow [2023-08-30 20:23:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 20:23:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 20:23:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-08-30 20:23:24,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2023-08-30 20:23:24,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-08-30 20:23:24,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-08-30 20:23:24,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:23:24,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-08-30 20:23:24,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,362 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 96 flow. Second operand 3 states and 552 transitions. [2023-08-30 20:23:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 200 flow [2023-08-30 20:23:24,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 194 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 20:23:24,364 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 115 flow [2023-08-30 20:23:24,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-08-30 20:23:24,365 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-08-30 20:23:24,365 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 115 flow [2023-08-30 20:23:24,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:24,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:23:24,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:23:24,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 20:23:24,366 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:23:24,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:23:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1541808918, now seen corresponding path program 2 times [2023-08-30 20:23:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:23:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137025640] [2023-08-30 20:23:24,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:23:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:23:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:23:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:23:26,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:23:26,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137025640] [2023-08-30 20:23:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137025640] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:23:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336387523] [2023-08-30 20:23:26,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:23:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:23:26,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:23:26,277 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 20:23:26,297 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 20:23:26,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 20:23:26,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:23:26,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 20:23:26,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:23:26,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:26,758 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 18 treesize of output 20 [2023-08-30 20:23:26,980 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 20:23:26,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 20:23:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336387523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:23:26,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 20:23:26,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 18 [2023-08-30 20:23:26,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332889745] [2023-08-30 20:23:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:23:26,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 20:23:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:23:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 20:23:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2023-08-30 20:23:27,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 400 [2023-08-30 20:23:27,309 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 115 flow. Second operand has 9 states, 9 states have (on average 150.44444444444446) internal successors, (1354), 9 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:27,309 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:23:27,309 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 400 [2023-08-30 20:23:27,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:23:27,588 INFO L130 PetriNetUnfolder]: 282/446 cut-off events. [2023-08-30 20:23:27,588 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2023-08-30 20:23:27,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 446 events. 282/446 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1383 event pairs, 57 based on Foata normal form. 5/330 useless extension candidates. Maximal degree in co-relation 1388. Up to 360 conditions per place. [2023-08-30 20:23:27,591 INFO L137 encePairwiseOnDemand]: 389/400 looper letters, 36 selfloop transitions, 8 changer transitions 22/68 dead transitions. [2023-08-30 20:23:27,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 68 transitions, 349 flow [2023-08-30 20:23:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:23:27,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:23:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1250 transitions. [2023-08-30 20:23:27,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2023-08-30 20:23:27,594 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1250 transitions. [2023-08-30 20:23:27,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1250 transitions. [2023-08-30 20:23:27,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:23:27,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1250 transitions. [2023-08-30 20:23:27,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.25) internal successors, (1250), 8 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:27,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:27,604 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:27,604 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 115 flow. Second operand 8 states and 1250 transitions. [2023-08-30 20:23:27,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 68 transitions, 349 flow [2023-08-30 20:23:27,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 329 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 20:23:27,609 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 168 flow [2023-08-30 20:23:27,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=168, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-30 20:23:27,610 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-08-30 20:23:27,611 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 168 flow [2023-08-30 20:23:27,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 150.44444444444446) internal successors, (1354), 9 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:27,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:23:27,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:23:27,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 20:23:27,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:23:27,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:23:27,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:23:27,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1719258706, now seen corresponding path program 3 times [2023-08-30 20:23:27,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:23:27,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320095961] [2023-08-30 20:23:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:23:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:23:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:23:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:23:29,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:23:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320095961] [2023-08-30 20:23:29,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320095961] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:23:29,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634721343] [2023-08-30 20:23:29,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:23:29,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:23:29,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:23:29,529 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 20:23:29,552 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 20:23:29,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 20:23:29,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:23:29,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-30 20:23:29,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:23:29,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:29,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 18 treesize of output 20 [2023-08-30 20:23:30,175 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 20:23:30,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 20:23:30,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634721343] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:23:30,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 20:23:30,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2023-08-30 20:23:30,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336077404] [2023-08-30 20:23:30,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:23:30,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 20:23:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:23:30,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 20:23:30,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-08-30 20:23:30,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 400 [2023-08-30 20:23:30,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 168 flow. Second operand has 9 states, 9 states have (on average 150.44444444444446) internal successors, (1354), 9 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:30,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:23:30,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 400 [2023-08-30 20:23:30,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:23:30,758 INFO L130 PetriNetUnfolder]: 297/503 cut-off events. [2023-08-30 20:23:30,758 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2023-08-30 20:23:30,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1735 conditions, 503 events. 297/503 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1833 event pairs, 61 based on Foata normal form. 1/394 useless extension candidates. Maximal degree in co-relation 1722. Up to 380 conditions per place. [2023-08-30 20:23:30,762 INFO L137 encePairwiseOnDemand]: 388/400 looper letters, 39 selfloop transitions, 8 changer transitions 25/74 dead transitions. [2023-08-30 20:23:30,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 439 flow [2023-08-30 20:23:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:23:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:23:30,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1249 transitions. [2023-08-30 20:23:30,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903125 [2023-08-30 20:23:30,767 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1249 transitions. [2023-08-30 20:23:30,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1249 transitions. [2023-08-30 20:23:30,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:23:30,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1249 transitions. [2023-08-30 20:23:30,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.125) internal successors, (1249), 8 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:30,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:30,775 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:30,775 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 168 flow. Second operand 8 states and 1249 transitions. [2023-08-30 20:23:30,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 439 flow [2023-08-30 20:23:30,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 421 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-30 20:23:30,780 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 219 flow [2023-08-30 20:23:30,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=219, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-30 20:23:30,782 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2023-08-30 20:23:30,782 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 219 flow [2023-08-30 20:23:30,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 150.44444444444446) internal successors, (1354), 9 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:30,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:23:30,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:23:30,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 20:23:30,989 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,SelfDestructingSolverStorable5 [2023-08-30 20:23:30,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:23:30,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:23:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1871079068, now seen corresponding path program 4 times [2023-08-30 20:23:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:23:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143294393] [2023-08-30 20:23:30,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:23:30,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:23:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:23:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:23:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:23:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143294393] [2023-08-30 20:23:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143294393] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:23:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95879567] [2023-08-30 20:23:32,718 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 20:23:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:23:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:23:32,721 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 20:23:32,747 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 20:23:32,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 20:23:32,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:23:32,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 81 conjunts are in the unsatisfiable core [2023-08-30 20:23:32,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:23:32,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:32,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:32,900 INFO L321 Elim1Store]: treesize reduction 47, result has 36.5 percent of original size [2023-08-30 20:23:32,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 32 [2023-08-30 20:23:32,978 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 15 treesize of output 11 [2023-08-30 20:23:33,073 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-30 20:23:33,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 20:23:33,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-30 20:23:33,247 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 6 treesize of output 5 [2023-08-30 20:23:33,330 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 6 treesize of output 5 [2023-08-30 20:23:33,830 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-30 20:23:33,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 53 [2023-08-30 20:23:33,852 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-30 20:23:33,852 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 36 treesize of output 21 [2023-08-30 20:23:34,151 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:23:34,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:34,154 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 21 treesize of output 12 [2023-08-30 20:23:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:23:34,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:23:34,365 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (let ((.cse0 (* c_~t~0 2)) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse1)) 1) c_~s~0)) (forall ((v_ArrVal_262 (Array Int Int))) (<= c_~s~0 (+ .cse0 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse1)))))))) is different from false [2023-08-30 20:23:46,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:46,720 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 165 treesize of output 117 [2023-08-30 20:23:46,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:46,754 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 3894 treesize of output 3822 [2023-08-30 20:23:46,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:46,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:46,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1172 treesize of output 992 [2023-08-30 20:23:47,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:47,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:47,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 956 treesize of output 884 [2023-08-30 20:23:47,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:47,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:47,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 848 treesize of output 806 [2023-08-30 20:23:47,136 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 98 treesize of output 82 [2023-08-30 20:23:52,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:52,496 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 164 treesize of output 116 [2023-08-30 20:23:52,505 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:23:52,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:52,520 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 4442 treesize of output 4290 [2023-08-30 20:23:52,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:52,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:52,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 995 treesize of output 927 [2023-08-30 20:23:52,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:52,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:52,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 904 treesize of output 866 [2023-08-30 20:23:52,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:23:52,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:23:52,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 870 treesize of output 698 [2023-08-30 20:23:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:23:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95879567] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:23:58,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:23:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2023-08-30 20:23:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206603234] [2023-08-30 20:23:58,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:23:58,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-30 20:23:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:23:58,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-30 20:23:58,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=940, Unknown=18, NotChecked=62, Total=1122 [2023-08-30 20:23:59,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 400 [2023-08-30 20:23:59,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 219 flow. Second operand has 34 states, 34 states have (on average 103.73529411764706) internal successors, (3527), 34 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:23:59,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:23:59,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 400 [2023-08-30 20:23:59,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:24:35,060 WARN L222 SmtUtils]: Spent 35.56s on a formula simplification. DAG size of input: 191 DAG size of output: 180 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:24:41,746 WARN L222 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 110 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:24:48,356 WARN L222 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 138 DAG size of output: 134 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:25:08,584 WARN L222 SmtUtils]: Spent 17.42s on a formula simplification. DAG size of input: 290 DAG size of output: 247 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:25:26,714 WARN L222 SmtUtils]: Spent 15.84s on a formula simplification that was a NOOP. DAG size: 218 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:26:01,741 WARN L222 SmtUtils]: Spent 32.24s on a formula simplification. DAG size of input: 277 DAG size of output: 241 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:26:05,951 WARN L539 Checker$ProtectedHtc]: 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 20:26:08,424 WARN L539 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 20:26:33,488 WARN L222 SmtUtils]: Spent 20.61s on a formula simplification. DAG size of input: 283 DAG size of output: 275 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:27:04,022 WARN L222 SmtUtils]: Spent 24.47s on a formula simplification. DAG size of input: 278 DAG size of output: 239 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:27:33,367 WARN L222 SmtUtils]: Spent 23.67s on a formula simplification. DAG size of input: 289 DAG size of output: 231 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:27:35,604 WARN L539 Checker$ProtectedHtc]: 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 20:27:37,655 WARN L539 Checker$ProtectedHtc]: 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 20:27:39,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:27:39,873 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (< c_~q2_front~0 0)) (.cse0 (* c_~t~0 2))) (and (or (< 0 c_~q2_front~0) (< c_~q2_back~0 0) (< 0 c_~q2_back~0) (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse2 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_104| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_104|) 0)))) (.cse1 (< c_~n1~0 1))) (and (or (<= c_~s~0 .cse0) .cse1 .cse2) (or .cse2 (and (< c_~n1~0 2) (or .cse1 (< .cse0 (+ c_~s~0 1))))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 0)) .cse1))) .cse3) (or (<= c_~n2~0 c_~q2_front~0) .cse3 (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse4)) 1) c_~s~0)) (forall ((v_ArrVal_262 (Array Int Int))) (<= c_~s~0 (+ .cse0 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse4)))))))))) is different from false [2023-08-30 20:28:00,787 WARN L222 SmtUtils]: Spent 16.37s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:28:09,140 WARN L539 Checker$ProtectedHtc]: 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 20:28:54,555 WARN L222 SmtUtils]: Spent 34.54s on a formula simplification. DAG size of input: 282 DAG size of output: 223 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:28:54,918 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse37 (* c_~q2_back~0 4))) (let ((.cse33 (select |c_#memory_int| c_~q2~0.base)) (.cse28 (+ .cse37 c_~q2~0.offset))) (let ((.cse35 (select .cse33 .cse28)) (.cse36 (* c_~q2_front~0 4))) (let ((.cse8 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse14 (+ .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse15 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (< c_~q2_back~0 0)) (.cse5 (<= c_~n2~0 c_~q2_back~0)) (.cse4 (+ .cse35 1)) (.cse6 (<= c_~n2~0 c_~q2_front~0)) (.cse1 (* c_~t~0 2)) (.cse2 (+ c_~q2~0.offset .cse36)) (.cse7 (< c_~q2_front~0 0))) (and (or (let ((.cse0 (+ c_~s~0 |c_thread2Thread1of1ForFork1_~j~0#1|))) (and (forall ((v_ArrVal_262 (Array Int Int))) (<= .cse0 (+ .cse1 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2))))) (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse1 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2)) 1) .cse0)))) .cse3 (not (= |c_thread2Thread1of1ForFork1_~j~0#1| .cse4)) .cse5 .cse6 .cse7) (or (< 0 c_~q2_front~0) .cse3 (< 0 c_~q2_back~0) .cse8 (let ((.cse10 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_104| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_104|) 0)))) (.cse9 (< c_~n1~0 1))) (and (or (<= c_~s~0 .cse1) .cse9 .cse10) (or .cse10 (and (< c_~n1~0 2) (or .cse9 (< .cse1 (+ c_~s~0 1))))) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 0)) .cse9))) .cse7) (or .cse3 .cse5 .cse8 .cse6 .cse7 (and (forall ((v_ArrVal_259 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_260 (Array Int Int))) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (forall ((~q1_back~0 Int)) (or (<= c_~n1~0 ~q1_back~0) (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261))) (let ((.cse11 (select .cse13 c_~q1~0.base)) (.cse12 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15))) (or (not (= (select .cse11 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (not (= (select .cse11 (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ .cse12 1))) (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse1 (* 2 (select (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14))) (+ c_~s~0 .cse12))))))) (< ~q1_back~0 0))))) (forall ((v_ArrVal_259 (Array Int Int)) (~q1_front~0 Int) (v_ArrVal_260 (Array Int Int))) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (forall ((~q1_back~0 Int)) (or (<= c_~n1~0 ~q1_back~0) (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261))) (let ((.cse18 (select .cse17 c_~q1~0.base)) (.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15))) (or (forall ((v_ArrVal_262 (Array Int Int))) (<= (+ c_~s~0 .cse16) (+ .cse1 (* 2 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14)) 1))) (not (= (select .cse18 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (not (= (select .cse18 (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ .cse16 1))))))) (< ~q1_back~0 0))))))) (or .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((~q1_front~0 Int) (v_ArrVal_260 (Array Int Int))) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (forall ((~q1_back~0 Int)) (or (<= c_~n1~0 ~q1_back~0) (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261))) (let ((.cse19 (select .cse21 c_~q1~0.base)) (.cse20 (select (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15))) (or (not (= (select .cse19 (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ .cse20 1))) (not (= (select .cse19 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse1 (* (select (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) 2)) (+ c_~s~0 .cse20))))))) (< ~q1_back~0 0))))) (forall ((~q1_front~0 Int) (v_ArrVal_260 (Array Int Int))) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (forall ((~q1_back~0 Int)) (or (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse15)) (.cse24 (select .cse23 c_~q1~0.base))) (or (forall ((v_ArrVal_262 (Array Int Int))) (<= (+ c_~s~0 .cse22) (+ .cse1 (* (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse14) 2) 1))) (not (= (select .cse24 (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ .cse22 1))) (not (= (select .cse24 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)))))) (<= c_~n1~0 ~q1_back~0) (< ~q1_back~0 0)))))) .cse5 .cse6 .cse7) (= c_~s~0 0) (or .cse3 (and (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (forall ((~q1_back~0 Int)) (or (<= c_~n1~0 ~q1_back~0) (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261))) (let ((.cse25 (select .cse27 c_~q1~0.base)) (.cse26 (select (select .cse27 c_~q2~0.base) .cse28))) (or (not (= (select .cse25 (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ 1 .cse26))) (not (= (select .cse25 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)) (forall ((v_ArrVal_262 (Array Int Int))) (<= (+ c_~s~0 .cse26) (+ .cse1 (* 2 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2)) 1))))))) (< ~q1_back~0 0))) (<= c_~n1~0 ~q1_front~0))) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (forall ((~q1_back~0 Int)) (or (<= c_~n1~0 ~q1_back~0) (forall ((v_ArrVal_261 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_261))) (let ((.cse30 (select (select .cse31 c_~q2~0.base) .cse28)) (.cse29 (select .cse31 c_~q1~0.base))) (or (not (= (select .cse29 (+ c_~q1~0.offset (* ~q1_front~0 4))) (+ 1 .cse30))) (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse1 (* 2 (select (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2))) (+ c_~s~0 .cse30))) (not (= (select .cse29 (+ (* ~q1_back~0 4) c_~q1~0.offset)) 0)))))) (< ~q1_back~0 0))) (<= c_~n1~0 ~q1_front~0)))) .cse5 .cse6 .cse7) (= (+ c_~t~0 1) 0) (or (let ((.cse32 (* (select .cse33 .cse2) 2))) (and (< (+ .cse1 .cse32 1) c_~s~0) (<= c_~s~0 (+ .cse1 .cse32 2)))) .cse6 .cse7) (or .cse3 .cse5 (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (<= c_~n1~0 ~q1_front~0) (not (= (select (select |c_#memory_int| c_~q1~0.base) (+ c_~q1~0.offset (* ~q1_front~0 4))) .cse4)))) .cse6 (let ((.cse34 (+ c_~s~0 .cse35))) (and (forall ((v_ArrVal_262 (Array Int Int))) (< (+ .cse1 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2))) .cse34)) (forall ((v_ArrVal_262 (Array Int Int))) (<= .cse34 (+ .cse1 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_262) c_~q2~0.base) .cse2)) 1))))) .cse7)))))) is different from false [2023-08-30 20:28:57,507 WARN L539 Checker$ProtectedHtc]: 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 20:28:59,512 WARN L539 Checker$ProtectedHtc]: 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 20:29:02,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:04,144 WARN L539 Checker$ProtectedHtc]: 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 20:29:06,490 WARN L539 Checker$ProtectedHtc]: 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 20:29:08,493 WARN L539 Checker$ProtectedHtc]: 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 20:29:10,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:12,838 WARN L539 Checker$ProtectedHtc]: 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 20:29:14,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:21,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:29:24,497 INFO L130 PetriNetUnfolder]: 900/1541 cut-off events. [2023-08-30 20:29:24,497 INFO L131 PetriNetUnfolder]: For 2559/2561 co-relation queries the response was YES. [2023-08-30 20:29:24,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5819 conditions, 1541 events. 900/1541 cut-off events. For 2559/2561 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7525 event pairs, 62 based on Foata normal form. 2/1181 useless extension candidates. Maximal degree in co-relation 5803. Up to 599 conditions per place. [2023-08-30 20:29:24,510 INFO L137 encePairwiseOnDemand]: 378/400 looper letters, 144 selfloop transitions, 81 changer transitions 93/320 dead transitions. [2023-08-30 20:29:24,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 320 transitions, 2083 flow [2023-08-30 20:29:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-30 20:29:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-30 20:29:24,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 4703 transitions. [2023-08-30 20:29:24,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27343023255813953 [2023-08-30 20:29:24,526 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 4703 transitions. [2023-08-30 20:29:24,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 4703 transitions. [2023-08-30 20:29:24,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:29:24,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 4703 transitions. [2023-08-30 20:29:24,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 109.37209302325581) internal successors, (4703), 43 states have internal predecessors, (4703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:29:24,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 400.0) internal successors, (17600), 44 states have internal predecessors, (17600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:29:24,564 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 400.0) internal successors, (17600), 44 states have internal predecessors, (17600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:29:24,564 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 219 flow. Second operand 43 states and 4703 transitions. [2023-08-30 20:29:24,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 320 transitions, 2083 flow [2023-08-30 20:29:24,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 320 transitions, 1939 flow, removed 64 selfloop flow, removed 5 redundant places. [2023-08-30 20:29:24,576 INFO L231 Difference]: Finished difference. Result has 111 places, 116 transitions, 956 flow [2023-08-30 20:29:24,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=956, PETRI_PLACES=111, PETRI_TRANSITIONS=116} [2023-08-30 20:29:24,577 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2023-08-30 20:29:24,577 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 116 transitions, 956 flow [2023-08-30 20:29:24,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 103.73529411764706) internal successors, (3527), 34 states have internal predecessors, (3527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:29:24,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:29:24,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:29:24,591 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 20:29:24,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:29:24,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:29:24,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:29:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1334848054, now seen corresponding path program 5 times [2023-08-30 20:29:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:29:24,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726085965] [2023-08-30 20:29:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:29:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:29:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:29:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:29:26,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:29:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726085965] [2023-08-30 20:29:26,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726085965] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:29:26,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372118558] [2023-08-30 20:29:26,633 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 20:29:26,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:29:26,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:29:26,637 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 20:29:26,641 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 20:29:26,752 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:29:26,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:29:26,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-30 20:29:26,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:29:27,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:29:27,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 20:29:27,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:29:27,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 20:29:27,766 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-30 20:29:27,770 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-30 20:29:27,771 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 30 treesize of output 16 [2023-08-30 20:29:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:29:27,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:29:28,199 WARN L839 $PredicateComparison]: unable to prove that (or (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (let ((.cse4 (* c_~t~0 2)) (.cse6 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((v_ArrVal_316 (Array Int Int)) (~q2~0.base Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_316))) (let ((.cse5 (select .cse1 ~q2~0.base))) (let ((.cse3 (select .cse5 .cse7))) (let ((.cse0 (+ .cse3 1))) (or (< .cse0 (select (select .cse1 c_~q1~0.base) .cse2)) (< 0 .cse0) (<= (+ c_~s~0 .cse3) (+ .cse4 (* 2 (select .cse5 .cse6)) 1)))))))) (forall ((v_ArrVal_316 (Array Int Int)) (~q2~0.base Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_316))) (let ((.cse8 (select .cse11 ~q2~0.base))) (let ((.cse9 (select .cse8 .cse7))) (let ((.cse10 (+ .cse9 1))) (or (< (+ .cse4 (* 2 (select .cse8 .cse6))) (+ c_~s~0 .cse9)) (< .cse10 (select (select .cse11 c_~q1~0.base) .cse2)) (< 0 .cse10)))))))))) is different from false [2023-08-30 20:29:28,277 WARN L839 $PredicateComparison]: unable to prove that (or (< c_~q2_back~0 0) (<= c_~n2~0 c_~q2_back~0) (let ((.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse3 (* c_~t~0 2)) (.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int)) (~q2~0.base Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_316))) (let ((.cse4 (select .cse1 ~q2~0.base))) (let ((.cse6 (select .cse4 .cse7))) (let ((.cse0 (+ .cse6 1))) (or (< 0 .cse0) (< .cse0 (select (select .cse1 c_~q1~0.base) .cse2)) (< (+ .cse3 (* 2 (select .cse4 .cse5))) (+ c_~s~0 .cse6)))))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int)) (~q2~0.base Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_316))) (let ((.cse11 (select .cse9 ~q2~0.base))) (let ((.cse10 (select .cse11 .cse7))) (let ((.cse8 (+ .cse10 1))) (or (< 0 .cse8) (< .cse8 (select (select .cse9 c_~q1~0.base) .cse2)) (<= (+ c_~s~0 .cse10) (+ .cse3 (* 2 (select .cse11 .cse5)) 1))))))))))) is different from false [2023-08-30 20:29:28,561 INFO L321 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-30 20:29:28,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1742 treesize of output 1686 [2023-08-30 20:29:28,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:29:28,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1105 treesize of output 1014 [2023-08-30 20:29:28,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:29:28,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 973 treesize of output 948 [2023-08-30 20:29:28,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:29:28,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 907 treesize of output 816 [2023-08-30 20:29:28,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:29:28,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 775 treesize of output 750 [2023-08-30 20:33:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:33:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372118558] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:33:02,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:33:02,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 31 [2023-08-30 20:33:02,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508590885] [2023-08-30 20:33:02,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:33:02,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-30 20:33:02,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:33:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-30 20:33:02,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=827, Unknown=2, NotChecked=118, Total=1056 [2023-08-30 20:33:03,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 400 [2023-08-30 20:33:03,042 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 116 transitions, 956 flow. Second operand has 33 states, 33 states have (on average 110.93939393939394) internal successors, (3661), 33 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:03,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:33:03,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 400 [2023-08-30 20:33:03,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:33:04,342 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~q2_back~0 0)) (.cse1 (<= c_~n2~0 c_~q2_back~0)) (.cse5 (* c_~t~0 2)) (.cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (or .cse0 .cse1 (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int)) (~q2~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_316))) (let ((.cse6 (select .cse3 ~q2~0.base))) (let ((.cse8 (select .cse6 .cse9))) (let ((.cse2 (+ .cse8 1))) (or (< 0 .cse2) (< .cse2 (select (select .cse3 c_~q1~0.base) .cse4)) (< (+ .cse5 (* 2 (select .cse6 .cse7))) (+ c_~s~0 .cse8)))))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int)) (~q2~0.base Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_316))) (let ((.cse13 (select .cse11 ~q2~0.base))) (let ((.cse12 (select .cse13 .cse9))) (let ((.cse10 (+ .cse12 1))) (or (< 0 .cse10) (< .cse10 (select (select .cse11 c_~q1~0.base) .cse4)) (<= (+ c_~s~0 .cse12) (+ .cse5 (* 2 (select .cse13 .cse7)) 1)))))))))) (or .cse0 .cse1 (let ((.cse15 (select (select |c_#memory_int| c_~q1~0.base) .cse4))) (and (forall ((~q2~0.base Int)) (let ((.cse17 (select |c_#memory_int| ~q2~0.base))) (let ((.cse16 (select .cse17 .cse9))) (let ((.cse14 (+ .cse16 1))) (or (< 0 .cse14) (< .cse14 .cse15) (<= (+ c_~s~0 .cse16) (+ .cse5 (* 2 (select .cse17 .cse7)) 1))))))) (forall ((~q2~0.base Int)) (let ((.cse18 (select |c_#memory_int| ~q2~0.base))) (let ((.cse19 (select .cse18 .cse9))) (let ((.cse20 (+ .cse19 1))) (or (< (+ .cse5 (* 2 (select .cse18 .cse7))) (+ c_~s~0 .cse19)) (< 0 .cse20) (< .cse20 .cse15))))))))))) is different from false [2023-08-30 20:33:09,493 INFO L130 PetriNetUnfolder]: 1943/3087 cut-off events. [2023-08-30 20:33:09,493 INFO L131 PetriNetUnfolder]: For 20995/20997 co-relation queries the response was YES. [2023-08-30 20:33:09,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18341 conditions, 3087 events. 1943/3087 cut-off events. For 20995/20997 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15630 event pairs, 66 based on Foata normal form. 4/2578 useless extension candidates. Maximal degree in co-relation 18305. Up to 1167 conditions per place. [2023-08-30 20:33:09,524 INFO L137 encePairwiseOnDemand]: 380/400 looper letters, 229 selfloop transitions, 185 changer transitions 54/470 dead transitions. [2023-08-30 20:33:09,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 470 transitions, 5764 flow [2023-08-30 20:33:09,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-30 20:33:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-30 20:33:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4924 transitions. [2023-08-30 20:33:09,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2930952380952381 [2023-08-30 20:33:09,536 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4924 transitions. [2023-08-30 20:33:09,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4924 transitions. [2023-08-30 20:33:09,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:33:09,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4924 transitions. [2023-08-30 20:33:09,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 117.23809523809524) internal successors, (4924), 42 states have internal predecessors, (4924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:09,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 400.0) internal successors, (17200), 43 states have internal predecessors, (17200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:09,570 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 400.0) internal successors, (17200), 43 states have internal predecessors, (17200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:09,570 INFO L175 Difference]: Start difference. First operand has 111 places, 116 transitions, 956 flow. Second operand 42 states and 4924 transitions. [2023-08-30 20:33:09,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 470 transitions, 5764 flow [2023-08-30 20:33:09,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 470 transitions, 4377 flow, removed 685 selfloop flow, removed 10 redundant places. [2023-08-30 20:33:09,627 INFO L231 Difference]: Finished difference. Result has 150 places, 288 transitions, 2978 flow [2023-08-30 20:33:09,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2978, PETRI_PLACES=150, PETRI_TRANSITIONS=288} [2023-08-30 20:33:09,630 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 118 predicate places. [2023-08-30 20:33:09,630 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 288 transitions, 2978 flow [2023-08-30 20:33:09,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 110.93939393939394) internal successors, (3661), 33 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:09,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:33:09,637 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:33:09,647 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 20:33:09,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:33:09,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:33:09,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:33:09,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1562981495, now seen corresponding path program 6 times [2023-08-30 20:33:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:33:09,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761272506] [2023-08-30 20:33:09,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:33:09,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:33:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:33:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:33:12,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:33:12,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761272506] [2023-08-30 20:33:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761272506] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:33:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568802159] [2023-08-30 20:33:12,881 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 20:33:12,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:33:12,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:33:12,882 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 20:33:12,883 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 20:33:13,024 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 20:33:13,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:33:13,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-30 20:33:13,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:33:13,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:33:13,348 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-30 20:33:13,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2023-08-30 20:33:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 20:33:13,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 20:33:13,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568802159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:33:13,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-30 20:33:13,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 20 [2023-08-30 20:33:13,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167446706] [2023-08-30 20:33:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:33:13,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 20:33:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:33:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 20:33:13,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2023-08-30 20:33:13,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 400 [2023-08-30 20:33:13,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 288 transitions, 2978 flow. Second operand has 10 states, 10 states have (on average 150.2) internal successors, (1502), 10 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:13,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:33:13,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 400 [2023-08-30 20:33:13,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:33:14,612 INFO L130 PetriNetUnfolder]: 1814/2879 cut-off events. [2023-08-30 20:33:14,612 INFO L131 PetriNetUnfolder]: For 20407/20407 co-relation queries the response was YES. [2023-08-30 20:33:14,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17973 conditions, 2879 events. 1814/2879 cut-off events. For 20407/20407 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14349 event pairs, 240 based on Foata normal form. 1/2618 useless extension candidates. Maximal degree in co-relation 17923. Up to 2658 conditions per place. [2023-08-30 20:33:14,644 INFO L137 encePairwiseOnDemand]: 390/400 looper letters, 275 selfloop transitions, 8 changer transitions 39/324 dead transitions. [2023-08-30 20:33:14,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 324 transitions, 3944 flow [2023-08-30 20:33:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 20:33:14,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 20:33:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1253 transitions. [2023-08-30 20:33:14,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3915625 [2023-08-30 20:33:14,647 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1253 transitions. [2023-08-30 20:33:14,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1253 transitions. [2023-08-30 20:33:14,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:33:14,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1253 transitions. [2023-08-30 20:33:14,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:14,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:14,653 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 400.0) internal successors, (3600), 9 states have internal predecessors, (3600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:14,653 INFO L175 Difference]: Start difference. First operand has 150 places, 288 transitions, 2978 flow. Second operand 8 states and 1253 transitions. [2023-08-30 20:33:14,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 324 transitions, 3944 flow [2023-08-30 20:33:14,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 324 transitions, 3342 flow, removed 282 selfloop flow, removed 13 redundant places. [2023-08-30 20:33:14,789 INFO L231 Difference]: Finished difference. Result has 140 places, 279 transitions, 2302 flow [2023-08-30 20:33:14,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=2380, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2302, PETRI_PLACES=140, PETRI_TRANSITIONS=279} [2023-08-30 20:33:14,790 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 108 predicate places. [2023-08-30 20:33:14,791 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 279 transitions, 2302 flow [2023-08-30 20:33:14,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 150.2) internal successors, (1502), 10 states have internal predecessors, (1502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:14,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:33:14,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:33:14,796 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 20:33:14,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:33:14,992 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:33:14,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:33:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1159903868, now seen corresponding path program 1 times [2023-08-30 20:33:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:33:14,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421016052] [2023-08-30 20:33:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:33:14,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:33:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:33:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:33:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:33:15,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421016052] [2023-08-30 20:33:15,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421016052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:33:15,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972782390] [2023-08-30 20:33:15,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:33:15,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:33:15,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:33:15,109 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 20:33:15,119 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 20:33:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:33:15,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:33:15,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:33:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:33:15,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:33:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:33:15,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972782390] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:33:15,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:33:15,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-30 20:33:15,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392766041] [2023-08-30 20:33:15,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:33:15,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 20:33:15,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:33:15,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 20:33:15,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-30 20:33:15,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 400 [2023-08-30 20:33:15,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 279 transitions, 2302 flow. Second operand has 12 states, 12 states have (on average 163.16666666666666) internal successors, (1958), 12 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:15,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:33:15,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 400 [2023-08-30 20:33:15,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:33:15,874 INFO L130 PetriNetUnfolder]: 966/1630 cut-off events. [2023-08-30 20:33:15,874 INFO L131 PetriNetUnfolder]: For 11281/11281 co-relation queries the response was YES. [2023-08-30 20:33:15,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9185 conditions, 1630 events. 966/1630 cut-off events. For 11281/11281 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7965 event pairs, 223 based on Foata normal form. 186/1597 useless extension candidates. Maximal degree in co-relation 9138. Up to 956 conditions per place. [2023-08-30 20:33:15,893 INFO L137 encePairwiseOnDemand]: 395/400 looper letters, 117 selfloop transitions, 5 changer transitions 54/180 dead transitions. [2023-08-30 20:33:15,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 180 transitions, 1868 flow [2023-08-30 20:33:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:33:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:33:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1015 transitions. [2023-08-30 20:33:15,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42291666666666666 [2023-08-30 20:33:15,896 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1015 transitions. [2023-08-30 20:33:15,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1015 transitions. [2023-08-30 20:33:15,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:33:15,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1015 transitions. [2023-08-30 20:33:15,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:15,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:15,903 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:15,903 INFO L175 Difference]: Start difference. First operand has 140 places, 279 transitions, 2302 flow. Second operand 6 states and 1015 transitions. [2023-08-30 20:33:15,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 180 transitions, 1868 flow [2023-08-30 20:33:15,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 180 transitions, 1604 flow, removed 114 selfloop flow, removed 15 redundant places. [2023-08-30 20:33:15,940 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 695 flow [2023-08-30 20:33:15,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=695, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2023-08-30 20:33:15,941 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2023-08-30 20:33:15,941 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 695 flow [2023-08-30 20:33:15,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 163.16666666666666) internal successors, (1958), 12 states have internal predecessors, (1958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:33:15,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:33:15,942 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:33:15,953 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 20:33:16,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:33:16,151 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:33:16,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:33:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash -802610914, now seen corresponding path program 7 times [2023-08-30 20:33:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:33:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017638362] [2023-08-30 20:33:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:33:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:33:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:33:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:33:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:33:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017638362] [2023-08-30 20:33:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017638362] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:33:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051969649] [2023-08-30 20:33:18,992 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 20:33:18,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:33:18,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:33:18,993 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 20:33:18,995 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 20:33:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:33:19,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-30 20:33:19,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:33:19,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:33:19,121 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 44 treesize of output 42 [2023-08-30 20:33:19,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 20:33:19,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-30 20:33:19,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 16 treesize of output 18 [2023-08-30 20:33:19,780 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2023-08-30 20:33:19,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2023-08-30 20:33:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:33:19,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:33:20,139 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (* c_~t~0 2)) (.cse4 (* c_~q2_front~0 4)) (.cse7 (* c_~q2_back~0 4))) (and (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse3 (select .cse5 ~q2~0.base))) (let ((.cse1 (select .cse3 (+ ~q2~0.offset .cse7)))) (let ((.cse0 (+ .cse1 1))) (or (< 0 .cse0) (<= (+ c_~s~0 .cse1) (+ .cse2 1 (* 2 (select .cse3 (+ ~q2~0.offset .cse4))))) (< .cse0 (select (select .cse5 c_~q1~0.base) .cse6)))))))) (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse10 (select .cse9 ~q2~0.base))) (let ((.cse11 (select .cse10 (+ ~q2~0.offset .cse7)))) (let ((.cse8 (+ .cse11 1))) (or (< 0 .cse8) (< .cse8 (select (select .cse9 c_~q1~0.base) .cse6)) (< (+ .cse2 (* 2 (select .cse10 (+ ~q2~0.offset .cse4)))) (+ c_~s~0 .cse11)))))))))) is different from false [2023-08-30 20:33:20,217 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse4 (* c_~t~0 2)) (.cse6 (* c_~q2_front~0 4)) (.cse7 (* c_~q2_back~0 4))) (and (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse5 (select .cse1 ~q2~0.base))) (let ((.cse3 (select .cse5 (+ ~q2~0.offset .cse7)))) (let ((.cse0 (+ .cse3 1))) (or (< .cse0 (select (select .cse1 c_~q1~0.base) .cse2)) (<= (+ c_~s~0 .cse3) (+ .cse4 (* 2 (select .cse5 (+ ~q2~0.offset .cse6))) 1)) (< 0 .cse0))))))) (forall ((~q2~0.base Int) (~q2~0.offset Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_486 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_485) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_486))) (let ((.cse10 (select .cse9 ~q2~0.base))) (let ((.cse11 (select .cse10 (+ ~q2~0.offset .cse7)))) (let ((.cse8 (+ .cse11 1))) (or (< .cse8 (select (select .cse9 c_~q1~0.base) .cse2)) (< (+ .cse4 (* 2 (select .cse10 (+ ~q2~0.offset .cse6)))) (+ c_~s~0 .cse11)) (< 0 .cse8))))))))) is different from false [2023-08-30 20:33:20,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:33:20,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3534 treesize of output 3282 [2023-08-30 20:33:20,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:33:20,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1105 treesize of output 1080 [2023-08-30 20:33:20,586 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:33:20,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1039 treesize of output 948 [2023-08-30 20:33:20,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:33:20,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 907 treesize of output 882 [2023-08-30 20:33:20,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-30 20:33:20,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 841 treesize of output 750 Killed by 15