/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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 10:16:42,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 10:16:42,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 10:16:42,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 10:16:42,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 10:16:42,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 10:16:42,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 10:16:42,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 10:16:42,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 10:16:42,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 10:16:42,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 10:16:42,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 10:16:42,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 10:16:42,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 10:16:42,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 10:16:42,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 10:16:42,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 10:16:42,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 10:16:42,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 10:16:42,816 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 10:16:42,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 10:16:42,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 10:16:42,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 10:16:42,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 10:16:42,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 10:16:42,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 10:16:42,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 10:16:42,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 10:16:42,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 10:16:42,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 10:16:42,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 10:16:42,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 10:16:42,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 10:16:42,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 10:16:42,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 10:16:42,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 10:16:42,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 10:16:42,832 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 10:16:42,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 10:16:42,833 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 10:16:42,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 10:16:42,839 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-VariableLbe.epf [2023-01-28 10:16:42,866 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 10:16:42,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 10:16:42,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 10:16:42,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 10:16:42,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 10:16:42,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 10:16:42,868 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 10:16:42,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 10:16:42,868 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 10:16:42,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 10:16:42,869 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 10:16:42,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 10:16:42,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 10:16:42,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 10:16:42,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 10:16:42,869 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 10:16:42,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 10:16:42,870 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 10:16:42,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 10:16:42,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 10:16:42,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 10:16:42,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 10:16:42,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 10:16:42,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:16:42,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 10:16:42,871 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 10:16:42,871 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 10:16:42,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 10:16:42,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 10:16:42,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 10:16:42,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 10:16:42,871 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 10:16:43,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 10:16:43,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 10:16:43,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 10:16:43,122 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 10:16:43,123 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 10:16:43,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-01-28 10:16:44,205 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 10:16:44,370 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 10:16:44,371 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-01-28 10:16:44,376 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b27ed64b/b2d9a39be72c4a3c887aa0ae62dfe7a1/FLAGd5224ee35 [2023-01-28 10:16:44,387 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b27ed64b/b2d9a39be72c4a3c887aa0ae62dfe7a1 [2023-01-28 10:16:44,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 10:16:44,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 10:16:44,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 10:16:44,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 10:16:44,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 10:16:44,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cc2df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44, skipping insertion in model container [2023-01-28 10:16:44,395 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 10:16:44,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 10:16:44,598 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-01-28 10:16:44,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:16:44,614 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 10:16:44,637 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-01-28 10:16:44,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:16:44,648 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:16:44,648 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:16:44,654 INFO L208 MainTranslator]: Completed translation [2023-01-28 10:16:44,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44 WrapperNode [2023-01-28 10:16:44,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 10:16:44,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 10:16:44,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 10:16:44,656 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 10:16:44,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,701 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 347 [2023-01-28 10:16:44,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 10:16:44,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 10:16:44,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 10:16:44,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 10:16:44,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,733 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 10:16:44,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 10:16:44,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 10:16:44,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 10:16:44,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (1/1) ... [2023-01-28 10:16:44,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:16:44,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:16:44,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 10:16:44,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 10:16:44,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 10:16:44,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 10:16:44,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 10:16:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 10:16:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 10:16:44,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 10:16:44,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 10:16:44,820 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 10:16:44,820 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 10:16:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 10:16:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 10:16:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 10:16:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 10:16:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 10:16:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 10:16:44,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 10:16:44,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 10:16:44,826 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 10:16:44,975 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 10:16:44,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 10:16:45,386 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 10:16:45,590 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 10:16:45,590 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-01-28 10:16:45,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:16:45 BoogieIcfgContainer [2023-01-28 10:16:45,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 10:16:45,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 10:16:45,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 10:16:45,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 10:16:45,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:16:44" (1/3) ... [2023-01-28 10:16:45,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79464e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:16:45, skipping insertion in model container [2023-01-28 10:16:45,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:16:44" (2/3) ... [2023-01-28 10:16:45,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79464e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:16:45, skipping insertion in model container [2023-01-28 10:16:45,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:16:45" (3/3) ... [2023-01-28 10:16:45,602 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-01-28 10:16:45,615 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 10:16:45,616 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 10:16:45,616 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 10:16:45,699 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-28 10:16:45,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 248 transitions, 520 flow [2023-01-28 10:16:45,832 INFO L130 PetriNetUnfolder]: 19/245 cut-off events. [2023-01-28 10:16:45,832 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 10:16:45,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 245 events. 19/245 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-01-28 10:16:45,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 248 transitions, 520 flow [2023-01-28 10:16:45,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 235 transitions, 488 flow [2023-01-28 10:16:45,849 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 10:16:45,866 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 235 transitions, 488 flow [2023-01-28 10:16:45,869 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 235 transitions, 488 flow [2023-01-28 10:16:45,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 235 transitions, 488 flow [2023-01-28 10:16:45,912 INFO L130 PetriNetUnfolder]: 19/235 cut-off events. [2023-01-28 10:16:45,913 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 10:16:45,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 235 events. 19/235 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 140 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-01-28 10:16:45,917 INFO L119 LiptonReduction]: Number of co-enabled transitions 1460 [2023-01-28 10:16:53,754 INFO L134 LiptonReduction]: Checked pairs total: 3005 [2023-01-28 10:16:53,754 INFO L136 LiptonReduction]: Total number of compositions: 247 [2023-01-28 10:16:53,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 10:16:53,768 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c8f9028, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 10:16:53,769 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-01-28 10:16:53,773 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2023-01-28 10:16:53,773 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-01-28 10:16:53,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:53,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:53,774 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:53,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash 169519787, now seen corresponding path program 1 times [2023-01-28 10:16:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349122520] [2023-01-28 10:16:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:16:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349122520] [2023-01-28 10:16:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349122520] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:54,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:54,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:16:54,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954425059] [2023-01-28 10:16:54,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:54,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:16:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:16:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:16:54,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-28 10:16:54,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:54,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:54,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-28 10:16:54,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:54,791 INFO L130 PetriNetUnfolder]: 564/838 cut-off events. [2023-01-28 10:16:54,791 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-01-28 10:16:54,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 838 events. 564/838 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3025 event pairs, 130 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 1134. Up to 602 conditions per place. [2023-01-28 10:16:54,800 INFO L137 encePairwiseOnDemand]: 485/495 looper letters, 57 selfloop transitions, 12 changer transitions 2/71 dead transitions. [2023-01-28 10:16:54,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 71 transitions, 335 flow [2023-01-28 10:16:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:16:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:16:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 809 transitions. [2023-01-28 10:16:54,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4085858585858586 [2023-01-28 10:16:54,823 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 809 transitions. [2023-01-28 10:16:54,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 809 transitions. [2023-01-28 10:16:54,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:54,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 809 transitions. [2023-01-28 10:16:54,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.25) internal successors, (809), 4 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:54,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:54,841 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:54,843 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 4 states and 809 transitions. [2023-01-28 10:16:54,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 71 transitions, 335 flow [2023-01-28 10:16:54,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 301 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-01-28 10:16:54,850 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 149 flow [2023-01-28 10:16:54,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2023-01-28 10:16:54,854 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-01-28 10:16:54,854 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 149 flow [2023-01-28 10:16:54,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:54,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:54,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:54,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 10:16:54,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:54,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash 790486479, now seen corresponding path program 1 times [2023-01-28 10:16:54,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:54,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154831488] [2023-01-28 10:16:54,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:54,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:16:55,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:55,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154831488] [2023-01-28 10:16:55,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154831488] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:55,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:55,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:16:55,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304144510] [2023-01-28 10:16:55,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:55,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:16:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:55,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:16:55,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:16:55,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-28 10:16:55,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:55,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-28 10:16:55,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:55,200 INFO L130 PetriNetUnfolder]: 680/1058 cut-off events. [2023-01-28 10:16:55,200 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2023-01-28 10:16:55,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2588 conditions, 1058 events. 680/1058 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3978 event pairs, 453 based on Foata normal form. 50/1042 useless extension candidates. Maximal degree in co-relation 1563. Up to 837 conditions per place. [2023-01-28 10:16:55,208 INFO L137 encePairwiseOnDemand]: 489/495 looper letters, 38 selfloop transitions, 2 changer transitions 24/64 dead transitions. [2023-01-28 10:16:55,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 353 flow [2023-01-28 10:16:55,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:16:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:16:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 790 transitions. [2023-01-28 10:16:55,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2023-01-28 10:16:55,211 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 790 transitions. [2023-01-28 10:16:55,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 790 transitions. [2023-01-28 10:16:55,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:55,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 790 transitions. [2023-01-28 10:16:55,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.5) internal successors, (790), 4 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,217 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,217 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 149 flow. Second operand 4 states and 790 transitions. [2023-01-28 10:16:55,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 353 flow [2023-01-28 10:16:55,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 10:16:55,221 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 159 flow [2023-01-28 10:16:55,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2023-01-28 10:16:55,222 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-01-28 10:16:55,222 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 159 flow [2023-01-28 10:16:55,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:55,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:55,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 10:16:55,223 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:55,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:55,226 INFO L85 PathProgramCache]: Analyzing trace with hash 611376253, now seen corresponding path program 1 times [2023-01-28 10:16:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:55,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121210421] [2023-01-28 10:16:55,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:55,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:16:55,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121210421] [2023-01-28 10:16:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121210421] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:55,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:16:55,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145398800] [2023-01-28 10:16:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:55,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:16:55,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:55,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:16:55,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:16:55,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 495 [2023-01-28 10:16:55,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:55,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 495 [2023-01-28 10:16:55,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:55,565 INFO L130 PetriNetUnfolder]: 623/959 cut-off events. [2023-01-28 10:16:55,565 INFO L131 PetriNetUnfolder]: For 367/367 co-relation queries the response was YES. [2023-01-28 10:16:55,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 959 events. 623/959 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3602 event pairs, 240 based on Foata normal form. 70/1029 useless extension candidates. Maximal degree in co-relation 2439. Up to 512 conditions per place. [2023-01-28 10:16:55,570 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 54 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-01-28 10:16:55,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 314 flow [2023-01-28 10:16:55,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:16:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:16:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2023-01-28 10:16:55,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4632996632996633 [2023-01-28 10:16:55,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 688 transitions. [2023-01-28 10:16:55,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 688 transitions. [2023-01-28 10:16:55,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:55,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 688 transitions. [2023-01-28 10:16:55,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,578 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,578 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 159 flow. Second operand 3 states and 688 transitions. [2023-01-28 10:16:55,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 314 flow [2023-01-28 10:16:55,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 10:16:55,581 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 157 flow [2023-01-28 10:16:55,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2023-01-28 10:16:55,581 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-01-28 10:16:55,582 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 157 flow [2023-01-28 10:16:55,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:55,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:55,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 10:16:55,583 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:55,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 654922567, now seen corresponding path program 1 times [2023-01-28 10:16:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858071953] [2023-01-28 10:16:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:16:55,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:55,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858071953] [2023-01-28 10:16:55,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858071953] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:55,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:55,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:16:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871559103] [2023-01-28 10:16:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:55,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:16:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:55,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:16:55,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:16:55,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-01-28 10:16:55,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:55,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-01-28 10:16:55,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:55,924 INFO L130 PetriNetUnfolder]: 625/969 cut-off events. [2023-01-28 10:16:55,924 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-01-28 10:16:55,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 969 events. 625/969 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3620 event pairs, 224 based on Foata normal form. 44/1013 useless extension candidates. Maximal degree in co-relation 2152. Up to 520 conditions per place. [2023-01-28 10:16:55,929 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 47 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2023-01-28 10:16:55,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 306 flow [2023-01-28 10:16:55,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:16:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:16:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2023-01-28 10:16:55,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707070707070707 [2023-01-28 10:16:55,932 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2023-01-28 10:16:55,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2023-01-28 10:16:55,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:55,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2023-01-28 10:16:55,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,937 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 157 flow. Second operand 3 states and 699 transitions. [2023-01-28 10:16:55,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 306 flow [2023-01-28 10:16:55,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 10:16:55,940 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 157 flow [2023-01-28 10:16:55,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-01-28 10:16:55,940 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-01-28 10:16:55,941 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 157 flow [2023-01-28 10:16:55,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:55,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:55,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:55,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 10:16:55,942 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:55,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:55,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1525535317, now seen corresponding path program 1 times [2023-01-28 10:16:55,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:55,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178052429] [2023-01-28 10:16:55,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:16:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178052429] [2023-01-28 10:16:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178052429] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:56,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 10:16:56,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41882] [2023-01-28 10:16:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:56,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:16:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:56,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:16:56,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:16:56,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-28 10:16:56,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:56,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-28 10:16:56,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:56,294 INFO L130 PetriNetUnfolder]: 883/1411 cut-off events. [2023-01-28 10:16:56,294 INFO L131 PetriNetUnfolder]: For 762/762 co-relation queries the response was YES. [2023-01-28 10:16:56,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1411 events. 883/1411 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5924 event pairs, 701 based on Foata normal form. 26/1437 useless extension candidates. Maximal degree in co-relation 2284. Up to 965 conditions per place. [2023-01-28 10:16:56,300 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 34 selfloop transitions, 3 changer transitions 25/62 dead transitions. [2023-01-28 10:16:56,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 361 flow [2023-01-28 10:16:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:16:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:16:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 791 transitions. [2023-01-28 10:16:56,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3994949494949495 [2023-01-28 10:16:56,303 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 791 transitions. [2023-01-28 10:16:56,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 791 transitions. [2023-01-28 10:16:56,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:56,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 791 transitions. [2023-01-28 10:16:56,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,309 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 157 flow. Second operand 4 states and 791 transitions. [2023-01-28 10:16:56,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 361 flow [2023-01-28 10:16:56,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 10:16:56,312 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 161 flow [2023-01-28 10:16:56,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-01-28 10:16:56,312 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-01-28 10:16:56,313 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 161 flow [2023-01-28 10:16:56,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:56,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:56,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 10:16:56,314 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:56,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:56,314 INFO L85 PathProgramCache]: Analyzing trace with hash -424741139, now seen corresponding path program 1 times [2023-01-28 10:16:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:56,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256389283] [2023-01-28 10:16:56,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:56,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:16:56,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:56,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256389283] [2023-01-28 10:16:56,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256389283] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:56,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:56,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 10:16:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042825251] [2023-01-28 10:16:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:56,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:16:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:16:56,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:16:56,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 495 [2023-01-28 10:16:56,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:56,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 495 [2023-01-28 10:16:56,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:56,626 INFO L130 PetriNetUnfolder]: 634/996 cut-off events. [2023-01-28 10:16:56,627 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2023-01-28 10:16:56,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2702 conditions, 996 events. 634/996 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3749 event pairs, 505 based on Foata normal form. 18/1014 useless extension candidates. Maximal degree in co-relation 2668. Up to 831 conditions per place. [2023-01-28 10:16:56,631 INFO L137 encePairwiseOnDemand]: 487/495 looper letters, 30 selfloop transitions, 6 changer transitions 17/53 dead transitions. [2023-01-28 10:16:56,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 307 flow [2023-01-28 10:16:56,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:16:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:16:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 971 transitions. [2023-01-28 10:16:56,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923232323232323 [2023-01-28 10:16:56,634 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 971 transitions. [2023-01-28 10:16:56,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 971 transitions. [2023-01-28 10:16:56,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:56,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 971 transitions. [2023-01-28 10:16:56,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,641 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,641 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 161 flow. Second operand 5 states and 971 transitions. [2023-01-28 10:16:56,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 307 flow [2023-01-28 10:16:56,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 297 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 10:16:56,644 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 166 flow [2023-01-28 10:16:56,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-01-28 10:16:56,646 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-01-28 10:16:56,646 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 166 flow [2023-01-28 10:16:56,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 190.25) internal successors, (761), 4 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:56,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:56,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 10:16:56,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:56,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:56,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1608617032, now seen corresponding path program 1 times [2023-01-28 10:16:56,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:56,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248390395] [2023-01-28 10:16:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:56,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:16:56,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:56,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248390395] [2023-01-28 10:16:56,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248390395] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:56,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:56,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 10:16:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791652199] [2023-01-28 10:16:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:56,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:16:56,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:16:56,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:16:56,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-01-28 10:16:56,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:56,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-01-28 10:16:56,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:56,935 INFO L130 PetriNetUnfolder]: 353/547 cut-off events. [2023-01-28 10:16:56,935 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-01-28 10:16:56,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 547 events. 353/547 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1604 event pairs, 139 based on Foata normal form. 14/561 useless extension candidates. Maximal degree in co-relation 1435. Up to 460 conditions per place. [2023-01-28 10:16:56,939 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 37 selfloop transitions, 2 changer transitions 7/46 dead transitions. [2023-01-28 10:16:56,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 283 flow [2023-01-28 10:16:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:16:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:16:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-01-28 10:16:56,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463973063973064 [2023-01-28 10:16:56,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-01-28 10:16:56,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-01-28 10:16:56,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:56,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-01-28 10:16:56,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,946 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 166 flow. Second operand 3 states and 689 transitions. [2023-01-28 10:16:56,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 283 flow [2023-01-28 10:16:56,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 261 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-01-28 10:16:56,948 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 158 flow [2023-01-28 10:16:56,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-01-28 10:16:56,949 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-01-28 10:16:56,950 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 158 flow [2023-01-28 10:16:56,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:56,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:56,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:56,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 10:16:56,950 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:56,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:56,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1743219548, now seen corresponding path program 1 times [2023-01-28 10:16:56,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:56,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427461238] [2023-01-28 10:16:56,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:56,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:16:57,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:57,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427461238] [2023-01-28 10:16:57,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427461238] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:16:57,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923551530] [2023-01-28 10:16:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:57,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:16:57,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:16:57,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:16:57,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 10:16:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:57,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 10:16:57,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:16:57,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:16:57,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:16:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:16:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923551530] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:16:57,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:16:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-01-28 10:16:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434627440] [2023-01-28 10:16:57,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:16:57,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 10:16:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 10:16:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-01-28 10:16:57,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 495 [2023-01-28 10:16:57,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 158 flow. Second operand has 14 states, 14 states have (on average 179.21428571428572) internal successors, (2509), 14 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:57,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:57,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 495 [2023-01-28 10:16:57,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:58,519 INFO L130 PetriNetUnfolder]: 1251/2042 cut-off events. [2023-01-28 10:16:58,519 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2023-01-28 10:16:58,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 2042 events. 1251/2042 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9046 event pairs, 364 based on Foata normal form. 192/2234 useless extension candidates. Maximal degree in co-relation 2554. Up to 483 conditions per place. [2023-01-28 10:16:58,530 INFO L137 encePairwiseOnDemand]: 484/495 looper letters, 78 selfloop transitions, 16 changer transitions 118/212 dead transitions. [2023-01-28 10:16:58,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 212 transitions, 1170 flow [2023-01-28 10:16:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-28 10:16:58,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-28 10:16:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3712 transitions. [2023-01-28 10:16:58,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.374949494949495 [2023-01-28 10:16:58,541 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3712 transitions. [2023-01-28 10:16:58,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3712 transitions. [2023-01-28 10:16:58,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:58,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3712 transitions. [2023-01-28 10:16:58,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 185.6) internal successors, (3712), 20 states have internal predecessors, (3712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:58,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 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) [2023-01-28 10:16:58,563 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 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) [2023-01-28 10:16:58,563 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 158 flow. Second operand 20 states and 3712 transitions. [2023-01-28 10:16:58,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 212 transitions, 1170 flow [2023-01-28 10:16:58,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 212 transitions, 1157 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-01-28 10:16:58,567 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 319 flow [2023-01-28 10:16:58,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=319, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-01-28 10:16:58,568 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-01-28 10:16:58,568 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 319 flow [2023-01-28 10:16:58,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 179.21428571428572) internal successors, (2509), 14 states have internal predecessors, (2509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:58,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:58,569 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-01-28 10:16:58,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 10:16:58,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:16:58,776 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:58,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:58,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2011379154, now seen corresponding path program 2 times [2023-01-28 10:16:58,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:58,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138389504] [2023-01-28 10:16:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:58,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-01-28 10:16:59,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138389504] [2023-01-28 10:16:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138389504] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:16:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:16:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 10:16:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372196393] [2023-01-28 10:16:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:16:59,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 10:16:59,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:16:59,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 10:16:59,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-28 10:16:59,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 495 [2023-01-28 10:16:59,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:59,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:16:59,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 495 [2023-01-28 10:16:59,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:16:59,480 INFO L130 PetriNetUnfolder]: 2001/3024 cut-off events. [2023-01-28 10:16:59,480 INFO L131 PetriNetUnfolder]: For 9982/9982 co-relation queries the response was YES. [2023-01-28 10:16:59,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11593 conditions, 3024 events. 2001/3024 cut-off events. For 9982/9982 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13309 event pairs, 650 based on Foata normal form. 42/3066 useless extension candidates. Maximal degree in co-relation 6322. Up to 1345 conditions per place. [2023-01-28 10:16:59,499 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 73 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2023-01-28 10:16:59,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 727 flow [2023-01-28 10:16:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:16:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:16:59,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 918 transitions. [2023-01-28 10:16:59,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2023-01-28 10:16:59,502 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 918 transitions. [2023-01-28 10:16:59,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 918 transitions. [2023-01-28 10:16:59,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:16:59,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 918 transitions. [2023-01-28 10:16:59,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 229.5) internal successors, (918), 4 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:59,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:59,508 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:59,508 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 319 flow. Second operand 4 states and 918 transitions. [2023-01-28 10:16:59,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 727 flow [2023-01-28 10:16:59,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 638 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-01-28 10:16:59,518 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 429 flow [2023-01-28 10:16:59,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-01-28 10:16:59,520 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-01-28 10:16:59,520 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 429 flow [2023-01-28 10:16:59,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 218.6) internal successors, (1093), 5 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:16:59,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:16:59,521 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:16:59,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 10:16:59,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:16:59,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:16:59,521 INFO L85 PathProgramCache]: Analyzing trace with hash -23841826, now seen corresponding path program 1 times [2023-01-28 10:16:59,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:16:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547474279] [2023-01-28 10:16:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:59,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:16:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:16:59,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:16:59,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547474279] [2023-01-28 10:16:59,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547474279] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:16:59,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076885071] [2023-01-28 10:16:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:16:59,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:16:59,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:16:59,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:16:59,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 10:16:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:16:59,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 10:16:59,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:16:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:16:59,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:17:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:17:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076885071] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:17:00,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:17:00,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-28 10:17:00,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905557727] [2023-01-28 10:17:00,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:17:00,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 10:17:00,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:17:00,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 10:17:00,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-01-28 10:17:00,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 495 [2023-01-28 10:17:00,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 429 flow. Second operand has 12 states, 12 states have (on average 185.83333333333334) internal successors, (2230), 12 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:17:00,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:17:00,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 495 [2023-01-28 10:17:00,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:17:00,349 INFO L130 PetriNetUnfolder]: 949/1472 cut-off events. [2023-01-28 10:17:00,349 INFO L131 PetriNetUnfolder]: For 4771/4771 co-relation queries the response was YES. [2023-01-28 10:17:00,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 1472 events. 949/1472 cut-off events. For 4771/4771 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5597 event pairs, 669 based on Foata normal form. 2/1474 useless extension candidates. Maximal degree in co-relation 5287. Up to 1332 conditions per place. [2023-01-28 10:17:00,358 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 42 selfloop transitions, 3 changer transitions 33/78 dead transitions. [2023-01-28 10:17:00,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 598 flow [2023-01-28 10:17:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 10:17:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 10:17:00,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1155 transitions. [2023-01-28 10:17:00,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2023-01-28 10:17:00,362 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1155 transitions. [2023-01-28 10:17:00,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1155 transitions. [2023-01-28 10:17:00,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:17:00,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1155 transitions. [2023-01-28 10:17:00,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:17:00,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 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) [2023-01-28 10:17:00,381 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 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) [2023-01-28 10:17:00,381 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 429 flow. Second operand 6 states and 1155 transitions. [2023-01-28 10:17:00,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 598 flow [2023-01-28 10:17:00,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 560 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-01-28 10:17:00,387 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 275 flow [2023-01-28 10:17:00,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-01-28 10:17:00,388 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-01-28 10:17:00,388 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 275 flow [2023-01-28 10:17:00,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 185.83333333333334) internal successors, (2230), 12 states have internal predecessors, (2230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:17:00,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:17:00,389 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-01-28 10:17:00,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 10:17:00,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-28 10:17:00,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:17:00,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:17:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1711614402, now seen corresponding path program 2 times [2023-01-28 10:17:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:17:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912974577] [2023-01-28 10:17:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:17:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:17:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:17:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:17:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:17:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912974577] [2023-01-28 10:17:04,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912974577] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:17:04,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120561715] [2023-01-28 10:17:04,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:17:04,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:17:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:17:04,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:17:04,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 10:17:04,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:17:04,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:17:04,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 74 conjunts are in the unsatisfiable core [2023-01-28 10:17:04,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:17:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 10:17:05,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:17:18,062 WARN L222 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:17:20,206 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~manager~0.base))) (let ((.cse7 (* c_~client_back~0 4)) (.cse1 (select .cse2 (+ c_~manager~0.offset (* c_~manager_back~0 4))))) (let ((.cse3 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse8 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse1 (select .cse8 (+ .cse7 ~client~0.offset)))) (= (select .cse8 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse1))))) (.cse0 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse1 (select (select |c_#memory_int| ~client~0.base) (+ .cse7 ~client~0.offset))))))) (let ((.cse5 (and .cse3 .cse0)) (.cse6 (= (mod c_~safe~0 256) 0))) (and (or (let ((.cse4 (= c_~update~0 (select (select |c_#memory_int| c_~node~0.base) (+ (* c_~node_front~0 4) c_~node~0.offset))))) (and (or (and (or .cse0 (= .cse1 (select .cse2 (+ (* 4 c_~manager_front~0) c_~manager~0.offset)))) .cse3) (not .cse4)) (or .cse5 .cse4))) .cse6) (or .cse5 (not .cse6))))))) is different from false [2023-01-28 10:18:10,672 WARN L222 SmtUtils]: Spent 50.25s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:19:05,352 WARN L222 SmtUtils]: Spent 52.26s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:19:05,464 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-01-28 10:19:05,464 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 67 [2023-01-28 10:19:05,551 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-01-28 10:19:05,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 61 treesize of output 127 [2023-01-28 10:19:05,662 INFO L321 Elim1Store]: treesize reduction 48, result has 68.8 percent of original size [2023-01-28 10:19:05,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 61 treesize of output 117 [2023-01-28 10:19:05,908 INFO L321 Elim1Store]: treesize reduction 266, result has 43.9 percent of original size [2023-01-28 10:19:05,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 127 treesize of output 233 [2023-01-28 10:19:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-01-28 10:19:06,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120561715] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:19:06,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:19:06,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 43 [2023-01-28 10:19:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712326802] [2023-01-28 10:19:06,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:19:06,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-01-28 10:19:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:19:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-01-28 10:19:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1627, Unknown=3, NotChecked=84, Total=1980 [2023-01-28 10:19:06,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 495 [2023-01-28 10:19:06,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 275 flow. Second operand has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:19:06,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:19:06,375 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 495 [2023-01-28 10:19:06,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:19:18,636 WARN L222 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 116 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:19:36,328 WARN L222 SmtUtils]: Spent 16.25s on a formula simplification. DAG size of input: 85 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:19:38,570 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~manager~0.base)) (.cse1 (* c_~manager_back~0 4))) (let ((.cse25 (* c_~client_back~0 4)) (.cse12 (select .cse0 (+ c_~manager~0.offset .cse1)))) (let ((.cse22 (= (mod c_~safe~0 256) 0)) (.cse13 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse26 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse12 (select .cse26 (+ .cse25 ~client~0.offset)))) (= (select .cse26 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse12))))) (.cse5 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse12 (select (select |c_#memory_int| ~client~0.base) (+ .cse25 ~client~0.offset)))))) (.cse24 (* c_~node_front~0 4)) (.cse11 (* 4 c_~manager_front~0))) (let ((.cse14 (select .cse0 (+ .cse11 c_~manager~0.offset))) (.cse8 (+ .cse24 c_~node~0.offset)) (.cse20 (and .cse13 .cse5)) (.cse3 (< c_~node_back~0 0)) (.cse2 (= c_~manager_back~0 c_~manager_front~0)) (.cse16 (= c_~client_back~0 c_~client_front~0)) (.cse6 (not .cse22)) (.cse15 (<= c_~node_size~0 c_~node_back~0)) (.cse23 (<= c_~manager_size~0 c_~manager_back~0)) (.cse17 (<= 1 c_~safe~0)) (.cse18 (<= (div c_~safe~0 256) 0)) (.cse21 (select |c_#memory_int| c_~node~0.base))) (and (= (select .cse0 (+ (- 4) c_~manager~0.offset .cse1)) c_~update~0) .cse2 (<= c_~node_front~0 0) (or .cse3 (let ((.cse9 (+ (* c_~node_back~0 4) c_~node~0.offset))) (let ((.cse4 (forall ((~node~0.base Int)) (not (= c_~update~0 (select (select |c_#memory_int| ~node~0.base) .cse9)))))) (and (or .cse4 .cse5 .cse6) (or (forall ((~node~0.base Int)) (let ((.cse7 (select |c_#memory_int| ~node~0.base))) (or (= c_~update~0 (select .cse7 .cse8)) (not (= c_~update~0 (select .cse7 .cse9)))))) .cse5) (or (forall ((~node~0.base Int)) (let ((.cse10 (select |c_#memory_int| ~node~0.base))) (or (not (= c_~update~0 (select .cse10 .cse9))) (not (= c_~update~0 (select .cse10 .cse8)))))) (and (or (= (select .cse0 (+ .cse11 c_~manager~0.offset 4)) .cse12) .cse5) .cse13)) (or (= c_~update~0 .cse14) .cse4 .cse5)))) .cse15) (= c_~client~0.offset 0) (<= 0 c_~node_front~0) (= c_~manager~0.offset 0) .cse16 .cse17 .cse18 (or (let ((.cse19 (= c_~update~0 (select .cse21 .cse8)))) (and (or (and (or .cse5 (= .cse12 .cse14)) .cse13) (not .cse19)) (or .cse20 .cse19))) .cse22) (or .cse20 .cse6) (or .cse2 .cse23) (= (select .cse21 .cse24) c_~update~0) (= c_~safe~0 1) (or .cse3 (and .cse2 (= c_~node_front~0 c_~node_back~0) .cse16 .cse6) .cse15) (or .cse23 (and .cse17 .cse18)) (= c_~update~0 (select .cse21 0)) (< 0 (+ c_~node_front~0 1)) (or (<= c_~client_size~0 2) (<= c_~client_back~0 0)) (= c_~node~0.offset 0)))))) is different from false [2023-01-28 10:20:36,812 WARN L222 SmtUtils]: Spent 56.17s on a formula simplification. DAG size of input: 83 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:20:38,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:20:40,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:20:42,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:20:44,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:20:46,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:31,071 WARN L222 SmtUtils]: Spent 42.15s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:21:33,193 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~manager~0.base)) (.cse1 (* c_~manager_back~0 4))) (let ((.cse22 (* c_~client_back~0 4)) (.cse12 (select .cse0 (+ c_~manager~0.offset .cse1)))) (let ((.cse20 (= (mod c_~safe~0 256) 0)) (.cse13 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse23 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse12 (select .cse23 (+ .cse22 ~client~0.offset)))) (= (select .cse23 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse12))))) (.cse5 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse12 (select (select |c_#memory_int| ~client~0.base) (+ .cse22 ~client~0.offset)))))) (.cse21 (* c_~node_front~0 4)) (.cse11 (* 4 c_~manager_front~0))) (let ((.cse14 (select .cse0 (+ .cse11 c_~manager~0.offset))) (.cse8 (+ .cse21 c_~node~0.offset)) (.cse18 (and .cse13 .cse5)) (.cse19 (select |c_#memory_int| c_~node~0.base)) (.cse3 (< c_~node_back~0 0)) (.cse2 (= c_~manager_back~0 c_~manager_front~0)) (.cse16 (= c_~client_back~0 c_~client_front~0)) (.cse6 (not .cse20)) (.cse15 (<= c_~node_size~0 c_~node_back~0))) (and (= (select .cse0 (+ (- 4) c_~manager~0.offset .cse1)) c_~update~0) .cse2 (<= c_~node_front~0 0) (or .cse3 (let ((.cse9 (+ (* c_~node_back~0 4) c_~node~0.offset))) (let ((.cse4 (forall ((~node~0.base Int)) (not (= c_~update~0 (select (select |c_#memory_int| ~node~0.base) .cse9)))))) (and (or .cse4 .cse5 .cse6) (or (forall ((~node~0.base Int)) (let ((.cse7 (select |c_#memory_int| ~node~0.base))) (or (= c_~update~0 (select .cse7 .cse8)) (not (= c_~update~0 (select .cse7 .cse9)))))) .cse5) (or (forall ((~node~0.base Int)) (let ((.cse10 (select |c_#memory_int| ~node~0.base))) (or (not (= c_~update~0 (select .cse10 .cse9))) (not (= c_~update~0 (select .cse10 .cse8)))))) (and (or (= (select .cse0 (+ .cse11 c_~manager~0.offset 4)) .cse12) .cse5) .cse13)) (or (= c_~update~0 .cse14) .cse4 .cse5)))) .cse15) (<= 0 c_~node_front~0) .cse16 (or (let ((.cse17 (= c_~update~0 (select .cse19 .cse8)))) (and (or (and (or .cse5 (= .cse12 .cse14)) .cse13) (not .cse17)) (or .cse18 .cse17))) .cse20) (or .cse18 .cse6) (= (select .cse19 .cse21) c_~update~0) (= c_~safe~0 1) (or .cse3 (and .cse2 (= c_~node_front~0 c_~node_back~0) .cse16 .cse6) .cse15) (= c_~node~0.offset 0)))))) is different from false [2023-01-28 10:21:35,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:37,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:39,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:41,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:43,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:45,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:47,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:49,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:21:51,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:06,080 WARN L222 SmtUtils]: Spent 12.70s on a formula simplification. DAG size of input: 78 DAG size of output: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:22:08,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:10,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:12,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:14,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-01-28 10:22:16,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:18,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:20,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:22,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:24,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:26,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-28 10:22:26,958 INFO L130 PetriNetUnfolder]: 1319/2126 cut-off events. [2023-01-28 10:22:26,958 INFO L131 PetriNetUnfolder]: For 3889/3889 co-relation queries the response was YES. [2023-01-28 10:22:26,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 2126 events. 1319/2126 cut-off events. For 3889/3889 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9147 event pairs, 520 based on Foata normal form. 1/2127 useless extension candidates. Maximal degree in co-relation 7077. Up to 1251 conditions per place. [2023-01-28 10:22:26,971 INFO L137 encePairwiseOnDemand]: 477/495 looper letters, 116 selfloop transitions, 66 changer transitions 73/255 dead transitions. [2023-01-28 10:22:26,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 255 transitions, 1552 flow [2023-01-28 10:22:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-28 10:22:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-28 10:22:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 6641 transitions. [2023-01-28 10:22:26,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29165568730786123 [2023-01-28 10:22:26,989 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 6641 transitions. [2023-01-28 10:22:26,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 6641 transitions. [2023-01-28 10:22:26,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:22:26,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 6641 transitions. [2023-01-28 10:22:27,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 144.3695652173913) internal successors, (6641), 46 states have internal predecessors, (6641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:22:27,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 495.0) internal successors, (23265), 47 states have internal predecessors, (23265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:22:27,032 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 495.0) internal successors, (23265), 47 states have internal predecessors, (23265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:22:27,033 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 275 flow. Second operand 46 states and 6641 transitions. [2023-01-28 10:22:27,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 255 transitions, 1552 flow [2023-01-28 10:22:27,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 255 transitions, 1508 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-01-28 10:22:27,040 INFO L231 Difference]: Finished difference. Result has 110 places, 103 transitions, 843 flow [2023-01-28 10:22:27,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=843, PETRI_PLACES=110, PETRI_TRANSITIONS=103} [2023-01-28 10:22:27,041 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 76 predicate places. [2023-01-28 10:22:27,041 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 103 transitions, 843 flow [2023-01-28 10:22:27,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 10:22:27,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:22:27,043 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-01-28 10:22:27,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 10:22:27,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:22:27,248 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-01-28 10:22:27,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:22:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1210460026, now seen corresponding path program 3 times [2023-01-28 10:22:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:22:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418912702] [2023-01-28 10:22:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:22:27,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:22:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:22:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:22:30,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:22:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418912702] [2023-01-28 10:22:30,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418912702] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:22:30,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424907324] [2023-01-28 10:22:30,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:22:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:22:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:22:30,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:22:30,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 10:22:30,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-01-28 10:22:30,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:22:30,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 129 conjunts are in the unsatisfiable core [2023-01-28 10:22:30,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:22:30,915 INFO L321 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2023-01-28 10:22:30,915 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 15 treesize of output 38 [2023-01-28 10:22:31,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:22:31,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-01-28 10:22:31,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-28 10:22:31,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:22:31,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:22:31,445 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 10:22:31,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-01-28 10:22:31,559 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-01-28 10:22:31,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 10:22:31,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 10:22:31,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-28 10:22:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:22:33,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:22:51,635 WARN L222 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 108 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:22:51,866 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 10:22:51,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 303 treesize of output 145 [2023-01-28 10:22:52,095 INFO L321 Elim1Store]: treesize reduction 9, result has 96.1 percent of original size [2023-01-28 10:22:52,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 19324 treesize of output 18095 [2023-01-28 10:22:53,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:22:53,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:22:53,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 4442 treesize of output 3502 [2023-01-28 10:22:53,593 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:22:53,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:22:53,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 3386 treesize of output 3238 [2023-01-28 10:22:53,808 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:22:53,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:22:53,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 3122 treesize of output 2710 [2023-01-28 10:28:43,664 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 10:28:43,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 204 treesize of output 110 [2023-01-28 10:28:43,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:28:43,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 78343 treesize of output 72730 [2023-01-28 10:28:44,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:28:44,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3061 treesize of output 2953 [2023-01-28 10:28:44,694 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:28:44,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2877 treesize of output 2585 [2023-01-28 10:28:44,824 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:28:44,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2509 treesize of output 1849 [2023-01-28 10:29:16,215 INFO L321 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-01-28 10:29:16,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 306 treesize of output 148 [2023-01-28 10:29:16,424 INFO L321 Elim1Store]: treesize reduction 9, result has 96.1 percent of original size [2023-01-28 10:29:16,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52732 treesize of output 48974 [2023-01-28 10:29:17,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:29:17,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:29:17,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 4610 treesize of output 4157 [2023-01-28 10:29:17,684 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:29:17,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:29:17,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 4034 treesize of output 3869 [2023-01-28 10:29:17,847 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:29:17,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:29:17,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 3746 treesize of output 2717 Received shutdown request... [2023-01-28 10:30:36,784 WARN L238 SmtUtils]: Removed 1 from assertion stack [2023-01-28 10:30:36,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-01-28 10:30:36,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 10:30:36,808 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 10:30:36,809 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 [2023-01-28 10:30:36,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:30:36,994 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 33 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-58-5-5-4-6-11-3-5-3-6-3-4-3-4-3-3-3-3-3-2-2-2-1 context. [2023-01-28 10:30:36,995 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-01-28 10:30:36,997 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-01-28 10:30:36,997 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-01-28 10:30:36,997 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:30:37,001 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 10:30:37,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 10:30:37,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:30:37 BasicIcfg [2023-01-28 10:30:37,009 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 10:30:37,009 INFO L158 Benchmark]: Toolchain (without parser) took 832619.17ms. Allocated memory was 343.9MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 303.0MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-01-28 10:30:37,009 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 10:30:37,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.58ms. Allocated memory is still 343.9MB. Free memory was 302.7MB in the beginning and 290.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 10:30:37,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 343.9MB. Free memory was 290.1MB in the beginning and 287.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:30:37,010 INFO L158 Benchmark]: Boogie Preprocessor took 35.55ms. Allocated memory is still 343.9MB. Free memory was 287.4MB in the beginning and 285.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:30:37,011 INFO L158 Benchmark]: RCFGBuilder took 854.69ms. Allocated memory is still 343.9MB. Free memory was 285.3MB in the beginning and 294.2MB in the end (delta: -8.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-01-28 10:30:37,011 INFO L158 Benchmark]: TraceAbstraction took 831414.40ms. Allocated memory was 343.9MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 294.2MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-01-28 10:30:37,013 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.11ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 263.58ms. Allocated memory is still 343.9MB. Free memory was 302.7MB in the beginning and 290.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 343.9MB. Free memory was 290.1MB in the beginning and 287.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.55ms. Allocated memory is still 343.9MB. Free memory was 287.4MB in the beginning and 285.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 854.69ms. Allocated memory is still 343.9MB. Free memory was 285.3MB in the beginning and 294.2MB in the end (delta: -8.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 831414.40ms. Allocated memory was 343.9MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 294.2MB in the beginning and 1.7GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9s, 226 PlacesBefore, 34 PlacesAfterwards, 235 TransitionsBefore, 30 TransitionsAfterwards, 1460 CoEnabledTransitionPairs, 8 FixpointIterations, 163 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 11 ConcurrentYvCompositions, 13 ChoiceCompositions, 247 TotalNumberOfCompositions, 3005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1957, independent: 1858, independent conditional: 0, independent unconditional: 1858, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 849, independent: 829, independent conditional: 0, independent unconditional: 829, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1957, independent: 1029, independent conditional: 0, independent unconditional: 1029, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 849, unknown conditional: 0, unknown unconditional: 849] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 33 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-58-5-5-4-6-11-3-5-3-6-3-4-3-4-3-3-3-3-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 140]: 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 33 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-58-5-5-4-6-11-3-5-3-6-3-4-3-4-3-3-3-3-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 141]: 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 33 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-58-5-5-4-6-11-3-5-3-6-3-4-3-4-3-3-3-3-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 142]: 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 33 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-58-5-5-4-6-11-3-5-3-6-3-4-3-4-3-3-3-3-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 262 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: 831.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 203.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 1002 SdHoareTripleChecker+Valid, 50.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 49.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 494 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2672 IncrementalHoareTripleChecker+Invalid, 3284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 0 mSDtfsCounter, 2672 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 271.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=843occurred in iteration=11, InterpolantAutomatonStates: 102, 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.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 127.5s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 445 ConstructedInterpolants, 17 QuantifiedInterpolants, 4481 SizeOfPredicates, 48 NumberOfNonLiveVariables, 1192 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 67/92 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