/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 15:00:28,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 15:00:28,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 15:00:28,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 15:00:28,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 15:00:28,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 15:00:28,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 15:00:28,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 15:00:28,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 15:00:28,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 15:00:28,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 15:00:28,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 15:00:28,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 15:00:28,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 15:00:28,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 15:00:28,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 15:00:28,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 15:00:28,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 15:00:28,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 15:00:28,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 15:00:28,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 15:00:28,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 15:00:28,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 15:00:28,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 15:00:28,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 15:00:28,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 15:00:28,250 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 15:00:28,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 15:00:28,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 15:00:28,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 15:00:28,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 15:00:28,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 15:00:28,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 15:00:28,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 15:00:28,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 15:00:28,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 15:00:28,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 15:00:28,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 15:00:28,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 15:00:28,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 15:00:28,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 15:00:28,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 15:00:28,277 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 15:00:28,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 15:00:28,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 15:00:28,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 15:00:28,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 15:00:28,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 15:00:28,278 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 15:00:28,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 15:00:28,278 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 15:00:28,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 15:00:28,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 15:00:28,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 15:00:28,280 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-19 15:00:28,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 15:00:28,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 15:00:28,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 15:00:28,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 15:00:28,462 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 15:00:28,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2022-01-19 15:00:28,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fb0fb6e/0ca6c953eb6347e39af91e9999eba4a7/FLAG4f9d547c3 [2022-01-19 15:00:28,875 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 15:00:28,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2022-01-19 15:00:28,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fb0fb6e/0ca6c953eb6347e39af91e9999eba4a7/FLAG4f9d547c3 [2022-01-19 15:00:29,289 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fb0fb6e/0ca6c953eb6347e39af91e9999eba4a7 [2022-01-19 15:00:29,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 15:00:29,292 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 15:00:29,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 15:00:29,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 15:00:29,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 15:00:29,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2ac7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29, skipping insertion in model container [2022-01-19 15:00:29,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 15:00:29,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 15:00:29,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-01-19 15:00:29,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 15:00:29,492 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 15:00:29,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c[2823,2836] [2022-01-19 15:00:29,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 15:00:29,529 INFO L208 MainTranslator]: Completed translation [2022-01-19 15:00:29,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29 WrapperNode [2022-01-19 15:00:29,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 15:00:29,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 15:00:29,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 15:00:29,530 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 15:00:29,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,564 INFO L137 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 232 [2022-01-19 15:00:29,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 15:00:29,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 15:00:29,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 15:00:29,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 15:00:29,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 15:00:29,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 15:00:29,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 15:00:29,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 15:00:29,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (1/1) ... [2022-01-19 15:00:29,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 15:00:29,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:00:29,614 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) [2022-01-19 15:00:29,622 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 [2022-01-19 15:00:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 15:00:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 15:00:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 15:00:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 15:00:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 15:00:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 15:00:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 15:00:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 15:00:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 15:00:29,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 15:00:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 15:00:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 15:00:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 15:00:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 15:00:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 15:00:29,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 15:00:29,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 15:00:29,646 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 15:00:29,709 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 15:00:29,710 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 15:00:30,012 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 15:00:30,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 15:00:30,061 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 15:00:30,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:00:30 BoogieIcfgContainer [2022-01-19 15:00:30,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 15:00:30,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 15:00:30,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 15:00:30,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 15:00:30,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:00:29" (1/3) ... [2022-01-19 15:00:30,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc4792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:00:30, skipping insertion in model container [2022-01-19 15:00:30,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:00:29" (2/3) ... [2022-01-19 15:00:30,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5adc4792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:00:30, skipping insertion in model container [2022-01-19 15:00:30,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:00:30" (3/3) ... [2022-01-19 15:00:30,068 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2022-01-19 15:00:30,072 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 15:00:30,072 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 15:00:30,072 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 15:00:30,109 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,110 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,110 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,110 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,111 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,112 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,112 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,113 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,114 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,114 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,114 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,115 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,115 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,115 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,115 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,115 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,115 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,115 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,116 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,117 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,118 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,118 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,119 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,120 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,121 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,122 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,129 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,130 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,130 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,130 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,130 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,130 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,130 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,131 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,131 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,131 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,131 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,131 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,131 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,131 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,132 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,132 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,132 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,132 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,132 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,132 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,132 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,133 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,133 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,133 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,133 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,133 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,133 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,134 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,135 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,137 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,138 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,139 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,140 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,140 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,140 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 15:00:30,143 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 15:00:30,174 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 15:00:30,179 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 15:00:30,179 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 15:00:30,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 298 places, 315 transitions, 654 flow [2022-01-19 15:00:30,261 INFO L129 PetriNetUnfolder]: 27/312 cut-off events. [2022-01-19 15:00:30,261 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 15:00:30,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 312 events. 27/312 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 205 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 244. Up to 3 conditions per place. [2022-01-19 15:00:30,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 315 transitions, 654 flow [2022-01-19 15:00:30,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 301 transitions, 620 flow [2022-01-19 15:00:30,305 INFO L129 PetriNetUnfolder]: 27/300 cut-off events. [2022-01-19 15:00:30,305 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 15:00:30,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:30,306 INFO L254 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:00:30,307 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:30,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1810646857, now seen corresponding path program 1 times [2022-01-19 15:00:30,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:30,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52921264] [2022-01-19 15:00:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:30,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 15:00:30,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:30,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52921264] [2022-01-19 15:00:30,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52921264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:00:30,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:00:30,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 15:00:30,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422819420] [2022-01-19 15:00:30,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:00:30,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 15:00:30,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:30,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 15:00:30,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 15:00:30,621 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 315 [2022-01-19 15:00:30,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 301 transitions, 620 flow. Second operand has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:30,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:30,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 315 [2022-01-19 15:00:30,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:30,731 INFO L129 PetriNetUnfolder]: 22/329 cut-off events. [2022-01-19 15:00:30,731 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-01-19 15:00:30,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 329 events. 22/329 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 383 event pairs, 7 based on Foata normal form. 36/338 useless extension candidates. Maximal degree in co-relation 233. Up to 28 conditions per place. [2022-01-19 15:00:30,736 INFO L132 encePairwiseOnDemand]: 297/315 looper letters, 8 selfloop transitions, 0 changer transitions 12/283 dead transitions. [2022-01-19 15:00:30,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 283 transitions, 600 flow [2022-01-19 15:00:30,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 15:00:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 15:00:30,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 602 transitions. [2022-01-19 15:00:30,753 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2022-01-19 15:00:30,754 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 602 transitions. [2022-01-19 15:00:30,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 602 transitions. [2022-01-19 15:00:30,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:30,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 602 transitions. [2022-01-19 15:00:30,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 301.0) internal successors, (602), 2 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:30,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:30,780 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:30,781 INFO L186 Difference]: Start difference. First operand has 284 places, 301 transitions, 620 flow. Second operand 2 states and 602 transitions. [2022-01-19 15:00:30,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 283 transitions, 600 flow [2022-01-19 15:00:30,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 283 transitions, 588 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 15:00:30,794 INFO L242 Difference]: Finished difference. Result has 279 places, 271 transitions, 548 flow [2022-01-19 15:00:30,795 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=548, PETRI_PLACES=279, PETRI_TRANSITIONS=271} [2022-01-19 15:00:30,799 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, -5 predicate places. [2022-01-19 15:00:30,800 INFO L470 AbstractCegarLoop]: Abstraction has has 279 places, 271 transitions, 548 flow [2022-01-19 15:00:30,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:30,800 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:30,801 INFO L254 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:00:30,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 15:00:30,801 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash 759378185, now seen corresponding path program 1 times [2022-01-19 15:00:30,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:30,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960421035] [2022-01-19 15:00:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:30,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 15:00:31,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:31,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960421035] [2022-01-19 15:00:31,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960421035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:00:31,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:00:31,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 15:00:31,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893270583] [2022-01-19 15:00:31,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:00:31,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 15:00:31,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:31,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 15:00:31,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-19 15:00:31,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 315 [2022-01-19 15:00:31,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 271 transitions, 548 flow. Second operand has 8 states, 8 states have (on average 199.625) internal successors, (1597), 8 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:31,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:31,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 315 [2022-01-19 15:00:31,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:31,400 INFO L129 PetriNetUnfolder]: 202/783 cut-off events. [2022-01-19 15:00:31,400 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-19 15:00:31,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 783 events. 202/783 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3236 event pairs, 103 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 1154. Up to 333 conditions per place. [2022-01-19 15:00:31,408 INFO L132 encePairwiseOnDemand]: 297/315 looper letters, 91 selfloop transitions, 15 changer transitions 0/283 dead transitions. [2022-01-19 15:00:31,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 283 transitions, 784 flow [2022-01-19 15:00:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 15:00:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 15:00:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1629 transitions. [2022-01-19 15:00:31,412 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6464285714285715 [2022-01-19 15:00:31,412 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1629 transitions. [2022-01-19 15:00:31,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1629 transitions. [2022-01-19 15:00:31,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:31,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1629 transitions. [2022-01-19 15:00:31,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 203.625) internal successors, (1629), 8 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:31,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:31,421 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 315.0) internal successors, (2835), 9 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:31,421 INFO L186 Difference]: Start difference. First operand has 279 places, 271 transitions, 548 flow. Second operand 8 states and 1629 transitions. [2022-01-19 15:00:31,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 283 transitions, 784 flow [2022-01-19 15:00:31,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 283 transitions, 784 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 15:00:31,428 INFO L242 Difference]: Finished difference. Result has 275 places, 274 transitions, 602 flow [2022-01-19 15:00:31,428 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=602, PETRI_PLACES=275, PETRI_TRANSITIONS=274} [2022-01-19 15:00:31,429 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, -9 predicate places. [2022-01-19 15:00:31,429 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 602 flow [2022-01-19 15:00:31,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 199.625) internal successors, (1597), 8 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:31,430 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:31,430 INFO L254 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:00:31,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 15:00:31,431 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1657129582, now seen corresponding path program 1 times [2022-01-19 15:00:31,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:31,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560954452] [2022-01-19 15:00:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:31,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 15:00:31,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:31,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560954452] [2022-01-19 15:00:31,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560954452] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 15:00:31,822 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 15:00:31,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-19 15:00:31,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680407141] [2022-01-19 15:00:31,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:00:31,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-19 15:00:31,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:31,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-19 15:00:31,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2022-01-19 15:00:31,830 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 315 [2022-01-19 15:00:31,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 274 transitions, 602 flow. Second operand has 21 states, 21 states have (on average 174.85714285714286) internal successors, (3672), 21 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:31,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:31,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 315 [2022-01-19 15:00:31,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:32,992 INFO L129 PetriNetUnfolder]: 765/2564 cut-off events. [2022-01-19 15:00:32,992 INFO L130 PetriNetUnfolder]: For 19/24 co-relation queries the response was YES. [2022-01-19 15:00:32,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3691 conditions, 2564 events. 765/2564 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 18228 event pairs, 101 based on Foata normal form. 2/2208 useless extension candidates. Maximal degree in co-relation 3686. Up to 282 conditions per place. [2022-01-19 15:00:33,008 INFO L132 encePairwiseOnDemand]: 285/315 looper letters, 146 selfloop transitions, 31 changer transitions 20/357 dead transitions. [2022-01-19 15:00:33,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 357 transitions, 1173 flow [2022-01-19 15:00:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 15:00:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 15:00:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5638 transitions. [2022-01-19 15:00:33,017 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5593253968253968 [2022-01-19 15:00:33,017 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5638 transitions. [2022-01-19 15:00:33,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5638 transitions. [2022-01-19 15:00:33,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:33,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5638 transitions. [2022-01-19 15:00:33,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 176.1875) internal successors, (5638), 32 states have internal predecessors, (5638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:33,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 315.0) internal successors, (10395), 33 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:33,041 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 315.0) internal successors, (10395), 33 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:33,041 INFO L186 Difference]: Start difference. First operand has 275 places, 274 transitions, 602 flow. Second operand 32 states and 5638 transitions. [2022-01-19 15:00:33,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 357 transitions, 1173 flow [2022-01-19 15:00:33,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 357 transitions, 1149 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 15:00:33,046 INFO L242 Difference]: Finished difference. Result has 307 places, 285 transitions, 703 flow [2022-01-19 15:00:33,046 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=703, PETRI_PLACES=307, PETRI_TRANSITIONS=285} [2022-01-19 15:00:33,047 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 23 predicate places. [2022-01-19 15:00:33,047 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 285 transitions, 703 flow [2022-01-19 15:00:33,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 174.85714285714286) internal successors, (3672), 21 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:33,048 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:33,048 INFO L254 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:00:33,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 15:00:33,049 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:33,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1010837465, now seen corresponding path program 1 times [2022-01-19 15:00:33,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:33,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347496583] [2022-01-19 15:00:33,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:33,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 15:00:33,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:33,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347496583] [2022-01-19 15:00:33,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347496583] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:33,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251383796] [2022-01-19 15:00:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:33,144 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:00:33,145 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) [2022-01-19 15:00:33,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 15:00:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:33,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 15:00:33,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:00:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 15:00:33,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:00:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 15:00:34,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251383796] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:00:34,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:00:34,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 15:00:34,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756219736] [2022-01-19 15:00:34,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:00:34,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 15:00:34,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 15:00:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 15:00:34,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 315 [2022-01-19 15:00:34,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 285 transitions, 703 flow. Second operand has 19 states, 19 states have (on average 240.26315789473685) internal successors, (4565), 19 states have internal predecessors, (4565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:34,131 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:34,131 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 315 [2022-01-19 15:00:34,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:34,949 INFO L129 PetriNetUnfolder]: 1489/3795 cut-off events. [2022-01-19 15:00:34,949 INFO L130 PetriNetUnfolder]: For 445/539 co-relation queries the response was YES. [2022-01-19 15:00:34,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6396 conditions, 3795 events. 1489/3795 cut-off events. For 445/539 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 24274 event pairs, 585 based on Foata normal form. 6/2910 useless extension candidates. Maximal degree in co-relation 6384. Up to 1092 conditions per place. [2022-01-19 15:00:34,974 INFO L132 encePairwiseOnDemand]: 286/315 looper letters, 133 selfloop transitions, 54 changer transitions 0/407 dead transitions. [2022-01-19 15:00:34,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 407 transitions, 1375 flow [2022-01-19 15:00:34,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 15:00:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 15:00:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4907 transitions. [2022-01-19 15:00:34,982 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7788888888888889 [2022-01-19 15:00:34,982 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4907 transitions. [2022-01-19 15:00:34,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4907 transitions. [2022-01-19 15:00:34,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:34,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4907 transitions. [2022-01-19 15:00:34,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 245.35) internal successors, (4907), 20 states have internal predecessors, (4907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:34,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:35,000 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:35,001 INFO L186 Difference]: Start difference. First operand has 307 places, 285 transitions, 703 flow. Second operand 20 states and 4907 transitions. [2022-01-19 15:00:35,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 407 transitions, 1375 flow [2022-01-19 15:00:35,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 407 transitions, 1331 flow, removed 5 selfloop flow, removed 21 redundant places. [2022-01-19 15:00:35,012 INFO L242 Difference]: Finished difference. Result has 307 places, 322 transitions, 974 flow [2022-01-19 15:00:35,012 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=974, PETRI_PLACES=307, PETRI_TRANSITIONS=322} [2022-01-19 15:00:35,013 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 23 predicate places. [2022-01-19 15:00:35,013 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 322 transitions, 974 flow [2022-01-19 15:00:35,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 240.26315789473685) internal successors, (4565), 19 states have internal predecessors, (4565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:35,015 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:35,016 INFO L254 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1] [2022-01-19 15:00:35,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 15:00:35,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:35,234 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -378664297, now seen corresponding path program 1 times [2022-01-19 15:00:35,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:35,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478676581] [2022-01-19 15:00:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:35,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 15:00:35,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:35,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478676581] [2022-01-19 15:00:35,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478676581] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:35,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512482868] [2022-01-19 15:00:35,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:35,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:35,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:00:35,343 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) [2022-01-19 15:00:35,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 15:00:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:35,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 15:00:35,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:00:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 15:00:35,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:00:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 15:00:36,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512482868] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:00:36,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:00:36,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 15:00:36,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707698852] [2022-01-19 15:00:36,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:00:36,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 15:00:36,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:36,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 15:00:36,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 15:00:36,226 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 315 [2022-01-19 15:00:36,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 322 transitions, 974 flow. Second operand has 19 states, 19 states have (on average 237.31578947368422) internal successors, (4509), 19 states have internal predecessors, (4509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:36,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:36,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 315 [2022-01-19 15:00:36,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:37,068 INFO L129 PetriNetUnfolder]: 1561/3928 cut-off events. [2022-01-19 15:00:37,068 INFO L130 PetriNetUnfolder]: For 1471/1592 co-relation queries the response was YES. [2022-01-19 15:00:37,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7701 conditions, 3928 events. 1561/3928 cut-off events. For 1471/1592 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 26013 event pairs, 773 based on Foata normal form. 35/3331 useless extension candidates. Maximal degree in co-relation 7683. Up to 1568 conditions per place. [2022-01-19 15:00:37,100 INFO L132 encePairwiseOnDemand]: 286/315 looper letters, 72 selfloop transitions, 30 changer transitions 89/408 dead transitions. [2022-01-19 15:00:37,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 408 transitions, 1642 flow [2022-01-19 15:00:37,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 15:00:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 15:00:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4847 transitions. [2022-01-19 15:00:37,107 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7693650793650794 [2022-01-19 15:00:37,107 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4847 transitions. [2022-01-19 15:00:37,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4847 transitions. [2022-01-19 15:00:37,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:37,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4847 transitions. [2022-01-19 15:00:37,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 242.35) internal successors, (4847), 20 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:37,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:37,122 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 315.0) internal successors, (6615), 21 states have internal predecessors, (6615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:37,122 INFO L186 Difference]: Start difference. First operand has 307 places, 322 transitions, 974 flow. Second operand 20 states and 4847 transitions. [2022-01-19 15:00:37,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 408 transitions, 1642 flow [2022-01-19 15:00:37,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 408 transitions, 1605 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-01-19 15:00:37,132 INFO L242 Difference]: Finished difference. Result has 327 places, 297 transitions, 872 flow [2022-01-19 15:00:37,133 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=872, PETRI_PLACES=327, PETRI_TRANSITIONS=297} [2022-01-19 15:00:37,133 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 43 predicate places. [2022-01-19 15:00:37,133 INFO L470 AbstractCegarLoop]: Abstraction has has 327 places, 297 transitions, 872 flow [2022-01-19 15:00:37,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 237.31578947368422) internal successors, (4509), 19 states have internal predecessors, (4509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:37,134 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:37,135 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:00:37,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 15:00:37,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:37,352 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:37,352 INFO L85 PathProgramCache]: Analyzing trace with hash 257040978, now seen corresponding path program 2 times [2022-01-19 15:00:37,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:37,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86146984] [2022-01-19 15:00:37,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:37,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-19 15:00:37,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:37,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86146984] [2022-01-19 15:00:37,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86146984] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:37,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253943375] [2022-01-19 15:00:37,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 15:00:37,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:37,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:00:37,473 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) [2022-01-19 15:00:37,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 15:00:37,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 15:00:37,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:00:37,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 15:00:37,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:00:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-19 15:00:37,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:00:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-19 15:00:38,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253943375] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:38,283 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 15:00:38,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 15:00:38,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893540023] [2022-01-19 15:00:38,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:00:38,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 15:00:38,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:38,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 15:00:38,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 15:00:38,287 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 315 [2022-01-19 15:00:38,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 297 transitions, 872 flow. Second operand has 9 states, 9 states have (on average 243.55555555555554) internal successors, (2192), 9 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:38,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:38,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 315 [2022-01-19 15:00:38,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:38,647 INFO L129 PetriNetUnfolder]: 826/1975 cut-off events. [2022-01-19 15:00:38,647 INFO L130 PetriNetUnfolder]: For 1591/1642 co-relation queries the response was YES. [2022-01-19 15:00:38,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4626 conditions, 1975 events. 826/1975 cut-off events. For 1591/1642 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11644 event pairs, 220 based on Foata normal form. 2/1706 useless extension candidates. Maximal degree in co-relation 4604. Up to 701 conditions per place. [2022-01-19 15:00:38,664 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 78 selfloop transitions, 10 changer transitions 0/309 dead transitions. [2022-01-19 15:00:38,664 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 309 transitions, 1100 flow [2022-01-19 15:00:38,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 15:00:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 15:00:38,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2444 transitions. [2022-01-19 15:00:38,668 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7758730158730158 [2022-01-19 15:00:38,668 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2444 transitions. [2022-01-19 15:00:38,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2444 transitions. [2022-01-19 15:00:38,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:38,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2444 transitions. [2022-01-19 15:00:38,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 244.4) internal successors, (2444), 10 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:38,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:38,675 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:38,675 INFO L186 Difference]: Start difference. First operand has 327 places, 297 transitions, 872 flow. Second operand 10 states and 2444 transitions. [2022-01-19 15:00:38,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 309 transitions, 1100 flow [2022-01-19 15:00:38,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 309 transitions, 1019 flow, removed 17 selfloop flow, removed 18 redundant places. [2022-01-19 15:00:38,683 INFO L242 Difference]: Finished difference. Result has 303 places, 299 transitions, 840 flow [2022-01-19 15:00:38,683 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=840, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2022-01-19 15:00:38,683 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 19 predicate places. [2022-01-19 15:00:38,684 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 840 flow [2022-01-19 15:00:38,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 243.55555555555554) internal successors, (2192), 9 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:38,684 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:38,685 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1] [2022-01-19 15:00:38,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 15:00:38,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:38,900 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1172583244, now seen corresponding path program 1 times [2022-01-19 15:00:38,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164202522] [2022-01-19 15:00:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:38,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 15:00:38,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164202522] [2022-01-19 15:00:38,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164202522] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:38,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512179310] [2022-01-19 15:00:38,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:38,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:38,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:00:38,980 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) [2022-01-19 15:00:38,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 15:00:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:39,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 15:00:39,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:00:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 15:00:39,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:00:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 15:00:39,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512179310] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:39,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 15:00:39,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 15:00:39,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165752283] [2022-01-19 15:00:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:00:39,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 15:00:39,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:39,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 15:00:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 15:00:39,958 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 315 [2022-01-19 15:00:39,959 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 840 flow. Second operand has 9 states, 9 states have (on average 239.77777777777777) internal successors, (2158), 9 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:39,959 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:39,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 315 [2022-01-19 15:00:39,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:40,419 INFO L129 PetriNetUnfolder]: 1352/3191 cut-off events. [2022-01-19 15:00:40,419 INFO L130 PetriNetUnfolder]: For 1676/2026 co-relation queries the response was YES. [2022-01-19 15:00:40,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 3191 events. 1352/3191 cut-off events. For 1676/2026 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 21732 event pairs, 315 based on Foata normal form. 379/3354 useless extension candidates. Maximal degree in co-relation 6959. Up to 1235 conditions per place. [2022-01-19 15:00:40,439 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 85 selfloop transitions, 10 changer transitions 0/312 dead transitions. [2022-01-19 15:00:40,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 312 transitions, 1080 flow [2022-01-19 15:00:40,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 15:00:40,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 15:00:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2409 transitions. [2022-01-19 15:00:40,444 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7647619047619048 [2022-01-19 15:00:40,444 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2409 transitions. [2022-01-19 15:00:40,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2409 transitions. [2022-01-19 15:00:40,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:40,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2409 transitions. [2022-01-19 15:00:40,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 240.9) internal successors, (2409), 10 states have internal predecessors, (2409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:40,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:40,452 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:40,453 INFO L186 Difference]: Start difference. First operand has 303 places, 299 transitions, 840 flow. Second operand 10 states and 2409 transitions. [2022-01-19 15:00:40,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 312 transitions, 1080 flow [2022-01-19 15:00:40,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 312 transitions, 1069 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-01-19 15:00:40,460 INFO L242 Difference]: Finished difference. Result has 310 places, 300 transitions, 863 flow [2022-01-19 15:00:40,461 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=863, PETRI_PLACES=310, PETRI_TRANSITIONS=300} [2022-01-19 15:00:40,461 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 26 predicate places. [2022-01-19 15:00:40,461 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 300 transitions, 863 flow [2022-01-19 15:00:40,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 239.77777777777777) internal successors, (2158), 9 states have internal predecessors, (2158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:40,462 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:40,462 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:00:40,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 15:00:40,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:40,679 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2099191554, now seen corresponding path program 1 times [2022-01-19 15:00:40,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:40,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887699273] [2022-01-19 15:00:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:40,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 15:00:40,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:40,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887699273] [2022-01-19 15:00:40,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887699273] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:40,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439176236] [2022-01-19 15:00:40,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:40,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:40,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:00:40,776 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) [2022-01-19 15:00:40,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 15:00:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:40,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 15:00:40,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:00:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 15:00:41,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:00:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-19 15:00:41,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439176236] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:41,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 15:00:41,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 15:00:41,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186037191] [2022-01-19 15:00:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 15:00:41,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 15:00:41,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:00:41,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 15:00:41,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 15:00:41,745 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 315 [2022-01-19 15:00:41,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 300 transitions, 863 flow. Second operand has 9 states, 9 states have (on average 242.66666666666666) internal successors, (2184), 9 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:41,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:00:41,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 315 [2022-01-19 15:00:41,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:00:42,054 INFO L129 PetriNetUnfolder]: 778/1843 cut-off events. [2022-01-19 15:00:42,055 INFO L130 PetriNetUnfolder]: For 1532/1946 co-relation queries the response was YES. [2022-01-19 15:00:42,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 1843 events. 778/1843 cut-off events. For 1532/1946 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10240 event pairs, 159 based on Foata normal form. 439/2097 useless extension candidates. Maximal degree in co-relation 4115. Up to 756 conditions per place. [2022-01-19 15:00:42,068 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 81 selfloop transitions, 10 changer transitions 0/309 dead transitions. [2022-01-19 15:00:42,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 309 transitions, 1077 flow [2022-01-19 15:00:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 15:00:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 15:00:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2435 transitions. [2022-01-19 15:00:42,072 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.773015873015873 [2022-01-19 15:00:42,072 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2435 transitions. [2022-01-19 15:00:42,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2435 transitions. [2022-01-19 15:00:42,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:00:42,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2435 transitions. [2022-01-19 15:00:42,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:42,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:42,081 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 315.0) internal successors, (3465), 11 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:42,081 INFO L186 Difference]: Start difference. First operand has 310 places, 300 transitions, 863 flow. Second operand 10 states and 2435 transitions. [2022-01-19 15:00:42,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 309 transitions, 1077 flow [2022-01-19 15:00:42,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 309 transitions, 1060 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 15:00:42,090 INFO L242 Difference]: Finished difference. Result has 312 places, 299 transitions, 871 flow [2022-01-19 15:00:42,090 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=871, PETRI_PLACES=312, PETRI_TRANSITIONS=299} [2022-01-19 15:00:42,092 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 28 predicate places. [2022-01-19 15:00:42,092 INFO L470 AbstractCegarLoop]: Abstraction has has 312 places, 299 transitions, 871 flow [2022-01-19 15:00:42,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 242.66666666666666) internal successors, (2184), 9 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:00:42,094 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:00:42,094 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:00:42,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 15:00:42,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:42,311 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:00:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:00:42,311 INFO L85 PathProgramCache]: Analyzing trace with hash -817599591, now seen corresponding path program 1 times [2022-01-19 15:00:42,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:00:42,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843277122] [2022-01-19 15:00:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:42,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:00:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 15:00:43,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:00:43,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843277122] [2022-01-19 15:00:43,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843277122] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:00:43,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039866639] [2022-01-19 15:00:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:00:43,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:00:43,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:00:43,734 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) [2022-01-19 15:00:43,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 15:00:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:00:43,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-19 15:00:43,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:00:44,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:00:44,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2022-01-19 15:00:45,531 INFO L353 Elim1Store]: treesize reduction 56, result has 45.6 percent of original size [2022-01-19 15:00:45,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 67 [2022-01-19 15:01:00,912 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:01:00,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 164 treesize of output 129 [2022-01-19 15:01:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 15:01:01,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:01:15,555 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:01:15,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 116 [2022-01-19 15:01:16,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 15:01:16,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039866639] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:01:16,620 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:01:16,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 32, 29] total 90 [2022-01-19 15:01:16,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644171932] [2022-01-19 15:01:16,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:01:16,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-01-19 15:01:16,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:01:16,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-01-19 15:01:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=7588, Unknown=9, NotChecked=0, Total=8010 [2022-01-19 15:01:16,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 315 [2022-01-19 15:01:16,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 299 transitions, 871 flow. Second operand has 90 states, 90 states have (on average 110.07777777777778) internal successors, (9907), 90 states have internal predecessors, (9907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:01:16,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:01:16,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 315 [2022-01-19 15:01:16,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:01:39,530 INFO L129 PetriNetUnfolder]: 36729/57747 cut-off events. [2022-01-19 15:01:39,530 INFO L130 PetriNetUnfolder]: For 43536/43536 co-relation queries the response was YES. [2022-01-19 15:01:39,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143128 conditions, 57747 events. 36729/57747 cut-off events. For 43536/43536 co-relation queries the response was YES. Maximal size of possible extension queue 1844. Compared 455318 event pairs, 2937 based on Foata normal form. 1/53760 useless extension candidates. Maximal degree in co-relation 143108. Up to 8985 conditions per place. [2022-01-19 15:01:40,113 INFO L132 encePairwiseOnDemand]: 226/315 looper letters, 885 selfloop transitions, 349 changer transitions 20/1347 dead transitions. [2022-01-19 15:01:40,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1347 transitions, 6881 flow [2022-01-19 15:01:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-01-19 15:01:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2022-01-19 15:01:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 12428 transitions. [2022-01-19 15:01:40,126 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3722072476789458 [2022-01-19 15:01:40,126 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 12428 transitions. [2022-01-19 15:01:40,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 12428 transitions. [2022-01-19 15:01:40,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:01:40,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 12428 transitions. [2022-01-19 15:01:40,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 117.24528301886792) internal successors, (12428), 106 states have internal predecessors, (12428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:01:40,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 315.0) internal successors, (33705), 107 states have internal predecessors, (33705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:01:40,177 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 315.0) internal successors, (33705), 107 states have internal predecessors, (33705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:01:40,178 INFO L186 Difference]: Start difference. First operand has 312 places, 299 transitions, 871 flow. Second operand 106 states and 12428 transitions. [2022-01-19 15:01:40,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1347 transitions, 6881 flow [2022-01-19 15:01:40,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 1347 transitions, 6815 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 15:01:40,655 INFO L242 Difference]: Finished difference. Result has 458 places, 611 transitions, 3215 flow [2022-01-19 15:01:40,656 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=3215, PETRI_PLACES=458, PETRI_TRANSITIONS=611} [2022-01-19 15:01:40,656 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 174 predicate places. [2022-01-19 15:01:40,656 INFO L470 AbstractCegarLoop]: Abstraction has has 458 places, 611 transitions, 3215 flow [2022-01-19 15:01:40,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 110.07777777777778) internal successors, (9907), 90 states have internal predecessors, (9907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:01:40,658 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:01:40,659 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:01:40,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 15:01:40,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:01:40,882 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:01:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:01:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1130145813, now seen corresponding path program 2 times [2022-01-19 15:01:40,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:01:40,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586736745] [2022-01-19 15:01:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:01:40,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:01:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:01:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 15:01:42,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:01:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586736745] [2022-01-19 15:01:42,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586736745] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:01:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136931839] [2022-01-19 15:01:42,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 15:01:42,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:01:42,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:01:42,800 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) [2022-01-19 15:01:42,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 15:01:42,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 15:01:42,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:01:42,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 96 conjunts are in the unsatisfiable core [2022-01-19 15:01:42,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:01:44,446 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:01:44,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2022-01-19 15:01:46,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:01:46,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:01:46,158 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 15:01:46,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 30 [2022-01-19 15:01:46,372 INFO L353 Elim1Store]: treesize reduction 48, result has 48.4 percent of original size [2022-01-19 15:01:46,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 65 [2022-01-19 15:02:05,643 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:02:05,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 159 treesize of output 125 [2022-01-19 15:02:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 15:02:05,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:02:34,009 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_475 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (+ (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)))) (+ c_~maxa~0 c_~maxb~0)))) is different from false [2022-01-19 15:02:34,041 WARN L838 $PredicateComparison]: unable to prove that (or (<= c_~maxb~0 |c_thread1Thread1of1ForFork2_#t~mem4|) (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_475 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (+ (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)))) (+ c_~maxa~0 c_~maxb~0))))) is different from false [2022-01-19 15:02:34,189 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= c_~maxc~0 (+ c_~maxa~0 c_~maxb~0)) (forall ((v_ArrVal_475 (Array Int Int))) (<= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475))) (+ (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4)))) (+ c_~maxa~0 c_~maxb~0)))) (<= c_~maxb~0 (select (select |c_#memory_int| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset))) (<= c_~maxa~0 |c_thread1Thread1of1ForFork2_#t~mem2|)) is different from false [2022-01-19 15:02:34,220 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:02:34,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 183 [2022-01-19 15:02:34,231 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:02:34,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 80 treesize of output 77 [2022-01-19 15:02:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 1 not checked. [2022-01-19 15:02:36,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136931839] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:02:36,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:02:36,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 46, 42] total 118 [2022-01-19 15:02:36,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033425481] [2022-01-19 15:02:36,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:02:36,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-01-19 15:02:36,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:02:36,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-01-19 15:02:36,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=12492, Unknown=82, NotChecked=684, Total=13806 [2022-01-19 15:02:36,883 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 315 [2022-01-19 15:02:36,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 611 transitions, 3215 flow. Second operand has 118 states, 118 states have (on average 103.78813559322033) internal successors, (12247), 118 states have internal predecessors, (12247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:02:36,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:02:36,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 315 [2022-01-19 15:02:36,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:03:26,831 INFO L129 PetriNetUnfolder]: 62573/97808 cut-off events. [2022-01-19 15:03:26,831 INFO L130 PetriNetUnfolder]: For 528766/528995 co-relation queries the response was YES. [2022-01-19 15:03:28,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365796 conditions, 97808 events. 62573/97808 cut-off events. For 528766/528995 co-relation queries the response was YES. Maximal size of possible extension queue 2843. Compared 819517 event pairs, 6136 based on Foata normal form. 19/93547 useless extension candidates. Maximal degree in co-relation 365727. Up to 14738 conditions per place. [2022-01-19 15:03:28,558 INFO L132 encePairwiseOnDemand]: 221/315 looper letters, 864 selfloop transitions, 506 changer transitions 20/1479 dead transitions. [2022-01-19 15:03:28,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 1479 transitions, 11821 flow [2022-01-19 15:03:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-01-19 15:03:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2022-01-19 15:03:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 11136 transitions. [2022-01-19 15:03:28,577 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3465919701213819 [2022-01-19 15:03:28,577 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 11136 transitions. [2022-01-19 15:03:28,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 11136 transitions. [2022-01-19 15:03:28,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:03:28,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 11136 transitions. [2022-01-19 15:03:28,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 109.17647058823529) internal successors, (11136), 102 states have internal predecessors, (11136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:03:28,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 315.0) internal successors, (32445), 103 states have internal predecessors, (32445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:03:28,623 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 315.0) internal successors, (32445), 103 states have internal predecessors, (32445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:03:28,623 INFO L186 Difference]: Start difference. First operand has 458 places, 611 transitions, 3215 flow. Second operand 102 states and 11136 transitions. [2022-01-19 15:03:28,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 1479 transitions, 11821 flow [2022-01-19 15:03:37,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 1479 transitions, 11527 flow, removed 50 selfloop flow, removed 35 redundant places. [2022-01-19 15:03:37,168 INFO L242 Difference]: Finished difference. Result has 555 places, 886 transitions, 7030 flow [2022-01-19 15:03:37,168 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=102, PETRI_FLOW=7030, PETRI_PLACES=555, PETRI_TRANSITIONS=886} [2022-01-19 15:03:37,169 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 271 predicate places. [2022-01-19 15:03:37,169 INFO L470 AbstractCegarLoop]: Abstraction has has 555 places, 886 transitions, 7030 flow [2022-01-19 15:03:37,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 103.78813559322033) internal successors, (12247), 118 states have internal predecessors, (12247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:03:37,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:03:37,171 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:03:37,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 15:03:37,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:03:37,371 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:03:37,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:03:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1227456851, now seen corresponding path program 3 times [2022-01-19 15:03:37,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:03:37,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484722449] [2022-01-19 15:03:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:03:37,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:03:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:03:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 15:03:38,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:03:38,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484722449] [2022-01-19 15:03:38,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484722449] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:03:38,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586423118] [2022-01-19 15:03:38,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 15:03:38,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:03:38,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:03:38,988 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 15:03:38,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 15:03:39,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 15:03:39,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:03:39,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 116 conjunts are in the unsatisfiable core [2022-01-19 15:03:39,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:03:39,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 15:03:39,411 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 15:03:39,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 15:03:39,961 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-19 15:03:39,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-19 15:03:40,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-19 15:03:41,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-01-19 15:03:43,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 34 [2022-01-19 15:03:44,150 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 15:03:44,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:03:45,050 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:03:45,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 128 treesize of output 142 [2022-01-19 15:03:45,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 32 [2022-01-19 15:03:48,511 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:03:48,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 29 [2022-01-19 15:03:48,700 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:03:48,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 93 [2022-01-19 15:03:49,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:03:49,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 23 [2022-01-19 15:03:50,688 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:03:50,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 291 treesize of output 387 [2022-01-19 15:05:14,634 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:05:14,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 59 [2022-01-19 15:05:16,397 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-01-19 15:05:16,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586423118] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 15:05:16,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 15:05:16,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 48, 48] total 137 [2022-01-19 15:05:16,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341069303] [2022-01-19 15:05:16,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 15:05:16,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 137 states [2022-01-19 15:05:16,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 15:05:16,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2022-01-19 15:05:16,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=18020, Unknown=0, NotChecked=0, Total=18632 [2022-01-19 15:05:16,412 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 315 [2022-01-19 15:05:16,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 886 transitions, 7030 flow. Second operand has 137 states, 137 states have (on average 97.34306569343066) internal successors, (13336), 137 states have internal predecessors, (13336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:05:16,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 15:05:16,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 315 [2022-01-19 15:05:16,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 15:07:34,192 INFO L129 PetriNetUnfolder]: 149216/229263 cut-off events. [2022-01-19 15:07:34,192 INFO L130 PetriNetUnfolder]: For 2401472/2402104 co-relation queries the response was YES. [2022-01-19 15:07:39,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1112892 conditions, 229263 events. 149216/229263 cut-off events. For 2401472/2402104 co-relation queries the response was YES. Maximal size of possible extension queue 6364. Compared 2096059 event pairs, 7196 based on Foata normal form. 88/222263 useless extension candidates. Maximal degree in co-relation 1112790. Up to 45752 conditions per place. [2022-01-19 15:07:40,637 INFO L132 encePairwiseOnDemand]: 197/315 looper letters, 2346 selfloop transitions, 1965 changer transitions 181/4576 dead transitions. [2022-01-19 15:07:40,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 922 places, 4576 transitions, 49248 flow [2022-01-19 15:07:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 374 states. [2022-01-19 15:07:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2022-01-19 15:07:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 38249 transitions. [2022-01-19 15:07:40,666 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3246668364315423 [2022-01-19 15:07:40,666 INFO L72 ComplementDD]: Start complementDD. Operand 374 states and 38249 transitions. [2022-01-19 15:07:40,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 38249 transitions. [2022-01-19 15:07:40,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 15:07:40,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 374 states and 38249 transitions. [2022-01-19 15:07:40,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 375 states, 374 states have (on average 102.27005347593582) internal successors, (38249), 374 states have internal predecessors, (38249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:07:40,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 375 states, 375 states have (on average 315.0) internal successors, (118125), 375 states have internal predecessors, (118125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:07:40,793 INFO L81 ComplementDD]: Finished complementDD. Result has 375 states, 375 states have (on average 315.0) internal successors, (118125), 375 states have internal predecessors, (118125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:07:40,793 INFO L186 Difference]: Start difference. First operand has 555 places, 886 transitions, 7030 flow. Second operand 374 states and 38249 transitions. [2022-01-19 15:07:40,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 922 places, 4576 transitions, 49248 flow [2022-01-19 15:09:26,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 870 places, 4576 transitions, 48569 flow, removed 225 selfloop flow, removed 52 redundant places. [2022-01-19 15:09:26,993 INFO L242 Difference]: Finished difference. Result has 1026 places, 2489 transitions, 31109 flow [2022-01-19 15:09:26,994 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=6653, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=374, PETRI_FLOW=31109, PETRI_PLACES=1026, PETRI_TRANSITIONS=2489} [2022-01-19 15:09:26,994 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 742 predicate places. [2022-01-19 15:09:26,994 INFO L470 AbstractCegarLoop]: Abstraction has has 1026 places, 2489 transitions, 31109 flow [2022-01-19 15:09:26,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 137 states, 137 states have (on average 97.34306569343066) internal successors, (13336), 137 states have internal predecessors, (13336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 15:09:26,996 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 15:09:26,996 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 15:09:27,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 15:09:27,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 15:09:27,205 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 15:09:27,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 15:09:27,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1137187053, now seen corresponding path program 4 times [2022-01-19 15:09:27,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 15:09:27,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974601088] [2022-01-19 15:09:27,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 15:09:27,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 15:09:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 15:09:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 15:09:30,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 15:09:30,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974601088] [2022-01-19 15:09:30,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974601088] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 15:09:30,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194734991] [2022-01-19 15:09:30,802 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 15:09:30,802 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:09:30,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 15:09:30,803 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 15:09:30,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 15:09:30,946 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 15:09:30,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 15:09:30,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 140 conjunts are in the unsatisfiable core [2022-01-19 15:09:30,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 15:09:30,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 15:09:31,068 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-19 15:09:31,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-19 15:09:31,145 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-19 15:09:31,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2022-01-19 15:09:31,537 INFO L353 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-01-19 15:09:31,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 27 treesize of output 45 [2022-01-19 15:09:32,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-19 15:09:33,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:33,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:33,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:33,100 INFO L353 Elim1Store]: treesize reduction 42, result has 19.2 percent of original size [2022-01-19 15:09:33,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 45 [2022-01-19 15:09:33,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2022-01-19 15:09:34,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-19 15:09:35,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:35,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:35,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:35,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:35,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:35,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:35,744 INFO L353 Elim1Store]: treesize reduction 32, result has 22.0 percent of original size [2022-01-19 15:09:35,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 27 [2022-01-19 15:09:36,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 15:09:36,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 15:09:41,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:41,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2022-01-19 15:09:42,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:42,121 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2022-01-19 15:09:42,553 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-19 15:09:42,553 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 58 [2022-01-19 15:09:42,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:42,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 15:09:42,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2022-01-19 15:09:50,546 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-19 15:09:50,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 43 [2022-01-19 15:09:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 15:09:50,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 15:09:51,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_626 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (<= c_~maxa~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset 4))) (let ((.cse1 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse1) (<= (select (select .cse0 c_~C~0.base) (+ c_~C~0.offset 4)) .cse1))) (<= c_~maxb~0 (select (select .cse0 c_~B~0.base) (+ 4 c_~B~0.offset)))))) is different from false [2022-01-19 15:09:52,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse2 (* |c_thread2Thread1of1ForFork0_~i~1#1| 4))) (let ((.cse1 (store (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) (+ .cse2 ~C~0.offset) v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (let ((.cse0 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse0) (<= (select (select .cse1 c_~C~0.base) (+ ~C~0.offset 4)) .cse0))) (<= c_~maxa~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset 4))) (<= c_~maxb~0 (select (select .cse1 c_~B~0.base) (+ 4 c_~B~0.offset))) (< (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse2)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse2 c_~B~0.offset))) v_ArrVal_625))))) is different from false [2022-01-19 15:09:52,349 WARN L838 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse4 (+ ~C~0.offset 4))) (let ((.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ 4 c_~B~0.offset)) (.cse0 (store (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (<= c_~maxa~0 (select (select .cse0 c_~A~0.base) .cse1)) (< (+ (select (select |c_#memory_int| c_~A~0.base) .cse1) (select (select |c_#memory_int| c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse0 c_~B~0.base) .cse2)) (let ((.cse3 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse3) (<= (select (select .cse0 c_~C~0.base) .cse4) .cse3))))))) is different from false [2022-01-19 15:09:52,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ c_~A~0.offset 4)) (.cse4 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ 4 c_~B~0.offset))) (or (< (+ (select (select .cse0 c_~B~0.base) .cse1) (select (select .cse0 c_~A~0.base) .cse2)) v_ArrVal_625) (let ((.cse3 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse3) (<= (select (select .cse4 c_~C~0.base) .cse5) .cse3))) (<= c_~maxa~0 (select (select .cse4 c_~A~0.base) .cse2)) (<= c_~maxb~0 (select (select .cse4 c_~B~0.base) .cse1)))))) is different from false [2022-01-19 15:09:53,692 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)) (let ((.cse4 (+ c_~maxa~0 c_~maxb~0))) (and (<= c_~maxc~0 .cse4) (<= (select (select .cse3 c_~C~0.base) .cse5) .cse4))))))) is different from false [2022-01-19 15:09:54,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)) (let ((.cse4 (+ c_~maxa~0 c_~maxb~0))) (and (<= |c_ULTIMATE.start_main_#t~ret21#1| .cse4) (<= (select (select .cse3 c_~C~0.base) .cse5) .cse4))))))) is different from false [2022-01-19 15:09:55,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (let ((.cse4 (+ c_~maxa~0 c_~maxb~0))) (and (<= |c_ULTIMATE.start_plus_#res#1| .cse4) (<= (select (select .cse3 c_~C~0.base) .cse5) .cse4))) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 15:09:55,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_plus_~a#1| |c_ULTIMATE.start_plus_~b#1|) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 15:09:59,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_plus_~a#1| |c_ULTIMATE.start_plus_#in~b#1|) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 15:09:59,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_plus_#in~b#1| |c_ULTIMATE.start_plus_#in~a#1|) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 15:10:00,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse1 (+ ~C~0.offset 4))) (let ((.cse5 (+ 4 c_~B~0.offset)) (.cse0 (store (store .cse3 c_~C~0.base (store (select .cse3 c_~C~0.base) .cse1 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ c_~A~0.offset 4))) (or (let ((.cse2 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse0 c_~C~0.base) .cse1) .cse2) (<= (+ |c_ULTIMATE.start_main_#t~mem19#1| |c_ULTIMATE.start_main_#t~mem20#1|) .cse2))) (< (+ (select (select .cse3 c_~A~0.base) .cse4) (select (select .cse3 c_~B~0.base) .cse5)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse0 c_~B~0.base) .cse5)) (<= c_~maxa~0 (select (select .cse0 c_~A~0.base) .cse4)))))) is different from false [2022-01-19 15:10:01,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ |c_ULTIMATE.start_main_#t~mem19#1| (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) .cse5))) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 15:10:01,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= c_~maxb~0 (select (select .cse3 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)) (let ((.cse5 (+ c_~maxa~0 c_~maxb~0))) (and (<= (select (select .cse3 c_~C~0.base) .cse4) .cse5) (<= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) .cse5))))))) is different from false [2022-01-19 15:10:02,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= |c_ULTIMATE.start_main_#t~mem18#1| (select (select .cse3 c_~B~0.base) .cse2)) (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~mem18#1| c_~maxa~0))) (and (<= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) .cse4) (<= (select (select .cse3 c_~C~0.base) .cse5) .cse4))) (<= c_~maxa~0 (select (select .cse3 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 15:10:02,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse4 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse3 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= .cse3 (select (select .cse4 c_~B~0.base) .cse2)) (<= c_~maxa~0 (select (select .cse4 c_~A~0.base) .cse1)) (and (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~maxa~0) (<= (select (select .cse4 c_~C~0.base) .cse5) (+ .cse3 c_~maxa~0))))))) is different from false [2022-01-19 15:10:03,652 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse4 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse3 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= .cse3 (select (select .cse4 c_~B~0.base) .cse2)) (<= |c_ULTIMATE.start_main_#t~mem17#1| (select (select .cse4 c_~A~0.base) .cse1)) (and (<= (select (select .cse4 c_~C~0.base) .cse5) (+ |c_ULTIMATE.start_main_#t~mem17#1| .cse3)) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) |c_ULTIMATE.start_main_#t~mem17#1|)))))) is different from false [2022-01-19 15:10:03,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse6 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse4 (store (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) .cse6 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse3 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= .cse3 (select (select .cse4 c_~B~0.base) .cse2)) (<= .cse5 (select (select .cse4 c_~A~0.base) .cse1)) (<= (select (select .cse4 c_~C~0.base) .cse6) (+ .cse5 .cse3)))))) is different from false [2022-01-19 15:10:04,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse1 (+ c_~A~0.offset 4)) (.cse6 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (store (store .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base|) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse2 (+ 4 c_~B~0.offset))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= (select (select .cse3 |c_ULTIMATE.start_main_#t~ret16#1.base|) .cse4) (+ .cse5 .cse6)) (<= .cse5 (select (select .cse3 c_~A~0.base) .cse1)) (<= .cse6 (select (select .cse3 c_~B~0.base) .cse2)))))) is different from false [2022-01-19 15:10:04,209 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ 4 c_~B~0.offset)) (.cse3 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse6 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse4 (store (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| (store (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (+ c_~A~0.offset 4))) (or (< (+ (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 c_~B~0.base) .cse2)) v_ArrVal_625) (<= .cse3 (select (select .cse4 c_~B~0.base) .cse2)) (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse5) (+ .cse6 .cse3)) (<= .cse6 (select (select .cse4 c_~A~0.base) .cse1)))))) is different from false [2022-01-19 15:10:04,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse1 (+ ~C~0.offset 4))) (let ((.cse2 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse3 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse0 (store (store .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ c_~A~0.offset 4)) (.cse5 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) (+ .cse2 .cse3)) (<= .cse2 (select (select .cse0 c_~A~0.base) .cse4)) (<= .cse3 (select (select .cse0 c_~B~0.base) .cse5)) (< (+ (select (select .cse6 c_~A~0.base) .cse4) (select (select .cse6 c_~B~0.base) .cse5)) v_ArrVal_625))))) is different from false [2022-01-19 15:10:04,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_621))) (let ((.cse3 (store (store .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse2 (+ c_~A~0.offset 4)) (.cse0 (select (select .cse7 c_~A~0.base) c_~A~0.offset)) (.cse6 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse1 (store (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ 4 c_~B~0.offset))) (or (<= .cse0 (select (select .cse1 c_~A~0.base) .cse2)) (< (+ (select (select .cse3 c_~B~0.base) .cse4) (select (select .cse3 c_~A~0.base) .cse2)) v_ArrVal_625) (<= (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) (+ .cse0 .cse6)) (<= .cse6 (select (select .cse1 c_~B~0.base) .cse4))))))) is different from false [2022-01-19 15:10:05,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base| v_ArrVal_621))) (let ((.cse5 (store (store .cse7 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_622) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse1 (+ ~C~0.offset 4))) (let ((.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset)) (.cse4 (+ c_~A~0.offset 4)) (.cse3 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse0 (store (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base| (store (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base|) .cse1 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse6 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base|) .cse1) (+ .cse2 .cse3)) (<= .cse2 (select (select .cse0 c_~A~0.base) .cse4)) (< (+ (select (select .cse5 c_~A~0.base) .cse4) (select (select .cse5 c_~B~0.base) .cse6)) v_ArrVal_625) (<= .cse3 (select (select .cse0 c_~B~0.base) .cse6))))))) is different from false [2022-01-19 15:10:10,480 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:10:10,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 233 [2022-01-19 15:10:41,239 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:10:41,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 366 treesize of output 234 [2022-01-19 15:10:41,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 15:10:41,314 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-19 15:10:41,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 262085 treesize of output 248533 [2022-01-19 15:10:42,079 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:10:42,080 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 256192 treesize of output 250764 [2022-01-19 15:10:42,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 15:10:42,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258656 treesize of output 241632 [2022-01-19 15:10:43,522 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:10:43,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 276544 treesize of output 261580 [2022-01-19 15:10:44,361 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:10:44,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 260736 treesize of output 235812 [2022-01-19 15:10:45,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 15:10:45,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 15:10:45,233 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 15:10:45,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 237845 treesize of output 228797 Received shutdown request... [2022-01-19 15:13:51,041 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 15:13:51,053 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 15:13:51,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 15:13:51,063 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 15:13:51,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 15:13:51,242 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-01-19 15:13:51,243 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-19 15:13:51,243 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-19 15:13:51,243 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-19 15:13:51,245 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-01-19 15:13:51,247 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 15:13:51,247 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 15:13:51,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 03:13:51 BasicIcfg [2022-01-19 15:13:51,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 15:13:51,249 INFO L158 Benchmark]: Toolchain (without parser) took 801956.95ms. Allocated memory was 461.4MB in the beginning and 14.3GB in the end (delta: 13.9GB). Free memory was 403.6MB in the beginning and 5.0GB in the end (delta: -4.6GB). Peak memory consumption was 12.9GB. Max. memory is 16.0GB. [2022-01-19 15:13:51,249 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 461.4MB. Free memory is still 420.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 15:13:51,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.21ms. Allocated memory was 461.4MB in the beginning and 637.5MB in the end (delta: 176.2MB). Free memory was 403.4MB in the beginning and 605.4MB in the end (delta: -201.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. [2022-01-19 15:13:51,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.65ms. Allocated memory is still 637.5MB. Free memory was 605.4MB in the beginning and 602.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 15:13:51,250 INFO L158 Benchmark]: Boogie Preprocessor took 22.60ms. Allocated memory is still 637.5MB. Free memory was 602.7MB in the beginning and 600.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 15:13:51,250 INFO L158 Benchmark]: RCFGBuilder took 475.13ms. Allocated memory is still 637.5MB. Free memory was 600.6MB in the beginning and 569.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2022-01-19 15:13:51,250 INFO L158 Benchmark]: TraceAbstraction took 801184.69ms. Allocated memory was 637.5MB in the beginning and 14.3GB in the end (delta: 13.7GB). Free memory was 569.1MB in the beginning and 5.0GB in the end (delta: -4.5GB). Peak memory consumption was 12.8GB. Max. memory is 16.0GB. [2022-01-19 15:13:51,251 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 461.4MB. Free memory is still 420.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 222.21ms. Allocated memory was 461.4MB in the beginning and 637.5MB in the end (delta: 176.2MB). Free memory was 403.4MB in the beginning and 605.4MB in the end (delta: -201.9MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.65ms. Allocated memory is still 637.5MB. Free memory was 605.4MB in the beginning and 602.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.60ms. Allocated memory is still 637.5MB. Free memory was 602.7MB in the beginning and 600.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 475.13ms. Allocated memory is still 637.5MB. Free memory was 600.6MB in the beginning and 569.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 801184.69ms. Allocated memory was 637.5MB in the beginning and 14.3GB in the end (delta: 13.7GB). Free memory was 569.1MB in the beginning and 5.0GB in the end (delta: -4.5GB). Peak memory consumption was 12.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 334 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 801.1s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 339.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24259 SdHoareTripleChecker+Valid, 18.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24259 mSDsluCounter, 38906 SdHoareTripleChecker+Invalid, 14.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 18830 IncrementalHoareTripleChecker+Unchecked, 42842 mSDsCounter, 1407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38940 IncrementalHoareTripleChecker+Invalid, 59177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1407 mSolverCounterUnsat, 1129 mSDtfsCounter, 38940 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5243 GetRequests, 4102 SyntacticMatches, 51 SemanticMatches, 1090 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 110821 ImplicationChecksByTransitivity, 177.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31109occurred in iteration=11, InterpolantAutomatonStates: 694, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 193.6s InterpolantComputationTime, 4978 NumberOfCodeBlocks, 4957 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7104 ConstructedInterpolants, 112 QuantifiedInterpolants, 50297 SizeOfPredicates, 224 NumberOfNonLiveVariables, 4525 ConjunctsInSsa, 332 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 443/555 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown