/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 08:59:59,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 08:59:59,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 08:59:59,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 08:59:59,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 08:59:59,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 08:59:59,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 08:59:59,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 08:59:59,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 08:59:59,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 08:59:59,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 08:59:59,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 08:59:59,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 08:59:59,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 08:59:59,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 08:59:59,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 08:59:59,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 08:59:59,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 08:59:59,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 08:59:59,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 08:59:59,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 08:59:59,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 08:59:59,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 08:59:59,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 08:59:59,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 08:59:59,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 08:59:59,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 08:59:59,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 08:59:59,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 08:59:59,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 08:59:59,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 08:59:59,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 08:59:59,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 08:59:59,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 08:59:59,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 08:59:59,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 08:59:59,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 08:59:59,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 08:59:59,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 08:59:59,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 08:59:59,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 08:59:59,386 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-Before.epf [2022-01-19 08:59:59,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 08:59:59,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 08:59:59,408 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 08:59:59,409 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 08:59:59,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 08:59:59,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 08:59:59,409 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 08:59:59,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 08:59:59,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 08:59:59,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 08:59:59,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 08:59:59,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 08:59:59,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 08:59:59,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 08:59:59,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 08:59:59,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 08:59:59,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:59:59,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 08:59:59,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 08:59:59,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 08:59:59,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 08:59:59,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 08:59:59,413 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 08:59:59,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 08:59:59,413 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 08:59:59,413 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 08:59:59,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 08:59:59,645 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 08:59:59,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 08:59:59,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 08:59:59,649 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 08:59:59,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2022-01-19 08:59:59,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0080446af/35c257d7c473484a8cbc1d8e6fa6cfab/FLAGb2cbb1a15 [2022-01-19 09:00:00,077 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 09:00:00,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2022-01-19 09:00:00,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0080446af/35c257d7c473484a8cbc1d8e6fa6cfab/FLAGb2cbb1a15 [2022-01-19 09:00:00,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0080446af/35c257d7c473484a8cbc1d8e6fa6cfab [2022-01-19 09:00:00,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 09:00:00,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 09:00:00,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 09:00:00,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 09:00:00,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 09:00:00,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72973bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00, skipping insertion in model container [2022-01-19 09:00:00,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 09:00:00,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 09:00:00,700 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-min.wvr.c[2815,2828] [2022-01-19 09:00:00,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:00:00,714 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 09:00:00,735 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-min.wvr.c[2815,2828] [2022-01-19 09:00:00,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 09:00:00,750 INFO L208 MainTranslator]: Completed translation [2022-01-19 09:00:00,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00 WrapperNode [2022-01-19 09:00:00,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 09:00:00,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 09:00:00,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 09:00:00,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 09:00:00,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,788 INFO L137 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 232 [2022-01-19 09:00:00,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 09:00:00,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 09:00:00,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 09:00:00,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 09:00:00,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 09:00:00,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 09:00:00,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 09:00:00,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 09:00:00,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (1/1) ... [2022-01-19 09:00:00,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 09:00:00,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:00:00,848 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 09:00:00,868 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 09:00:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 09:00:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 09:00:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 09:00:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 09:00:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 09:00:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 09:00:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 09:00:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 09:00:00,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 09:00:00,883 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 09:00:00,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 09:00:00,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 09:00:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 09:00:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 09:00:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 09:00:00,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 09:00:00,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 09:00:00,885 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 09:00:00,967 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 09:00:00,968 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 09:00:01,402 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 09:00:01,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 09:00:01,489 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 09:00:01,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:00:01 BoogieIcfgContainer [2022-01-19 09:00:01,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 09:00:01,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 09:00:01,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 09:00:01,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 09:00:01,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 09:00:00" (1/3) ... [2022-01-19 09:00:01,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66447c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:00:01, skipping insertion in model container [2022-01-19 09:00:01,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 09:00:00" (2/3) ... [2022-01-19 09:00:01,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66447c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 09:00:01, skipping insertion in model container [2022-01-19 09:00:01,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 09:00:01" (3/3) ... [2022-01-19 09:00:01,499 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2022-01-19 09:00:01,503 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 09:00:01,503 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 09:00:01,503 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 09:00:01,560 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,560 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,560 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,561 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,561 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,561 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,561 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,562 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,562 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,563 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,566 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,567 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,567 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,568 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,568 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,568 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,569 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,569 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,572 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,572 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,573 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,573 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,574 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,574 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,574 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,575 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,575 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,576 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,576 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,576 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,577 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,580 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 09:00:01,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,581 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,581 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 09:00:01,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,583 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 09:00:01,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,587 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 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,589 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,589 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,589 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,589 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,589 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,590 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,591 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,591 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,591 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,591 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,591 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,591 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,592 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,592 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,593 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,593 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,593 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,593 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,594 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,594 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,597 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 09:00:01,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,597 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 09:00:01,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,599 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,599 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,600 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~cond~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,600 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,601 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 09:00:01,604 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 09:00:01,643 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 09:00:01,648 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 09:00:01,649 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 09:00:01,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 298 places, 315 transitions, 654 flow [2022-01-19 09:00:01,780 INFO L129 PetriNetUnfolder]: 27/312 cut-off events. [2022-01-19 09:00:01,780 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 09:00:01,786 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 09:00:01,786 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 315 transitions, 654 flow [2022-01-19 09:00:01,792 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 301 transitions, 620 flow [2022-01-19 09:00:01,839 INFO L129 PetriNetUnfolder]: 27/300 cut-off events. [2022-01-19 09:00:01,839 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 09:00:01,839 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:01,840 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 09:00:01,840 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 09:00:01,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1810646857, now seen corresponding path program 1 times [2022-01-19 09:00:01,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941462180] [2022-01-19 09:00:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:01,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:02,123 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 09:00:02,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941462180] [2022-01-19 09:00:02,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941462180] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:00:02,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:00:02,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 09:00:02,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739134237] [2022-01-19 09:00:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:00:02,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 09:00:02,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 09:00:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 09:00:02,166 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 315 [2022-01-19 09:00:02,172 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 09:00:02,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:02,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 315 [2022-01-19 09:00:02,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:02,261 INFO L129 PetriNetUnfolder]: 22/329 cut-off events. [2022-01-19 09:00:02,261 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-01-19 09:00:02,264 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 09:00:02,267 INFO L132 encePairwiseOnDemand]: 297/315 looper letters, 8 selfloop transitions, 0 changer transitions 12/283 dead transitions. [2022-01-19 09:00:02,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 283 transitions, 600 flow [2022-01-19 09:00:02,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 09:00:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 09:00:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 602 transitions. [2022-01-19 09:00:02,288 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2022-01-19 09:00:02,289 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 602 transitions. [2022-01-19 09:00:02,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 602 transitions. [2022-01-19 09:00:02,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:02,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 602 transitions. [2022-01-19 09:00:02,305 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 09:00:02,317 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 09:00:02,318 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 09:00:02,320 INFO L186 Difference]: Start difference. First operand has 284 places, 301 transitions, 620 flow. Second operand 2 states and 602 transitions. [2022-01-19 09:00:02,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 283 transitions, 600 flow [2022-01-19 09:00:02,327 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 09:00:02,334 INFO L242 Difference]: Finished difference. Result has 279 places, 271 transitions, 548 flow [2022-01-19 09:00:02,336 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 09:00:02,340 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, -5 predicate places. [2022-01-19 09:00:02,341 INFO L470 AbstractCegarLoop]: Abstraction has has 279 places, 271 transitions, 548 flow [2022-01-19 09:00:02,341 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 09:00:02,342 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:02,342 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 09:00:02,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 09:00:02,342 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 09:00:02,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash 759378185, now seen corresponding path program 1 times [2022-01-19 09:00:02,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:02,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052669012] [2022-01-19 09:00:02,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:02,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:02,741 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 09:00:02,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:02,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052669012] [2022-01-19 09:00:02,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052669012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:00:02,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:00:02,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 09:00:02,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599510440] [2022-01-19 09:00:02,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:00:02,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 09:00:02,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:02,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 09:00:02,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-19 09:00:02,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 315 [2022-01-19 09:00:02,750 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 09:00:02,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:02,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 315 [2022-01-19 09:00:02,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:03,022 INFO L129 PetriNetUnfolder]: 202/783 cut-off events. [2022-01-19 09:00:03,022 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-01-19 09:00:03,026 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 09:00:03,031 INFO L132 encePairwiseOnDemand]: 297/315 looper letters, 91 selfloop transitions, 15 changer transitions 0/283 dead transitions. [2022-01-19 09:00:03,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 283 transitions, 784 flow [2022-01-19 09:00:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 09:00:03,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 09:00:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1629 transitions. [2022-01-19 09:00:03,040 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6464285714285715 [2022-01-19 09:00:03,040 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1629 transitions. [2022-01-19 09:00:03,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1629 transitions. [2022-01-19 09:00:03,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:03,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1629 transitions. [2022-01-19 09:00:03,045 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 09:00:03,049 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 09:00:03,051 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 09:00:03,051 INFO L186 Difference]: Start difference. First operand has 279 places, 271 transitions, 548 flow. Second operand 8 states and 1629 transitions. [2022-01-19 09:00:03,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 283 transitions, 784 flow [2022-01-19 09:00:03,054 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 09:00:03,060 INFO L242 Difference]: Finished difference. Result has 275 places, 274 transitions, 602 flow [2022-01-19 09:00:03,060 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 09:00:03,061 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, -9 predicate places. [2022-01-19 09:00:03,061 INFO L470 AbstractCegarLoop]: Abstraction has has 275 places, 274 transitions, 602 flow [2022-01-19 09:00:03,062 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 09:00:03,062 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:03,062 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 09:00:03,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 09:00:03,063 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 09:00:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:03,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1657129582, now seen corresponding path program 1 times [2022-01-19 09:00:03,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:03,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73977860] [2022-01-19 09:00:03,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:03,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:03,597 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 09:00:03,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73977860] [2022-01-19 09:00:03,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73977860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 09:00:03,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 09:00:03,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-19 09:00:03,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571698716] [2022-01-19 09:00:03,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:00:03,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-19 09:00:03,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:03,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-19 09:00:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2022-01-19 09:00:03,606 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 315 [2022-01-19 09:00:03,609 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 09:00:03,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:03,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 315 [2022-01-19 09:00:03,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:05,014 INFO L129 PetriNetUnfolder]: 765/2564 cut-off events. [2022-01-19 09:00:05,014 INFO L130 PetriNetUnfolder]: For 19/24 co-relation queries the response was YES. [2022-01-19 09:00:05,026 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 09:00:05,041 INFO L132 encePairwiseOnDemand]: 285/315 looper letters, 146 selfloop transitions, 31 changer transitions 20/357 dead transitions. [2022-01-19 09:00:05,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 357 transitions, 1173 flow [2022-01-19 09:00:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 09:00:05,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 09:00:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5638 transitions. [2022-01-19 09:00:05,055 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5593253968253968 [2022-01-19 09:00:05,055 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5638 transitions. [2022-01-19 09:00:05,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5638 transitions. [2022-01-19 09:00:05,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:05,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5638 transitions. [2022-01-19 09:00:05,072 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 09:00:05,090 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 09:00:05,094 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 09:00:05,095 INFO L186 Difference]: Start difference. First operand has 275 places, 274 transitions, 602 flow. Second operand 32 states and 5638 transitions. [2022-01-19 09:00:05,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 357 transitions, 1173 flow [2022-01-19 09:00:05,099 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 09:00:05,103 INFO L242 Difference]: Finished difference. Result has 307 places, 285 transitions, 703 flow [2022-01-19 09:00:05,104 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 09:00:05,106 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 23 predicate places. [2022-01-19 09:00:05,106 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 285 transitions, 703 flow [2022-01-19 09:00:05,107 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 09:00:05,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:05,108 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 09:00:05,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 09:00:05,108 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 09:00:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:05,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1010837465, now seen corresponding path program 1 times [2022-01-19 09:00:05,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:05,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602119226] [2022-01-19 09:00:05,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:05,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:05,291 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 09:00:05,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602119226] [2022-01-19 09:00:05,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602119226] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:05,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895576827] [2022-01-19 09:00:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:05,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:00:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:00:05,294 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 09:00:05,318 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 09:00:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:05,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 09:00:05,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:00:06,051 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 09:00:06,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:00:06,598 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 09:00:06,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895576827] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:00:06,599 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:00:06,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 09:00:06,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603826102] [2022-01-19 09:00:06,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:00:06,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 09:00:06,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 09:00:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 09:00:06,606 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 315 [2022-01-19 09:00:06,609 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 09:00:06,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:06,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 315 [2022-01-19 09:00:06,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:07,727 INFO L129 PetriNetUnfolder]: 1489/3795 cut-off events. [2022-01-19 09:00:07,727 INFO L130 PetriNetUnfolder]: For 445/539 co-relation queries the response was YES. [2022-01-19 09:00:07,739 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 09:00:07,755 INFO L132 encePairwiseOnDemand]: 286/315 looper letters, 133 selfloop transitions, 54 changer transitions 0/407 dead transitions. [2022-01-19 09:00:07,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 407 transitions, 1375 flow [2022-01-19 09:00:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 09:00:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 09:00:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4907 transitions. [2022-01-19 09:00:07,766 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7788888888888889 [2022-01-19 09:00:07,766 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4907 transitions. [2022-01-19 09:00:07,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4907 transitions. [2022-01-19 09:00:07,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:07,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4907 transitions. [2022-01-19 09:00:07,778 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 09:00:07,787 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 09:00:07,789 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 09:00:07,789 INFO L186 Difference]: Start difference. First operand has 307 places, 285 transitions, 703 flow. Second operand 20 states and 4907 transitions. [2022-01-19 09:00:07,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 407 transitions, 1375 flow [2022-01-19 09:00:07,798 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 09:00:07,803 INFO L242 Difference]: Finished difference. Result has 307 places, 322 transitions, 974 flow [2022-01-19 09:00:07,804 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 09:00:07,805 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 23 predicate places. [2022-01-19 09:00:07,805 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 322 transitions, 974 flow [2022-01-19 09:00:07,818 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 09:00:07,818 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:07,818 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 09:00:07,846 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 09:00:08,031 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 09:00:08,032 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 09:00:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:08,032 INFO L85 PathProgramCache]: Analyzing trace with hash -378664297, now seen corresponding path program 1 times [2022-01-19 09:00:08,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:08,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705500156] [2022-01-19 09:00:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:08,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:08,171 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 09:00:08,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:08,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705500156] [2022-01-19 09:00:08,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705500156] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:08,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472173920] [2022-01-19 09:00:08,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:08,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:00:08,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:00:08,176 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 09:00:08,203 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 09:00:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:08,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 09:00:08,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:00:08,861 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 09:00:08,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:00:09,541 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 09:00:09,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472173920] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:00:09,541 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:00:09,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 09:00:09,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234765964] [2022-01-19 09:00:09,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:00:09,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 09:00:09,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:09,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 09:00:09,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-19 09:00:09,547 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 315 [2022-01-19 09:00:09,551 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 09:00:09,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:09,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 315 [2022-01-19 09:00:09,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:10,798 INFO L129 PetriNetUnfolder]: 1561/3928 cut-off events. [2022-01-19 09:00:10,799 INFO L130 PetriNetUnfolder]: For 1471/1592 co-relation queries the response was YES. [2022-01-19 09:00:10,815 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 09:00:10,833 INFO L132 encePairwiseOnDemand]: 286/315 looper letters, 72 selfloop transitions, 30 changer transitions 89/408 dead transitions. [2022-01-19 09:00:10,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 408 transitions, 1642 flow [2022-01-19 09:00:10,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 09:00:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 09:00:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4847 transitions. [2022-01-19 09:00:10,844 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7693650793650794 [2022-01-19 09:00:10,844 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4847 transitions. [2022-01-19 09:00:10,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4847 transitions. [2022-01-19 09:00:10,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:10,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4847 transitions. [2022-01-19 09:00:10,854 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 09:00:10,863 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 09:00:10,864 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 09:00:10,865 INFO L186 Difference]: Start difference. First operand has 307 places, 322 transitions, 974 flow. Second operand 20 states and 4847 transitions. [2022-01-19 09:00:10,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 408 transitions, 1642 flow [2022-01-19 09:00:10,874 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 09:00:10,879 INFO L242 Difference]: Finished difference. Result has 327 places, 297 transitions, 872 flow [2022-01-19 09:00:10,879 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 09:00:10,880 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 43 predicate places. [2022-01-19 09:00:10,880 INFO L470 AbstractCegarLoop]: Abstraction has has 327 places, 297 transitions, 872 flow [2022-01-19 09:00:10,881 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 09:00:10,881 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:10,881 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 09:00:10,908 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 09:00:11,105 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 09:00:11,105 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 09:00:11,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash 257040978, now seen corresponding path program 2 times [2022-01-19 09:00:11,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:11,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91161471] [2022-01-19 09:00:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:11,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:11,235 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 09:00:11,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:11,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91161471] [2022-01-19 09:00:11,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91161471] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:11,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575951485] [2022-01-19 09:00:11,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 09:00:11,236 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:00:11,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:00:11,237 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 09:00:11,239 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 09:00:11,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 09:00:11,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:00:11,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 09:00:11,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:00:11,828 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 09:00:11,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:00:12,304 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 09:00:12,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575951485] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:12,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 09:00:12,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 09:00:12,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138673579] [2022-01-19 09:00:12,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:00:12,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 09:00:12,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:12,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 09:00:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 09:00:12,309 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 315 [2022-01-19 09:00:12,311 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 09:00:12,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:12,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 315 [2022-01-19 09:00:12,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:12,736 INFO L129 PetriNetUnfolder]: 826/1975 cut-off events. [2022-01-19 09:00:12,736 INFO L130 PetriNetUnfolder]: For 1591/1642 co-relation queries the response was YES. [2022-01-19 09:00:12,746 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 09:00:12,757 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 78 selfloop transitions, 10 changer transitions 0/309 dead transitions. [2022-01-19 09:00:12,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 309 transitions, 1100 flow [2022-01-19 09:00:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 09:00:12,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 09:00:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2444 transitions. [2022-01-19 09:00:12,762 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7758730158730158 [2022-01-19 09:00:12,762 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2444 transitions. [2022-01-19 09:00:12,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2444 transitions. [2022-01-19 09:00:12,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:12,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2444 transitions. [2022-01-19 09:00:12,769 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 09:00:12,774 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 09:00:12,775 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 09:00:12,775 INFO L186 Difference]: Start difference. First operand has 327 places, 297 transitions, 872 flow. Second operand 10 states and 2444 transitions. [2022-01-19 09:00:12,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 309 transitions, 1100 flow [2022-01-19 09:00:12,780 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 09:00:12,786 INFO L242 Difference]: Finished difference. Result has 303 places, 299 transitions, 840 flow [2022-01-19 09:00:12,787 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 09:00:12,789 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 19 predicate places. [2022-01-19 09:00:12,789 INFO L470 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 840 flow [2022-01-19 09:00:12,790 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 09:00:12,790 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:12,791 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 09:00:12,809 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 09:00:12,999 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 09:00:13,000 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 09:00:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1172583244, now seen corresponding path program 1 times [2022-01-19 09:00:13,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:13,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066913494] [2022-01-19 09:00:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:13,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:13,135 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 09:00:13,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:13,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066913494] [2022-01-19 09:00:13,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066913494] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:13,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350840887] [2022-01-19 09:00:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:13,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:00:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:00:13,137 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 09:00:13,144 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 09:00:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:13,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 09:00:13,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:00:13,794 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 09:00:13,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:00:14,386 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 09:00:14,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350840887] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:14,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 09:00:14,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 09:00:14,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213076629] [2022-01-19 09:00:14,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:00:14,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 09:00:14,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:14,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 09:00:14,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 09:00:14,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 315 [2022-01-19 09:00:14,392 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 09:00:14,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:14,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 315 [2022-01-19 09:00:14,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:14,985 INFO L129 PetriNetUnfolder]: 1352/3191 cut-off events. [2022-01-19 09:00:14,985 INFO L130 PetriNetUnfolder]: For 1676/2026 co-relation queries the response was YES. [2022-01-19 09:00:14,998 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 09:00:15,013 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 85 selfloop transitions, 10 changer transitions 0/312 dead transitions. [2022-01-19 09:00:15,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 312 transitions, 1080 flow [2022-01-19 09:00:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 09:00:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 09:00:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2409 transitions. [2022-01-19 09:00:15,019 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7647619047619048 [2022-01-19 09:00:15,019 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2409 transitions. [2022-01-19 09:00:15,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2409 transitions. [2022-01-19 09:00:15,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:15,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2409 transitions. [2022-01-19 09:00:15,024 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 09:00:15,029 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 09:00:15,030 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 09:00:15,030 INFO L186 Difference]: Start difference. First operand has 303 places, 299 transitions, 840 flow. Second operand 10 states and 2409 transitions. [2022-01-19 09:00:15,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 312 transitions, 1080 flow [2022-01-19 09:00:15,037 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 09:00:15,041 INFO L242 Difference]: Finished difference. Result has 310 places, 300 transitions, 863 flow [2022-01-19 09:00:15,041 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 09:00:15,042 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 26 predicate places. [2022-01-19 09:00:15,042 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 300 transitions, 863 flow [2022-01-19 09:00:15,042 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 09:00:15,042 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:15,043 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 09:00:15,067 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 09:00:15,259 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 09:00:15,260 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 09:00:15,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2099191554, now seen corresponding path program 1 times [2022-01-19 09:00:15,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:15,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252848503] [2022-01-19 09:00:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:15,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:15,364 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 09:00:15,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:15,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252848503] [2022-01-19 09:00:15,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252848503] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:15,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738772838] [2022-01-19 09:00:15,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:15,365 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:00:15,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:00:15,366 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 09:00:15,391 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 09:00:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:15,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 09:00:15,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:00:15,993 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 09:00:15,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:00:16,550 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 09:00:16,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738772838] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:16,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 09:00:16,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 19 [2022-01-19 09:00:16,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127997877] [2022-01-19 09:00:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 09:00:16,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 09:00:16,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:16,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 09:00:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-19 09:00:16,555 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 315 [2022-01-19 09:00:16,556 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 09:00:16,556 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:16,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 315 [2022-01-19 09:00:16,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:00:16,963 INFO L129 PetriNetUnfolder]: 778/1843 cut-off events. [2022-01-19 09:00:16,963 INFO L130 PetriNetUnfolder]: For 1532/1946 co-relation queries the response was YES. [2022-01-19 09:00:16,969 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 09:00:16,978 INFO L132 encePairwiseOnDemand]: 304/315 looper letters, 81 selfloop transitions, 10 changer transitions 0/309 dead transitions. [2022-01-19 09:00:16,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 309 transitions, 1077 flow [2022-01-19 09:00:16,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 09:00:16,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 09:00:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2435 transitions. [2022-01-19 09:00:16,982 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.773015873015873 [2022-01-19 09:00:16,982 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2435 transitions. [2022-01-19 09:00:16,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2435 transitions. [2022-01-19 09:00:16,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:00:16,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2435 transitions. [2022-01-19 09:00:16,986 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 09:00:16,990 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 09:00:16,991 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 09:00:16,991 INFO L186 Difference]: Start difference. First operand has 310 places, 300 transitions, 863 flow. Second operand 10 states and 2435 transitions. [2022-01-19 09:00:16,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 309 transitions, 1077 flow [2022-01-19 09:00:16,995 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 09:00:16,999 INFO L242 Difference]: Finished difference. Result has 312 places, 299 transitions, 871 flow [2022-01-19 09:00:16,999 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 09:00:17,000 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 28 predicate places. [2022-01-19 09:00:17,000 INFO L470 AbstractCegarLoop]: Abstraction has has 312 places, 299 transitions, 871 flow [2022-01-19 09:00:17,000 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 09:00:17,000 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:00:17,001 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 09:00:17,026 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 09:00:17,215 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 09:00:17,216 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 09:00:17,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:00:17,216 INFO L85 PathProgramCache]: Analyzing trace with hash -817599591, now seen corresponding path program 1 times [2022-01-19 09:00:17,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:00:17,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776637138] [2022-01-19 09:00:17,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:17,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:00:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:18,748 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 09:00:18,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:00:18,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776637138] [2022-01-19 09:00:18,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776637138] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:00:18,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262952064] [2022-01-19 09:00:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:00:18,749 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:00:18,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:00:18,750 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 09:00:18,750 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 09:00:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:00:18,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-19 09:00:18,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:00:19,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:00:19,337 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 09:00:20,788 INFO L353 Elim1Store]: treesize reduction 56, result has 45.6 percent of original size [2022-01-19 09:00:20,788 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 09:00:29,313 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:00:29,313 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 163 treesize of output 127 [2022-01-19 09:00:29,619 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 09:00:29,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:00:39,269 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:00:39,269 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 09:00:40,506 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 09:00:40,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262952064] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:00:40,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:00:40,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 32, 29] total 90 [2022-01-19 09:00:40,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141404280] [2022-01-19 09:00:40,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:00:40,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2022-01-19 09:00:40,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:00:40,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2022-01-19 09:00:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=7589, Unknown=8, NotChecked=0, Total=8010 [2022-01-19 09:00:40,522 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 315 [2022-01-19 09:00:40,528 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 09:00:40,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:00:40,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 315 [2022-01-19 09:00:40,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:01:05,774 INFO L129 PetriNetUnfolder]: 36729/57747 cut-off events. [2022-01-19 09:01:05,775 INFO L130 PetriNetUnfolder]: For 43536/43536 co-relation queries the response was YES. [2022-01-19 09:01:06,091 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 09:01:06,360 INFO L132 encePairwiseOnDemand]: 226/315 looper letters, 885 selfloop transitions, 349 changer transitions 20/1347 dead transitions. [2022-01-19 09:01:06,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1347 transitions, 6881 flow [2022-01-19 09:01:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-01-19 09:01:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2022-01-19 09:01:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 12428 transitions. [2022-01-19 09:01:06,380 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.3722072476789458 [2022-01-19 09:01:06,380 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 12428 transitions. [2022-01-19 09:01:06,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 12428 transitions. [2022-01-19 09:01:06,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:01:06,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 12428 transitions. [2022-01-19 09:01:06,495 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 09:01:06,532 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 09:01:06,539 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 09:01:06,539 INFO L186 Difference]: Start difference. First operand has 312 places, 299 transitions, 871 flow. Second operand 106 states and 12428 transitions. [2022-01-19 09:01:06,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1347 transitions, 6881 flow [2022-01-19 09:01:07,072 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 09:01:07,084 INFO L242 Difference]: Finished difference. Result has 458 places, 611 transitions, 3215 flow [2022-01-19 09:01:07,084 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 09:01:07,085 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 174 predicate places. [2022-01-19 09:01:07,085 INFO L470 AbstractCegarLoop]: Abstraction has has 458 places, 611 transitions, 3215 flow [2022-01-19 09:01:07,087 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 09:01:07,087 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:01:07,088 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 09:01:07,114 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 09:01:07,309 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 09:01:07,310 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 09:01:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:01:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1130145813, now seen corresponding path program 2 times [2022-01-19 09:01:07,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:01:07,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599813785] [2022-01-19 09:01:07,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:01:07,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:01:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:01:09,161 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 09:01:09,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:01:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599813785] [2022-01-19 09:01:09,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599813785] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:01:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459056461] [2022-01-19 09:01:09,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 09:01:09,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:01:09,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:01:09,163 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 09:01:09,164 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 09:01:09,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 09:01:09,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:01:09,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 100 conjunts are in the unsatisfiable core [2022-01-19 09:01:09,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:01:10,981 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:01:10,982 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 21 [2022-01-19 09:01:12,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:01:12,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:01:12,710 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 09:01:12,710 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 09:01:12,939 INFO L353 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2022-01-19 09:01:12,939 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 41 treesize of output 59 [2022-01-19 09:01:20,119 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:01:20,119 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 146 treesize of output 112 [2022-01-19 09:01:20,434 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 09:01:20,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:01:38,987 WARN L838 $PredicateComparison]: unable to prove that (and (<= (+ c_~mina~0 c_~minb~0) c_~minc~0) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~mina~0 c_~minb~0) (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))))))) is different from false [2022-01-19 09:01:39,018 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= (+ c_~mina~0 c_~minb~0) c_~minc~0) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~mina~0 c_~minb~0) (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_thread1Thread1of1ForFork2_#t~mem4| c_~minb~0)) is different from false [2022-01-19 09:01:39,029 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= (+ c_~mina~0 c_~minb~0) c_~minc~0) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~mina~0 c_~minb~0) (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))))))) (<= (select (select |c_#memory_int| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) c_~minb~0)) is different from false [2022-01-19 09:01:39,052 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= (+ c_~mina~0 c_~minb~0) c_~minc~0) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~mina~0 c_~minb~0) (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_thread1Thread1of1ForFork2_#t~mem2| c_~mina~0) (<= (select (select |c_#memory_int| c_~B~0.base) (+ (* c_thread1Thread1of1ForFork2_~i~0 4) c_~B~0.offset)) c_~minb~0)) is different from false [2022-01-19 09:01:39,086 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:01:39,086 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 09:01:39,095 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:01:39,095 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 09:01:41,723 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 09:01:41,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459056461] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:01:41,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:01:41,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 46, 42] total 117 [2022-01-19 09:01:41,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155155447] [2022-01-19 09:01:41,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:01:41,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-01-19 09:01:41,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:01:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-01-19 09:01:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=12088, Unknown=27, NotChecked=900, Total=13572 [2022-01-19 09:01:41,738 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 315 [2022-01-19 09:01:41,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 611 transitions, 3215 flow. Second operand has 117 states, 117 states have (on average 103.8119658119658) internal successors, (12146), 117 states have internal predecessors, (12146), 0 states have call successors, (0), 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 09:01:41,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:01:41,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 315 [2022-01-19 09:01:41,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:02:17,679 INFO L129 PetriNetUnfolder]: 65930/102730 cut-off events. [2022-01-19 09:02:17,680 INFO L130 PetriNetUnfolder]: For 552893/553130 co-relation queries the response was YES. [2022-01-19 09:02:19,056 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385468 conditions, 102730 events. 65930/102730 cut-off events. For 552893/553130 co-relation queries the response was YES. Maximal size of possible extension queue 3148. Compared 864267 event pairs, 9820 based on Foata normal form. 19/98704 useless extension candidates. Maximal degree in co-relation 385399. Up to 16604 conditions per place. [2022-01-19 09:02:19,471 INFO L132 encePairwiseOnDemand]: 224/315 looper letters, 862 selfloop transitions, 502 changer transitions 20/1473 dead transitions. [2022-01-19 09:02:19,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 1473 transitions, 11674 flow [2022-01-19 09:02:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-01-19 09:02:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-01-19 09:02:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 9564 transitions. [2022-01-19 09:02:19,483 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.345021645021645 [2022-01-19 09:02:19,484 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 9564 transitions. [2022-01-19 09:02:19,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 9564 transitions. [2022-01-19 09:02:19,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:02:19,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 9564 transitions. [2022-01-19 09:02:19,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 108.68181818181819) internal successors, (9564), 88 states have internal predecessors, (9564), 0 states have call successors, (0), 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 09:02:19,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 315.0) internal successors, (28035), 89 states have internal predecessors, (28035), 0 states have call successors, (0), 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 09:02:19,518 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 315.0) internal successors, (28035), 89 states have internal predecessors, (28035), 0 states have call successors, (0), 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 09:02:19,518 INFO L186 Difference]: Start difference. First operand has 458 places, 611 transitions, 3215 flow. Second operand 88 states and 9564 transitions. [2022-01-19 09:02:19,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 1473 transitions, 11674 flow [2022-01-19 09:02:29,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 1473 transitions, 11366 flow, removed 52 selfloop flow, removed 35 redundant places. [2022-01-19 09:02:29,035 INFO L242 Difference]: Finished difference. Result has 530 places, 907 transitions, 7066 flow [2022-01-19 09:02:29,036 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=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=7066, PETRI_PLACES=530, PETRI_TRANSITIONS=907} [2022-01-19 09:02:29,037 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 246 predicate places. [2022-01-19 09:02:29,037 INFO L470 AbstractCegarLoop]: Abstraction has has 530 places, 907 transitions, 7066 flow [2022-01-19 09:02:29,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 103.8119658119658) internal successors, (12146), 117 states have internal predecessors, (12146), 0 states have call successors, (0), 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 09:02:29,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:02:29,038 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 09:02:29,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-19 09:02:29,239 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 09:02:29,239 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 09:02:29,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:02:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash -355199359, now seen corresponding path program 3 times [2022-01-19 09:02:29,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:02:29,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382965104] [2022-01-19 09:02:29,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:02:29,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:02:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:02:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-19 09:02:31,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:02:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382965104] [2022-01-19 09:02:31,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382965104] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:02:31,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632759453] [2022-01-19 09:02:31,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 09:02:31,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:02:31,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:02:31,643 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 09:02:31,644 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 09:02:31,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 09:02:31,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:02:31,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 96 conjunts are in the unsatisfiable core [2022-01-19 09:02:31,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:02:31,840 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 09:02:32,067 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 09:02:32,067 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 09:02:32,503 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-19 09:02:32,504 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 09:02:33,118 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 09:02:33,902 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 09:02:35,955 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 82 treesize of output 34 [2022-01-19 09:02:36,180 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 09:02:36,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:02:37,030 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:02:37,030 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 09:02:38,051 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 09:02:39,078 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:02:39,078 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 96 treesize of output 122 [2022-01-19 09:02:39,553 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:02:39,553 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 41 treesize of output 45 [2022-01-19 09:02:39,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:02:39,821 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 310 treesize of output 406 [2022-01-19 09:04:37,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 09:04:37,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 09:04:39,114 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 09:04:39,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632759453] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 09:04:39,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 09:04:39,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 45, 45] total 132 [2022-01-19 09:04:39,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285233466] [2022-01-19 09:04:39,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 09:04:39,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-01-19 09:04:39,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 09:04:39,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-01-19 09:04:39,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=16714, Unknown=0, NotChecked=0, Total=17292 [2022-01-19 09:04:39,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 315 [2022-01-19 09:04:39,135 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 907 transitions, 7066 flow. Second operand has 132 states, 132 states have (on average 96.52272727272727) internal successors, (12741), 132 states have internal predecessors, (12741), 0 states have call successors, (0), 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 09:04:39,135 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 09:04:39,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 315 [2022-01-19 09:04:39,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 09:06:28,052 INFO L129 PetriNetUnfolder]: 159674/245354 cut-off events. [2022-01-19 09:06:28,053 INFO L130 PetriNetUnfolder]: For 2362292/2365421 co-relation queries the response was YES. [2022-01-19 09:06:32,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1236399 conditions, 245354 events. 159674/245354 cut-off events. For 2362292/2365421 co-relation queries the response was YES. Maximal size of possible extension queue 6475. Compared 2243179 event pairs, 8857 based on Foata normal form. 146/237614 useless extension candidates. Maximal degree in co-relation 1236308. Up to 42413 conditions per place. [2022-01-19 09:06:33,982 INFO L132 encePairwiseOnDemand]: 216/315 looper letters, 2099 selfloop transitions, 1487 changer transitions 82/3754 dead transitions. [2022-01-19 09:06:33,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 3754 transitions, 39428 flow [2022-01-19 09:06:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2022-01-19 09:06:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2022-01-19 09:06:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 19304 transitions. [2022-01-19 09:06:34,011 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.33125697125697123 [2022-01-19 09:06:34,011 INFO L72 ComplementDD]: Start complementDD. Operand 185 states and 19304 transitions. [2022-01-19 09:06:34,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 19304 transitions. [2022-01-19 09:06:34,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 09:06:34,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 185 states and 19304 transitions. [2022-01-19 09:06:34,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 186 states, 185 states have (on average 104.34594594594594) internal successors, (19304), 185 states have internal predecessors, (19304), 0 states have call successors, (0), 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 09:06:34,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 186 states, 186 states have (on average 315.0) internal successors, (58590), 186 states have internal predecessors, (58590), 0 states have call successors, (0), 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 09:06:34,107 INFO L81 ComplementDD]: Finished complementDD. Result has 186 states, 186 states have (on average 315.0) internal successors, (58590), 186 states have internal predecessors, (58590), 0 states have call successors, (0), 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 09:06:34,107 INFO L186 Difference]: Start difference. First operand has 530 places, 907 transitions, 7066 flow. Second operand 185 states and 19304 transitions. [2022-01-19 09:06:34,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 3754 transitions, 39428 flow [2022-01-19 09:07:34,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 3754 transitions, 38245 flow, removed 507 selfloop flow, removed 52 redundant places. [2022-01-19 09:07:34,515 INFO L242 Difference]: Finished difference. Result has 756 places, 2080 transitions, 24542 flow [2022-01-19 09:07:34,516 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=315, PETRI_DIFFERENCE_MINUEND_FLOW=6837, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=907, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=429, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=185, PETRI_FLOW=24542, PETRI_PLACES=756, PETRI_TRANSITIONS=2080} [2022-01-19 09:07:34,516 INFO L334 CegarLoopForPetriNet]: 284 programPoint places, 472 predicate places. [2022-01-19 09:07:34,516 INFO L470 AbstractCegarLoop]: Abstraction has has 756 places, 2080 transitions, 24542 flow [2022-01-19 09:07:34,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 96.52272727272727) internal successors, (12741), 132 states have internal predecessors, (12741), 0 states have call successors, (0), 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 09:07:34,518 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 09:07:34,518 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 09:07:34,535 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 09:07:34,720 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 09:07:34,720 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 09:07:34,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 09:07:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1137187053, now seen corresponding path program 4 times [2022-01-19 09:07:34,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 09:07:34,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136780675] [2022-01-19 09:07:34,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 09:07:34,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 09:07:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 09:07:36,737 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 09:07:36,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 09:07:36,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136780675] [2022-01-19 09:07:36,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136780675] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 09:07:36,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673183227] [2022-01-19 09:07:36,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 09:07:36,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 09:07:36,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 09:07:36,739 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 09:07:36,740 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 09:07:36,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 09:07:36,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 09:07:36,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 140 conjunts are in the unsatisfiable core [2022-01-19 09:07:36,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 09:07:36,919 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 09:07:36,964 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-19 09:07:36,964 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 09:07:37,024 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-19 09:07:37,025 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 09:07:37,415 INFO L353 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-01-19 09:07:37,415 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 09:07:37,999 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 09:07:38,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:38,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:38,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:38,794 INFO L353 Elim1Store]: treesize reduction 42, result has 19.2 percent of original size [2022-01-19 09:07:38,794 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 09:07:39,233 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 09:07:39,622 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 09:07:40,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:40,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:40,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:40,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:40,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:40,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:40,855 INFO L353 Elim1Store]: treesize reduction 32, result has 22.0 percent of original size [2022-01-19 09:07:40,855 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 09:07:41,190 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 09:07:41,392 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 09:07:45,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:45,231 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 09:07:45,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:45,633 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 09:07:45,956 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-19 09:07:45,957 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 09:07:46,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:46,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 09:07:46,288 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 48 treesize of output 52 [2022-01-19 09:07:49,482 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-19 09:07:49,482 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 111 treesize of output 43 [2022-01-19 09:07:49,608 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 09:07:49,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 09:07:50,709 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_~mina~0 c_~minb~0))) (and (<= .cse0 c_~minc~0) (<= .cse0 (select (select .cse1 c_~C~0.base) (+ ~C~0.offset 4))))) (< v_ArrVal_625 (+ (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)))) (<= (select (select .cse1 c_~B~0.base) (+ 4 c_~B~0.offset)) c_~minb~0) (<= (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset 4)) c_~mina~0))))) is different from false [2022-01-19 09:07:50,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_626 (Array Int Int)) (v_ArrVal_625 Int)) (let ((.cse3 (+ ~C~0.offset 4))) (let ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (store (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) .cse3 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) .cse1) c_~mina~0) (let ((.cse2 (+ c_~mina~0 c_~minb~0))) (and (<= .cse2 c_~minc~0) (<= .cse2 (select (select .cse0 c_~C~0.base) .cse3)))) (< v_ArrVal_625 (+ (select (select |c_#memory_int| c_~A~0.base) .cse1) (select (select |c_#memory_int| c_~B~0.base) .cse4))) (<= (select (select .cse0 c_~B~0.base) .cse4) c_~minb~0))))) is different from false [2022-01-19 09:07:51,015 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 ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_623)) (.cse2 (+ ~C~0.offset 4))) (let ((.cse1 (store (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ 4 c_~B~0.offset)) (.cse3 (+ c_~A~0.offset 4))) (or (let ((.cse0 (+ c_~mina~0 c_~minb~0))) (and (<= .cse0 c_~minc~0) (<= .cse0 (select (select .cse1 c_~C~0.base) .cse2)))) (<= (select (select .cse1 c_~A~0.base) .cse3) c_~mina~0) (<= (select (select .cse1 c_~B~0.base) .cse4) c_~minb~0) (< v_ArrVal_625 (+ (select (select .cse5 c_~B~0.base) .cse4) (select (select .cse5 c_~A~0.base) .cse3))))))) is different from false [2022-01-19 09:07:51,595 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 ((.cse2 (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 ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (store (store .cse2 c_~C~0.base (store (select .cse2 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse3 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) .cse1) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse2 c_~A~0.base) .cse1) (select (select .cse2 c_~B~0.base) .cse3))) (let ((.cse4 (+ c_~mina~0 c_~minb~0))) (and (<= .cse4 c_~minc~0) (<= .cse4 (select (select .cse0 c_~C~0.base) .cse5)))) (<= (select (select .cse0 c_~B~0.base) .cse3) c_~minb~0))))) is different from false [2022-01-19 09:07:52,356 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 ((.cse4 (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)) (.cse2 (+ ~C~0.offset 4))) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse1 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (+ 4 c_~B~0.offset))) (or (let ((.cse0 (+ c_~mina~0 c_~minb~0))) (and (<= .cse0 (select (select .cse1 c_~C~0.base) .cse2)) (<= .cse0 |c_ULTIMATE.start_main_#t~ret21#1|))) (<= (select (select .cse1 c_~A~0.base) .cse3) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse3) (select (select .cse4 c_~B~0.base) .cse5))) (<= (select (select .cse1 c_~B~0.base) .cse5) c_~minb~0))))) is different from false [2022-01-19 09:07:52,662 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 ((.cse2 (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 ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (store (store .cse2 c_~C~0.base (store (select .cse2 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse3 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) .cse1) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse2 c_~A~0.base) .cse1) (select (select .cse2 c_~B~0.base) .cse3))) (let ((.cse4 (+ c_~mina~0 c_~minb~0))) (and (<= .cse4 (select (select .cse0 c_~C~0.base) .cse5)) (<= .cse4 |c_ULTIMATE.start_plus_#res#1|))) (<= (select (select .cse0 c_~B~0.base) .cse3) c_~minb~0))))) is different from false [2022-01-19 09:07:52,771 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 ((.cse4 (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)) (.cse3 (+ ~C~0.offset 4))) (let ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) .cse3 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) .cse1) c_~mina~0) (let ((.cse2 (+ c_~mina~0 c_~minb~0))) (and (<= .cse2 (+ |c_ULTIMATE.start_plus_~a#1| |c_ULTIMATE.start_plus_~b#1|)) (<= .cse2 (select (select .cse0 c_~C~0.base) .cse3)))) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse1) (select (select .cse4 c_~B~0.base) .cse5))) (<= (select (select .cse0 c_~B~0.base) .cse5) c_~minb~0))))) is different from false [2022-01-19 09:07:54,614 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 ((.cse2 (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 ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (store (store .cse2 c_~C~0.base (store (select .cse2 c_~C~0.base) .cse5 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse3 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) .cse1) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse2 c_~A~0.base) .cse1) (select (select .cse2 c_~B~0.base) .cse3))) (let ((.cse4 (+ c_~mina~0 c_~minb~0))) (and (<= .cse4 (select (select .cse0 c_~C~0.base) .cse5)) (<= .cse4 (+ |c_ULTIMATE.start_plus_~a#1| |c_ULTIMATE.start_plus_#in~b#1|)))) (<= (select (select .cse0 c_~B~0.base) .cse3) c_~minb~0))))) is different from false [2022-01-19 09:07:54,785 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 ((.cse4 (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)) (.cse2 (+ ~C~0.offset 4))) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse1 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (+ 4 c_~B~0.offset))) (or (let ((.cse0 (+ c_~mina~0 c_~minb~0))) (and (<= .cse0 (select (select .cse1 c_~C~0.base) .cse2)) (<= .cse0 (+ |c_ULTIMATE.start_plus_#in~b#1| |c_ULTIMATE.start_plus_#in~a#1|)))) (<= (select (select .cse1 c_~A~0.base) .cse3) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse3) (select (select .cse4 c_~B~0.base) .cse5))) (<= (select (select .cse1 c_~B~0.base) .cse5) c_~minb~0))))) is different from false [2022-01-19 09:07:55,365 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 ((.cse4 (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)) (.cse2 (+ ~C~0.offset 4))) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse1 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (+ 4 c_~B~0.offset))) (or (let ((.cse0 (+ c_~mina~0 c_~minb~0))) (and (<= .cse0 (+ |c_ULTIMATE.start_main_#t~mem19#1| |c_ULTIMATE.start_main_#t~mem20#1|)) (<= .cse0 (select (select .cse1 c_~C~0.base) .cse2)))) (<= (select (select .cse1 c_~A~0.base) .cse3) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse3) (select (select .cse4 c_~B~0.base) .cse5))) (<= (select (select .cse1 c_~B~0.base) .cse5) c_~minb~0))))) is different from false [2022-01-19 09:07:55,774 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 ((.cse4 (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)) (.cse2 (+ ~C~0.offset 4))) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse1 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (+ 4 c_~B~0.offset))) (or (let ((.cse0 (+ c_~mina~0 c_~minb~0))) (and (<= .cse0 (select (select .cse1 c_~C~0.base) .cse2)) (<= .cse0 (+ |c_ULTIMATE.start_main_#t~mem19#1| (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset))))) (<= (select (select .cse1 c_~A~0.base) .cse3) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse3) (select (select .cse4 c_~B~0.base) .cse5))) (<= (select (select .cse1 c_~B~0.base) .cse5) c_~minb~0))))) is different from false [2022-01-19 09:07:56,008 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 ((.cse4 (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)) (.cse2 (+ ~C~0.offset 4))) (let ((.cse3 (+ c_~A~0.offset 4)) (.cse1 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (+ 4 c_~B~0.offset))) (or (let ((.cse0 (+ c_~mina~0 c_~minb~0))) (and (<= .cse0 (select (select .cse1 c_~C~0.base) .cse2)) (<= .cse0 (+ (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))))) (<= (select (select .cse1 c_~A~0.base) .cse3) c_~mina~0) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse3) (select (select .cse4 c_~B~0.base) .cse5))) (<= (select (select .cse1 c_~B~0.base) .cse5) c_~minb~0))))) is different from false [2022-01-19 09:07:56,453 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 ((.cse4 (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)) (.cse3 (+ ~C~0.offset 4))) (let ((.cse1 (+ c_~A~0.offset 4)) (.cse0 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) .cse3 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse5 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~A~0.base) .cse1) c_~mina~0) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem18#1| c_~mina~0))) (and (<= .cse2 (select (select .cse0 c_~C~0.base) .cse3)) (<= .cse2 (+ (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))))) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse1) (select (select .cse4 c_~B~0.base) .cse5))) (<= (select (select .cse0 c_~B~0.base) .cse5) |c_ULTIMATE.start_main_#t~mem18#1|))))) is different from false [2022-01-19 09:07:56,677 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 ((.cse5 (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)) (.cse2 (+ ~C~0.offset 4))) (let ((.cse1 (store (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) .cse2 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse3 (+ c_~A~0.offset 4)) (.cse4 (+ 4 c_~B~0.offset))) (or (and (<= (+ .cse0 c_~mina~0) (select (select .cse1 c_~C~0.base) .cse2)) (<= c_~mina~0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (<= (select (select .cse1 c_~A~0.base) .cse3) c_~mina~0) (<= (select (select .cse1 c_~B~0.base) .cse4) .cse0) (< v_ArrVal_625 (+ (select (select .cse5 c_~A~0.base) .cse3) (select (select .cse5 c_~B~0.base) .cse4))))))) is different from false [2022-01-19 09:07:57,097 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 ((.cse5 (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)) (.cse3 (+ ~C~0.offset 4))) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse0 (store (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) .cse3 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ c_~A~0.offset 4)) (.cse1 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~B~0.base) .cse1) .cse2) (and (<= |c_ULTIMATE.start_main_#t~mem17#1| (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (<= (+ |c_ULTIMATE.start_main_#t~mem17#1| .cse2) (select (select .cse0 c_~C~0.base) .cse3))) (<= (select (select .cse0 c_~A~0.base) .cse4) |c_ULTIMATE.start_main_#t~mem17#1|) (< v_ArrVal_625 (+ (select (select .cse5 c_~A~0.base) .cse4) (select (select .cse5 c_~B~0.base) .cse1))))))) is different from false [2022-01-19 09:07:57,161 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)) (.cse6 (+ ~C~0.offset 4))) (let ((.cse1 (+ 4 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse0 (store (store .cse3 c_~C~0.base (store (select .cse3 c_~C~0.base) .cse6 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626))) (or (<= (select (select .cse0 c_~B~0.base) .cse1) .cse2) (< v_ArrVal_625 (+ (select (select .cse3 c_~A~0.base) .cse4) (select (select .cse3 c_~B~0.base) .cse1))) (<= (select (select .cse0 c_~A~0.base) .cse4) .cse5) (<= (+ .cse5 .cse2) (select (select .cse0 c_~C~0.base) .cse6)))))) is different from false [2022-01-19 09:07:57,325 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)) (.cse4 (+ ~C~0.offset 4))) (let ((.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse0 (store (store .cse6 |c_ULTIMATE.start_main_#t~ret16#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~ret16#1.base|) .cse4 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse5 (+ c_~A~0.offset 4)) (.cse1 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~B~0.base) .cse1) .cse2) (<= (+ .cse3 .cse2) (select (select .cse0 |c_ULTIMATE.start_main_#t~ret16#1.base|) .cse4)) (<= (select (select .cse0 c_~A~0.base) .cse5) .cse3) (< v_ArrVal_625 (+ (select (select .cse6 c_~A~0.base) .cse5) (select (select .cse6 c_~B~0.base) .cse1))))))) is different from false [2022-01-19 09:07:57,413 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)) (.cse5 (+ ~C~0.offset 4))) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse0 (store (store .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| (store (select .cse6 |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)) (.cse3 (+ c_~A~0.offset 4)) (.cse1 (+ 4 c_~B~0.offset))) (or (<= (select (select .cse0 c_~B~0.base) .cse1) .cse2) (<= (select (select .cse0 c_~A~0.base) .cse3) .cse4) (<= (+ .cse4 .cse2) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse5)) (< v_ArrVal_625 (+ (select (select .cse6 c_~A~0.base) .cse3) (select (select .cse6 c_~B~0.base) .cse1))))))) is different from false [2022-01-19 09:07:57,460 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)) (.cse3 (+ ~C~0.offset 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse2 (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|) .cse3 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse1 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse4 (+ c_~A~0.offset 4)) (.cse5 (+ 4 c_~B~0.offset))) (or (<= (+ .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3)) (<= (select (select .cse2 c_~A~0.base) .cse4) .cse0) (<= (select (select .cse2 c_~B~0.base) .cse5) .cse1) (< v_ArrVal_625 (+ (select (select .cse6 c_~A~0.base) .cse4) (select (select .cse6 c_~B~0.base) .cse5))))))) is different from false [2022-01-19 09:07:57,735 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)) (.cse6 (+ ~C~0.offset 4))) (let ((.cse1 (+ 4 c_~B~0.offset)) (.cse2 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse0 (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|) .cse6 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse4 (+ c_~A~0.offset 4)) (.cse5 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (<= (select (select .cse0 c_~B~0.base) .cse1) .cse2) (< v_ArrVal_625 (+ (select (select .cse3 c_~B~0.base) .cse1) (select (select .cse3 c_~A~0.base) .cse4))) (<= (+ .cse5 .cse2) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6)) (<= (select (select .cse0 c_~A~0.base) .cse4) .cse5)))))) is different from false [2022-01-19 09:07:58,311 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 ((.cse4 (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)) (.cse3 (+ ~C~0.offset 4))) (let ((.cse5 (+ c_~A~0.offset 4)) (.cse0 (select (select .cse7 c_~A~0.base) c_~A~0.offset)) (.cse2 (store (store .cse4 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base| (store (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base|) .cse3 v_ArrVal_625)) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_626)) (.cse6 (+ 4 c_~B~0.offset)) (.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset))) (or (<= (+ .cse0 .cse1) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#t~malloc32#1.base|) .cse3)) (< v_ArrVal_625 (+ (select (select .cse4 c_~A~0.base) .cse5) (select (select .cse4 c_~B~0.base) .cse6))) (<= (select (select .cse2 c_~A~0.base) .cse5) .cse0) (<= (select (select .cse2 c_~B~0.base) .cse6) .cse1)))))) is different from false [2022-01-19 09:08:03,654 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:08:03,655 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 09:08:26,563 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:08:26,564 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 09:08:26,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 09:08:26,641 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-19 09:08:26,643 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 09:08:27,386 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:08:27,387 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 283072 treesize of output 268108 [2022-01-19 09:08:28,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 09:08:28,207 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 276064 treesize of output 257504 [2022-01-19 09:08:29,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:08:29,126 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 257472 treesize of output 232548 [2022-01-19 09:08:29,950 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:08:29,951 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 242176 treesize of output 236748 [2022-01-19 09:08:30,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 09:08:30,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 09:08:30,813 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 09:08:30,814 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 09:13:10,920 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-19 09:13:10,922 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 09:13:10,938 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 09:13:10,944 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 09:13:10,945 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 09:13:11,122 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 09:13:11,123 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 282 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 91ms.. [2022-01-19 09:13:11,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-19 09:13:11,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-19 09:13:11,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-19 09:13:11,127 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-01-19 09:13:11,128 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 09:13:11,128 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 09:13:11,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 09:13:11 BasicIcfg [2022-01-19 09:13:11,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 09:13:11,133 INFO L158 Benchmark]: Toolchain (without parser) took 790640.20ms. Allocated memory was 354.4MB in the beginning and 15.2GB in the end (delta: 14.8GB). Free memory was 299.6MB in the beginning and 5.2GB in the end (delta: -4.9GB). Peak memory consumption was 11.6GB. Max. memory is 16.0GB. [2022-01-19 09:13:11,134 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 354.4MB. Free memory was 316.9MB in the beginning and 316.8MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 09:13:11,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.07ms. Allocated memory was 354.4MB in the beginning and 503.3MB in the end (delta: 148.9MB). Free memory was 299.5MB in the beginning and 473.3MB in the end (delta: -173.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2022-01-19 09:13:11,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.38ms. Allocated memory is still 503.3MB. Free memory was 473.3MB in the beginning and 471.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 09:13:11,136 INFO L158 Benchmark]: Boogie Preprocessor took 27.95ms. Allocated memory is still 503.3MB. Free memory was 471.2MB in the beginning and 469.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 09:13:11,136 INFO L158 Benchmark]: RCFGBuilder took 673.08ms. Allocated memory is still 503.3MB. Free memory was 469.1MB in the beginning and 440.8MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2022-01-19 09:13:11,136 INFO L158 Benchmark]: TraceAbstraction took 789640.45ms. Allocated memory was 503.3MB in the beginning and 15.2GB in the end (delta: 14.7GB). Free memory was 440.8MB in the beginning and 5.2GB in the end (delta: -4.8GB). Peak memory consumption was 11.6GB. Max. memory is 16.0GB. [2022-01-19 09:13:11,138 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 354.4MB. Free memory was 316.9MB in the beginning and 316.8MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 255.07ms. Allocated memory was 354.4MB in the beginning and 503.3MB in the end (delta: 148.9MB). Free memory was 299.5MB in the beginning and 473.3MB in the end (delta: -173.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.38ms. Allocated memory is still 503.3MB. Free memory was 473.3MB in the beginning and 471.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.95ms. Allocated memory is still 503.3MB. Free memory was 471.2MB in the beginning and 469.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 673.08ms. Allocated memory is still 503.3MB. Free memory was 469.1MB in the beginning and 440.8MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 789640.45ms. Allocated memory was 503.3MB in the beginning and 15.2GB in the end (delta: 14.7GB). Free memory was 440.8MB in the beginning and 5.2GB in the end (delta: -4.8GB). Peak memory consumption was 11.6GB. 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 SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 91ms.. - 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 SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 91ms.. - 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 SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 91ms.. - 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 SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 91ms.. - 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: 789.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 255.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21864 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21864 mSDsluCounter, 40121 SdHoareTripleChecker+Invalid, 14.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17175 IncrementalHoareTripleChecker+Unchecked, 43675 mSDsCounter, 1137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34722 IncrementalHoareTripleChecker+Invalid, 53034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1137 mSolverCounterUnsat, 1066 mSDtfsCounter, 34722 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5035 GetRequests, 4109 SyntacticMatches, 44 SemanticMatches, 882 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 50371 ImplicationChecksByTransitivity, 119.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24542occurred in iteration=11, InterpolantAutomatonStates: 491, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 193.5s InterpolantComputationTime, 4978 NumberOfCodeBlocks, 4957 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7104 ConstructedInterpolants, 117 QuantifiedInterpolants, 50489 SizeOfPredicates, 218 NumberOfNonLiveVariables, 4525 ConjunctsInSsa, 316 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 429/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