/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 12:38:49,013 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 12:38:49,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 12:38:49,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 12:38:49,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 12:38:49,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 12:38:49,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 12:38:49,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 12:38:49,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 12:38:49,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 12:38:49,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 12:38:49,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 12:38:49,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 12:38:49,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 12:38:49,045 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 12:38:49,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 12:38:49,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 12:38:49,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 12:38:49,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 12:38:49,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 12:38:49,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 12:38:49,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 12:38:49,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 12:38:49,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 12:38:49,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 12:38:49,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 12:38:49,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 12:38:49,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 12:38:49,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 12:38:49,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 12:38:49,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 12:38:49,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 12:38:49,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 12:38:49,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 12:38:49,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 12:38:49,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 12:38:49,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 12:38:49,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 12:38:49,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 12:38:49,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 12:38:49,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 12:38:49,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 12:38:49,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 12:38:49,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 12:38:49,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 12:38:49,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 12:38:49,092 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 12:38:49,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 12:38:49,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 12:38:49,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:38:49,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 12:38:49,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 12:38:49,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 12:38:49,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 12:38:49,094 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 12:38:49,094 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 12:38:49,094 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 12:38:49,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 12:38:49,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 12:38:49,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 12:38:49,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 12:38:49,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 12:38:49,256 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 12:38:49,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-01-19 12:38:49,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d097196e/b545ce2f0ce1459b9ec4fa86c433d15e/FLAG2726bb432 [2022-01-19 12:38:49,701 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 12:38:49,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-01-19 12:38:49,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d097196e/b545ce2f0ce1459b9ec4fa86c433d15e/FLAG2726bb432 [2022-01-19 12:38:49,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d097196e/b545ce2f0ce1459b9ec4fa86c433d15e [2022-01-19 12:38:49,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 12:38:49,727 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 12:38:49,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 12:38:49,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 12:38:49,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 12:38:49,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b417a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49, skipping insertion in model container [2022-01-19 12:38:49,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,737 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 12:38:49,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 12:38:49,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2022-01-19 12:38:49,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:38:49,898 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 12:38:49,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1849,1862] [2022-01-19 12:38:49,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:38:49,916 INFO L208 MainTranslator]: Completed translation [2022-01-19 12:38:49,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49 WrapperNode [2022-01-19 12:38:49,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 12:38:49,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 12:38:49,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 12:38:49,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 12:38:49,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,925 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,940 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-01-19 12:38:49,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 12:38:49,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 12:38:49,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 12:38:49,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 12:38:49,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 12:38:49,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 12:38:49,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 12:38:49,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 12:38:49,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (1/1) ... [2022-01-19 12:38:49,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:38:49,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:38:49,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 12:38:49,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 12:38:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 12:38:50,003 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 12:38:50,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 12:38:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 12:38:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 12:38:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 12:38:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 12:38:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 12:38:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 12:38:50,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 12:38:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 12:38:50,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 12:38:50,005 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 12:38:50,058 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 12:38:50,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 12:38:50,146 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 12:38:50,151 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 12:38:50,151 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 12:38:50,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:38:50 BoogieIcfgContainer [2022-01-19 12:38:50,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 12:38:50,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 12:38:50,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 12:38:50,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 12:38:50,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:38:49" (1/3) ... [2022-01-19 12:38:50,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f17fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:38:50, skipping insertion in model container [2022-01-19 12:38:50,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:38:49" (2/3) ... [2022-01-19 12:38:50,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@677f17fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:38:50, skipping insertion in model container [2022-01-19 12:38:50,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:38:50" (3/3) ... [2022-01-19 12:38:50,160 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2022-01-19 12:38:50,163 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 12:38:50,163 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 12:38:50,163 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 12:38:50,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,186 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,188 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,189 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:38:50,193 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 12:38:50,224 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 12:38:50,229 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 12:38:50,229 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 12:38:50,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2022-01-19 12:38:50,276 INFO L129 PetriNetUnfolder]: 6/79 cut-off events. [2022-01-19 12:38:50,276 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 12:38:50,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 6/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2022-01-19 12:38:50,279 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2022-01-19 12:38:50,282 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-01-19 12:38:50,298 INFO L129 PetriNetUnfolder]: 6/69 cut-off events. [2022-01-19 12:38:50,298 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 12:38:50,298 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:38:50,299 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:38:50,299 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:38:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:38:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1132836851, now seen corresponding path program 1 times [2022-01-19 12:38:50,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:38:50,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525931630] [2022-01-19 12:38:50,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:50,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:38:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:50,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:38:50,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525931630] [2022-01-19 12:38:50,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525931630] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:38:50,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:38:50,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 12:38:50,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76221628] [2022-01-19 12:38:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:38:50,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 12:38:50,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:38:50,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 12:38:50,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 12:38:50,521 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 81 [2022-01-19 12:38:50,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 152 flow. Second operand has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:38:50,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 81 [2022-01-19 12:38:50,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:38:50,568 INFO L129 PetriNetUnfolder]: 2/66 cut-off events. [2022-01-19 12:38:50,568 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 12:38:50,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 66 events. 2/66 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 6/68 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2022-01-19 12:38:50,570 INFO L132 encePairwiseOnDemand]: 77/81 looper letters, 4 selfloop transitions, 0 changer transitions 2/66 dead transitions. [2022-01-19 12:38:50,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 66 transitions, 152 flow [2022-01-19 12:38:50,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 12:38:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 12:38:50,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-01-19 12:38:50,594 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9382716049382716 [2022-01-19 12:38:50,594 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 152 transitions. [2022-01-19 12:38:50,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 152 transitions. [2022-01-19 12:38:50,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:38:50,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 152 transitions. [2022-01-19 12:38:50,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,601 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,606 INFO L186 Difference]: Start difference. First operand has 71 places, 70 transitions, 152 flow. Second operand 2 states and 152 transitions. [2022-01-19 12:38:50,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 66 transitions, 152 flow [2022-01-19 12:38:50,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 144 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 12:38:50,612 INFO L242 Difference]: Finished difference. Result has 68 places, 64 transitions, 132 flow [2022-01-19 12:38:50,613 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=132, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2022-01-19 12:38:50,615 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2022-01-19 12:38:50,616 INFO L470 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 132 flow [2022-01-19 12:38:50,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,616 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:38:50,616 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:38:50,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 12:38:50,616 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:38:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:38:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2129909204, now seen corresponding path program 1 times [2022-01-19 12:38:50,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:38:50,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195849020] [2022-01-19 12:38:50,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:50,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:38:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:50,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:38:50,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195849020] [2022-01-19 12:38:50,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195849020] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:38:50,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:38:50,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 12:38:50,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84764916] [2022-01-19 12:38:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:38:50,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 12:38:50,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:38:50,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 12:38:50,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-19 12:38:50,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 81 [2022-01-19 12:38:50,851 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 132 flow. Second operand has 7 states, 7 states have (on average 54.57142857142857) internal successors, (382), 7 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,851 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:38:50,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 81 [2022-01-19 12:38:50,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:38:50,983 INFO L129 PetriNetUnfolder]: 31/147 cut-off events. [2022-01-19 12:38:50,983 INFO L130 PetriNetUnfolder]: For 8/20 co-relation queries the response was YES. [2022-01-19 12:38:50,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 147 events. 31/147 cut-off events. For 8/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 365 event pairs, 16 based on Foata normal form. 1/124 useless extension candidates. Maximal degree in co-relation 232. Up to 48 conditions per place. [2022-01-19 12:38:50,985 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 25 selfloop transitions, 5 changer transitions 4/76 dead transitions. [2022-01-19 12:38:50,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 227 flow [2022-01-19 12:38:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:38:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:38:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2022-01-19 12:38:50,988 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-01-19 12:38:50,988 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 399 transitions. [2022-01-19 12:38:50,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 399 transitions. [2022-01-19 12:38:50,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:38:50,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 399 transitions. [2022-01-19 12:38:50,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 57.0) internal successors, (399), 7 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,992 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,992 INFO L186 Difference]: Start difference. First operand has 68 places, 64 transitions, 132 flow. Second operand 7 states and 399 transitions. [2022-01-19 12:38:50,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 227 flow [2022-01-19 12:38:50,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 76 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 12:38:50,994 INFO L242 Difference]: Finished difference. Result has 75 places, 66 transitions, 159 flow [2022-01-19 12:38:50,994 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2022-01-19 12:38:50,995 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2022-01-19 12:38:50,995 INFO L470 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 159 flow [2022-01-19 12:38:50,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.57142857142857) internal successors, (382), 7 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:50,995 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:38:50,995 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:38:50,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 12:38:50,996 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:38:50,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:38:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1998264494, now seen corresponding path program 1 times [2022-01-19 12:38:50,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:38:50,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995334930] [2022-01-19 12:38:50,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:50,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:38:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:51,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:38:51,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995334930] [2022-01-19 12:38:51,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995334930] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:38:51,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220042325] [2022-01-19 12:38:51,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:51,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:38:51,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:38:51,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:38:51,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 12:38:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:51,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 12:38:51,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:38:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:51,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:38:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:51,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220042325] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:38:51,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:38:51,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-19 12:38:51,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341497558] [2022-01-19 12:38:51,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:38:51,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 12:38:51,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:38:51,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 12:38:51,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 12:38:51,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 12:38:51,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 159 flow. Second operand has 10 states, 10 states have (on average 53.3) internal successors, (533), 10 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:51,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:38:51,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 12:38:51,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:38:52,009 INFO L129 PetriNetUnfolder]: 38/186 cut-off events. [2022-01-19 12:38:52,009 INFO L130 PetriNetUnfolder]: For 26/34 co-relation queries the response was YES. [2022-01-19 12:38:52,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 186 events. 38/186 cut-off events. For 26/34 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 595 event pairs, 3 based on Foata normal form. 2/168 useless extension candidates. Maximal degree in co-relation 338. Up to 36 conditions per place. [2022-01-19 12:38:52,012 INFO L132 encePairwiseOnDemand]: 70/81 looper letters, 40 selfloop transitions, 16 changer transitions 1/97 dead transitions. [2022-01-19 12:38:52,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 97 transitions, 361 flow [2022-01-19 12:38:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 12:38:52,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 12:38:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 611 transitions. [2022-01-19 12:38:52,016 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6857463524130191 [2022-01-19 12:38:52,016 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 611 transitions. [2022-01-19 12:38:52,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 611 transitions. [2022-01-19 12:38:52,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:38:52,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 611 transitions. [2022-01-19 12:38:52,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 55.54545454545455) internal successors, (611), 11 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 81.0) internal successors, (972), 12 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,022 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 81.0) internal successors, (972), 12 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,022 INFO L186 Difference]: Start difference. First operand has 75 places, 66 transitions, 159 flow. Second operand 11 states and 611 transitions. [2022-01-19 12:38:52,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 97 transitions, 361 flow [2022-01-19 12:38:52,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 346 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-01-19 12:38:52,026 INFO L242 Difference]: Finished difference. Result has 84 places, 74 transitions, 244 flow [2022-01-19 12:38:52,026 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=244, PETRI_PLACES=84, PETRI_TRANSITIONS=74} [2022-01-19 12:38:52,028 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 13 predicate places. [2022-01-19 12:38:52,028 INFO L470 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 244 flow [2022-01-19 12:38:52,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 53.3) internal successors, (533), 10 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,028 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:38:52,028 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:38:52,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-19 12:38:52,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:38:52,244 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:38:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:38:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2140770938, now seen corresponding path program 2 times [2022-01-19 12:38:52,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:38:52,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298852636] [2022-01-19 12:38:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:52,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:38:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:52,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:52,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:38:52,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298852636] [2022-01-19 12:38:52,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298852636] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:38:52,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:38:52,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:38:52,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574049926] [2022-01-19 12:38:52,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:38:52,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:38:52,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:38:52,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:38:52,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:38:52,380 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 12:38:52,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 74 transitions, 244 flow. Second operand has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:38:52,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 12:38:52,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:38:52,466 INFO L129 PetriNetUnfolder]: 34/161 cut-off events. [2022-01-19 12:38:52,467 INFO L130 PetriNetUnfolder]: For 110/114 co-relation queries the response was YES. [2022-01-19 12:38:52,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 161 events. 34/161 cut-off events. For 110/114 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 466 event pairs, 10 based on Foata normal form. 3/157 useless extension candidates. Maximal degree in co-relation 388. Up to 66 conditions per place. [2022-01-19 12:38:52,469 INFO L132 encePairwiseOnDemand]: 72/81 looper letters, 32 selfloop transitions, 5 changer transitions 7/84 dead transitions. [2022-01-19 12:38:52,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 84 transitions, 386 flow [2022-01-19 12:38:52,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:38:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:38:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 338 transitions. [2022-01-19 12:38:52,471 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6954732510288066 [2022-01-19 12:38:52,471 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 338 transitions. [2022-01-19 12:38:52,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 338 transitions. [2022-01-19 12:38:52,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:38:52,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 338 transitions. [2022-01-19 12:38:52,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,473 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,473 INFO L186 Difference]: Start difference. First operand has 84 places, 74 transitions, 244 flow. Second operand 6 states and 338 transitions. [2022-01-19 12:38:52,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 84 transitions, 386 flow [2022-01-19 12:38:52,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 373 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-01-19 12:38:52,480 INFO L242 Difference]: Finished difference. Result has 87 places, 74 transitions, 252 flow [2022-01-19 12:38:52,480 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2022-01-19 12:38:52,481 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 16 predicate places. [2022-01-19 12:38:52,481 INFO L470 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 252 flow [2022-01-19 12:38:52,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,481 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:38:52,482 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:38:52,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 12:38:52,482 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:38:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:38:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 265794878, now seen corresponding path program 1 times [2022-01-19 12:38:52,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:38:52,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41883055] [2022-01-19 12:38:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:52,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:38:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:52,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:38:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41883055] [2022-01-19 12:38:52,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41883055] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:38:52,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:38:52,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:38:52,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767947284] [2022-01-19 12:38:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:38:52,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:38:52,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:38:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:38:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:38:52,567 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 12:38:52,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:38:52,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 12:38:52,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:38:52,659 INFO L129 PetriNetUnfolder]: 34/142 cut-off events. [2022-01-19 12:38:52,659 INFO L130 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-01-19 12:38:52,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 142 events. 34/142 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 317 event pairs, 3 based on Foata normal form. 3/143 useless extension candidates. Maximal degree in co-relation 374. Up to 52 conditions per place. [2022-01-19 12:38:52,660 INFO L132 encePairwiseOnDemand]: 70/81 looper letters, 33 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2022-01-19 12:38:52,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 409 flow [2022-01-19 12:38:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:38:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:38:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 389 transitions. [2022-01-19 12:38:52,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6860670194003528 [2022-01-19 12:38:52,662 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 389 transitions. [2022-01-19 12:38:52,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 389 transitions. [2022-01-19 12:38:52,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:38:52,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 389 transitions. [2022-01-19 12:38:52,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 55.57142857142857) internal successors, (389), 7 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,664 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 81.0) internal successors, (648), 8 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,664 INFO L186 Difference]: Start difference. First operand has 87 places, 74 transitions, 252 flow. Second operand 7 states and 389 transitions. [2022-01-19 12:38:52,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 409 flow [2022-01-19 12:38:52,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 383 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-01-19 12:38:52,667 INFO L242 Difference]: Finished difference. Result has 89 places, 77 transitions, 297 flow [2022-01-19 12:38:52,667 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=297, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2022-01-19 12:38:52,668 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2022-01-19 12:38:52,668 INFO L470 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 297 flow [2022-01-19 12:38:52,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:38:52,668 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:38:52,668 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:38:52,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 12:38:52,669 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:38:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:38:52,670 INFO L85 PathProgramCache]: Analyzing trace with hash -323089442, now seen corresponding path program 1 times [2022-01-19 12:38:52,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:38:52,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204423909] [2022-01-19 12:38:52,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:52,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:38:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:38:53,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:38:53,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204423909] [2022-01-19 12:38:53,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204423909] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:38:53,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124496278] [2022-01-19 12:38:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:38:53,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:38:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:38:53,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:38:53,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 12:38:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:38:53,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 12:38:53,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:39:11,872 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:41:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:41:17,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:41:37,294 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:41:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:41:37,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124496278] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:41:37,549 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:41:37,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2022-01-19 12:41:37,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453158431] [2022-01-19 12:41:37,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:41:37,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 12:41:37,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:41:37,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 12:41:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=468, Unknown=8, NotChecked=0, Total=600 [2022-01-19 12:41:37,552 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 12:41:37,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 297 flow. Second operand has 25 states, 25 states have (on average 51.92) internal successors, (1298), 25 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:41:37,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:41:37,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 12:41:37,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:41:42,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:41:45,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:04,293 WARN L228 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 62 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:42:05,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:20,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:22,331 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:36,969 INFO L129 PetriNetUnfolder]: 122/439 cut-off events. [2022-01-19 12:42:36,969 INFO L130 PetriNetUnfolder]: For 574/574 co-relation queries the response was YES. [2022-01-19 12:42:36,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 439 events. 122/439 cut-off events. For 574/574 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2233 event pairs, 7 based on Foata normal form. 4/442 useless extension candidates. Maximal degree in co-relation 1358. Up to 73 conditions per place. [2022-01-19 12:42:36,972 INFO L132 encePairwiseOnDemand]: 67/81 looper letters, 78 selfloop transitions, 67 changer transitions 16/201 dead transitions. [2022-01-19 12:42:36,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 201 transitions, 1405 flow [2022-01-19 12:42:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 12:42:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 12:42:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1533 transitions. [2022-01-19 12:42:36,975 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2022-01-19 12:42:36,975 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1533 transitions. [2022-01-19 12:42:36,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1533 transitions. [2022-01-19 12:42:36,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:42:36,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1533 transitions. [2022-01-19 12:42:36,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 54.75) internal successors, (1533), 28 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:42:36,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 81.0) internal successors, (2349), 29 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:42:36,981 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 81.0) internal successors, (2349), 29 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:42:36,981 INFO L186 Difference]: Start difference. First operand has 89 places, 77 transitions, 297 flow. Second operand 28 states and 1533 transitions. [2022-01-19 12:42:36,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 201 transitions, 1405 flow [2022-01-19 12:42:36,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 201 transitions, 1372 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-01-19 12:42:36,988 INFO L242 Difference]: Finished difference. Result has 127 places, 141 transitions, 1053 flow [2022-01-19 12:42:36,988 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1053, PETRI_PLACES=127, PETRI_TRANSITIONS=141} [2022-01-19 12:42:36,988 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 56 predicate places. [2022-01-19 12:42:36,989 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 141 transitions, 1053 flow [2022-01-19 12:42:36,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 51.92) internal successors, (1298), 25 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:42:36,989 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:42:36,989 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:42:36,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 12:42:37,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-19 12:42:37,194 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:42:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:42:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1331678400, now seen corresponding path program 2 times [2022-01-19 12:42:37,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:42:37,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663543338] [2022-01-19 12:42:37,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:42:37,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:42:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:42:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:42:37,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:42:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663543338] [2022-01-19 12:42:37,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663543338] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:42:37,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416563826] [2022-01-19 12:42:37,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 12:42:37,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:42:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:42:37,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:42:37,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 12:42:37,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 12:42:37,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 12:42:37,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 12:42:37,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:42:55,380 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:43:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:43:13,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:43:20,506 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:43:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:43:22,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416563826] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:43:22,430 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:43:22,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 26 [2022-01-19 12:43:22,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944041726] [2022-01-19 12:43:22,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:43:22,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 12:43:22,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:43:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 12:43:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=494, Unknown=4, NotChecked=0, Total=650 [2022-01-19 12:43:22,443 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 12:43:22,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 141 transitions, 1053 flow. Second operand has 26 states, 26 states have (on average 51.96153846153846) internal successors, (1351), 26 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:43:22,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:43:22,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 12:43:22,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:43:23,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:25,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:27,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:34,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:38,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:40,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:42,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:44,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:46,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:48,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:50,968 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:00,237 WARN L228 SmtUtils]: Spent 8.01s on a formula simplification. DAG size of input: 52 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:44:03,390 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:06,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:09,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:11,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:12,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:15,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:17,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:19,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:23,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:32,965 WARN L228 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 52 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:44:38,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:40,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:42,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:45,216 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:47,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:49,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:51,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:00,400 WARN L228 SmtUtils]: Spent 6.52s on a formula simplification. DAG size of input: 70 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:45:20,022 WARN L228 SmtUtils]: Spent 16.70s on a formula simplification. DAG size of input: 73 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:45:22,065 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:25,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:33,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:35,563 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:39,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:43,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:45,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:47,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:49,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:51,951 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:53,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:55,739 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:57,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:59,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:01,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:07,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:09,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:14,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:18,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:20,850 INFO L129 PetriNetUnfolder]: 216/824 cut-off events. [2022-01-19 12:46:20,850 INFO L130 PetriNetUnfolder]: For 2503/2503 co-relation queries the response was YES. [2022-01-19 12:46:20,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3304 conditions, 824 events. 216/824 cut-off events. For 2503/2503 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5554 event pairs, 13 based on Foata normal form. 6/824 useless extension candidates. Maximal degree in co-relation 3277. Up to 176 conditions per place. [2022-01-19 12:46:20,856 INFO L132 encePairwiseOnDemand]: 67/81 looper letters, 131 selfloop transitions, 166 changer transitions 15/352 dead transitions. [2022-01-19 12:46:20,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 352 transitions, 3634 flow [2022-01-19 12:46:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-19 12:46:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-01-19 12:46:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 1884 transitions. [2022-01-19 12:46:20,861 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6840958605664488 [2022-01-19 12:46:20,861 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 1884 transitions. [2022-01-19 12:46:20,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 1884 transitions. [2022-01-19 12:46:20,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:46:20,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 1884 transitions. [2022-01-19 12:46:20,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 55.411764705882355) internal successors, (1884), 34 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:46:20,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 81.0) internal successors, (2835), 35 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:46:20,868 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 81.0) internal successors, (2835), 35 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:46:20,869 INFO L186 Difference]: Start difference. First operand has 127 places, 141 transitions, 1053 flow. Second operand 34 states and 1884 transitions. [2022-01-19 12:46:20,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 352 transitions, 3634 flow [2022-01-19 12:46:20,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 352 transitions, 3286 flow, removed 166 selfloop flow, removed 11 redundant places. [2022-01-19 12:46:20,887 INFO L242 Difference]: Finished difference. Result has 159 places, 261 transitions, 2808 flow [2022-01-19 12:46:20,887 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2808, PETRI_PLACES=159, PETRI_TRANSITIONS=261} [2022-01-19 12:46:20,888 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 88 predicate places. [2022-01-19 12:46:20,888 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 261 transitions, 2808 flow [2022-01-19 12:46:20,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 51.96153846153846) internal successors, (1351), 26 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:46:20,888 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:46:20,888 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:46:20,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 12:46:21,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:46:21,092 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 12:46:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:46:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash 753234368, now seen corresponding path program 3 times [2022-01-19 12:46:21,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:46:21,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236633586] [2022-01-19 12:46:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:46:21,093 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:46:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:46:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:46:21,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:46:21,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236633586] [2022-01-19 12:46:21,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236633586] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:46:21,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728816401] [2022-01-19 12:46:21,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 12:46:21,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:46:21,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:46:21,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:46:21,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 12:46:22,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 12:46:22,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 12:46:22,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-19 12:46:22,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:46:48,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:46:48,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:49:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:49:24,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728816401] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:49:24,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:49:24,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 14] total 28 [2022-01-19 12:49:24,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143534541] [2022-01-19 12:49:24,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:49:24,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 12:49:24,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:49:24,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 12:49:24,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=585, Unknown=36, NotChecked=0, Total=756 [2022-01-19 12:49:24,027 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 12:49:24,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 261 transitions, 2808 flow. Second operand has 28 states, 28 states have (on average 52.17857142857143) internal successors, (1461), 28 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:49:24,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:49:24,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 12:49:24,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:49:31,964 WARN L228 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:49:35,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:37,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:39,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:48,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:58,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:00,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:02,667 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:04,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:07,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:09,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:12,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:14,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:15,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:18,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:19,574 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:24,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:26,741 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:28,880 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:30,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:32,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:34,947 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:40,333 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:41,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:47,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:49,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:51,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:53,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:55,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:57,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:59,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:01,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:03,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:05,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:07,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:10,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:11,290 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:13,361 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:30,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:32,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:35,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:37,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:39,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:41,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:57,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:15,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:19,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:21,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:23,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:25,066 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:27,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:29,089 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:31,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:25,521 WARN L228 SmtUtils]: Spent 33.61s on a formula simplification. DAG size of input: 50 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:53:27,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:29,817 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2022-01-19 12:53:30,402 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 [2022-01-19 12:53:30,402 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 12:53:31,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 12:53:31,606 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-01-19 12:53:31,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-01-19 12:53:31,613 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 12:53:31,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 12:53:31,613 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-19 12:53:31,614 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 12:53:31,614 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 12:53:31,617 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-01-19 12:53:31,623 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 12:53:31,623 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 12:53:31,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 12:53:31 BasicIcfg [2022-01-19 12:53:31,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 12:53:31,625 INFO L158 Benchmark]: Toolchain (without parser) took 881898.21ms. Allocated memory was 421.5MB in the beginning and 536.9MB in the end (delta: 115.3MB). Free memory was 366.3MB in the beginning and 215.1MB in the end (delta: 151.2MB). Peak memory consumption was 267.9MB. Max. memory is 16.0GB. [2022-01-19 12:53:31,625 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 421.5MB. Free memory is still 383.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 12:53:31,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.53ms. Allocated memory was 421.5MB in the beginning and 536.9MB in the end (delta: 115.3MB). Free memory was 366.0MB in the beginning and 508.3MB in the end (delta: -142.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.0GB. [2022-01-19 12:53:31,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.09ms. Allocated memory is still 536.9MB. Free memory was 508.3MB in the beginning and 507.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 12:53:31,626 INFO L158 Benchmark]: Boogie Preprocessor took 12.56ms. Allocated memory is still 536.9MB. Free memory was 507.0MB in the beginning and 505.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 12:53:31,626 INFO L158 Benchmark]: RCFGBuilder took 198.81ms. Allocated memory is still 536.9MB. Free memory was 505.1MB in the beginning and 491.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2022-01-19 12:53:31,626 INFO L158 Benchmark]: TraceAbstraction took 881471.36ms. Allocated memory is still 536.9MB. Free memory was 491.5MB in the beginning and 215.1MB in the end (delta: 276.4MB). Peak memory consumption was 277.0MB. Max. memory is 16.0GB. [2022-01-19 12:53:31,627 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.09ms. Allocated memory is still 421.5MB. Free memory is still 383.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 187.53ms. Allocated memory was 421.5MB in the beginning and 536.9MB in the end (delta: 115.3MB). Free memory was 366.0MB in the beginning and 508.3MB in the end (delta: -142.2MB). Peak memory consumption was 8.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 23.09ms. Allocated memory is still 536.9MB. Free memory was 508.3MB in the beginning and 507.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 12.56ms. Allocated memory is still 536.9MB. Free memory was 507.0MB in the beginning and 505.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 198.81ms. Allocated memory is still 536.9MB. Free memory was 505.1MB in the beginning and 491.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 881471.36ms. Allocated memory is still 536.9MB. Free memory was 491.5MB in the beginning and 215.1MB in the end (delta: 276.4MB). Peak memory consumption was 277.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 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: 881.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 486.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 79 mSolverCounterUnknown, 733 SdHoareTripleChecker+Valid, 254.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 733 mSDsluCounter, 358 SdHoareTripleChecker+Invalid, 253.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 661 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2173 IncrementalHoareTripleChecker+Invalid, 2429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 87 mSDtfsCounter, 2173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 633 GetRequests, 462 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 390.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2808occurred in iteration=7, InterpolantAutomatonStates: 95, 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.0s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 391.9s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 18049 SizeOfPredicates, 30 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 2/32 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