/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.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 00:14:43,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:14:43,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:14:43,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:14:43,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:14:43,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:14:43,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:14:43,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:14:43,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:14:43,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:14:43,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:14:43,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:14:43,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:14:43,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:14:43,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:14:43,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:14:43,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:14:43,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:14:43,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:14:43,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:14:43,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:14:43,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:14:43,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:14:43,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:14:43,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:14:43,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:14:43,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:14:43,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:14:43,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:14:43,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:14:43,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:14:43,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:14:43,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:14:43,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:14:43,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:14:43,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:14:43,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:14:43,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:14:43,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:14:43,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:14:43,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:14:43,613 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.epf [2022-01-19 00:14:43,633 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:14:43,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:14:43,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:14:43,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:14:43,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:14:43,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:14:43,634 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:14:43,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:14:43,634 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:14:43,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:14:43,634 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:14:43,634 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:14:43,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:14:43,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:14:43,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:14:43,635 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:14:43,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:14:43,635 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:14:43,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:14:43,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:14:43,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:14:43,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:14:43,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:14:43,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:14:43,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:14:43,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:14:43,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:14:43,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:14:43,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:14:43,638 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:14:43,638 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:14:43,639 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 00:14:43,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:14:43,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:14:43,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:14:43,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:14:43,832 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:14:43,833 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 00:14:43,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf27118c9/b7dfaed2a9ef467dba1e557b8ff5916a/FLAGcbea347c0 [2022-01-19 00:14:44,248 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:14:44,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-01-19 00:14:44,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf27118c9/b7dfaed2a9ef467dba1e557b8ff5916a/FLAGcbea347c0 [2022-01-19 00:14:44,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf27118c9/b7dfaed2a9ef467dba1e557b8ff5916a [2022-01-19 00:14:44,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:14:44,274 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:14:44,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:14:44,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:14:44,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:14:44,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fca2ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44, skipping insertion in model container [2022-01-19 00:14:44,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:14:44,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:14:44,434 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 00:14:44,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:14:44,441 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:14:44,454 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 00:14:44,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:14:44,463 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:14:44,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44 WrapperNode [2022-01-19 00:14:44,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:14:44,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:14:44,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:14:44,465 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:14:44,477 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:14:44" (1/1) ... [2022-01-19 00:14:44,482 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:14:44" (1/1) ... [2022-01-19 00:14:44,499 INFO L137 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-01-19 00:14:44,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:14:44,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:14:44,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:14:44,500 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:14:44,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:14:44,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:14:44,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:14:44,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:14:44,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (1/1) ... [2022-01-19 00:14:44,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:14:44,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:14:44,555 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 00:14:44,568 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 00:14:44,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:14:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:14:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:14:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:14:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:14:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:14:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:14:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:14:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:14:44,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:14:44,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:14:44,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:14:44,590 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 00:14:44,658 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:14:44,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:14:44,806 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:14:44,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:14:44,811 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 00:14:44,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:14:44 BoogieIcfgContainer [2022-01-19 00:14:44,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:14:44,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:14:44,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:14:44,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:14:44,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:14:44" (1/3) ... [2022-01-19 00:14:44,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53460996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:14:44, skipping insertion in model container [2022-01-19 00:14:44,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:14:44" (2/3) ... [2022-01-19 00:14:44,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53460996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:14:44, skipping insertion in model container [2022-01-19 00:14:44,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:14:44" (3/3) ... [2022-01-19 00:14:44,818 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2022-01-19 00:14:44,821 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:14:44,822 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:14:44,822 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:14:44,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,847 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,849 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,851 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,852 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,853 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,854 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:14:44,857 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 00:14:44,888 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:14:44,892 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 00:14:44,892 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 00:14:44,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 81 transitions, 178 flow [2022-01-19 00:14:44,957 INFO L129 PetriNetUnfolder]: 6/79 cut-off events. [2022-01-19 00:14:44,958 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:14:44,960 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 00:14:44,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 81 transitions, 178 flow [2022-01-19 00:14:44,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 70 transitions, 152 flow [2022-01-19 00:14:44,997 INFO L129 PetriNetUnfolder]: 6/69 cut-off events. [2022-01-19 00:14:44,997 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:14:44,998 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:44,998 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 00:14:44,998 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:14:45,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:45,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1132836851, now seen corresponding path program 1 times [2022-01-19 00:14:45,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:45,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388153354] [2022-01-19 00:14:45,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:45,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:45,187 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 00:14:45,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:45,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388153354] [2022-01-19 00:14:45,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388153354] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:45,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:45,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 00:14:45,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483570870] [2022-01-19 00:14:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:45,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 00:14:45,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:45,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 00:14:45,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 00:14:45,215 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 81 [2022-01-19 00:14:45,218 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 00:14:45,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:45,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 81 [2022-01-19 00:14:45,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:45,237 INFO L129 PetriNetUnfolder]: 2/66 cut-off events. [2022-01-19 00:14:45,237 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 00:14:45,238 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 00:14:45,239 INFO L132 encePairwiseOnDemand]: 77/81 looper letters, 4 selfloop transitions, 0 changer transitions 2/66 dead transitions. [2022-01-19 00:14:45,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 66 transitions, 152 flow [2022-01-19 00:14:45,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 00:14:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 00:14:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-01-19 00:14:45,253 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9382716049382716 [2022-01-19 00:14:45,253 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 152 transitions. [2022-01-19 00:14:45,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 152 transitions. [2022-01-19 00:14:45,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:45,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 152 transitions. [2022-01-19 00:14:45,257 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 00:14:45,260 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 00:14:45,260 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 00:14:45,262 INFO L186 Difference]: Start difference. First operand has 71 places, 70 transitions, 152 flow. Second operand 2 states and 152 transitions. [2022-01-19 00:14:45,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 66 transitions, 152 flow [2022-01-19 00:14:45,264 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 00:14:45,266 INFO L242 Difference]: Finished difference. Result has 68 places, 64 transitions, 132 flow [2022-01-19 00:14:45,267 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 00:14:45,270 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2022-01-19 00:14:45,270 INFO L470 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 132 flow [2022-01-19 00:14:45,270 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 00:14:45,270 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:45,270 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 00:14:45,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:14:45,271 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:14:45,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2129909204, now seen corresponding path program 1 times [2022-01-19 00:14:45,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:45,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374938234] [2022-01-19 00:14:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:45,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:45,420 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 00:14:45,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:45,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374938234] [2022-01-19 00:14:45,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374938234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:45,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:45,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:14:45,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698616550] [2022-01-19 00:14:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:45,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:14:45,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:45,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:14:45,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:14:45,424 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 81 [2022-01-19 00:14:45,425 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 00:14:45,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:45,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 81 [2022-01-19 00:14:45,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:45,537 INFO L129 PetriNetUnfolder]: 31/147 cut-off events. [2022-01-19 00:14:45,537 INFO L130 PetriNetUnfolder]: For 8/20 co-relation queries the response was YES. [2022-01-19 00:14:45,538 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 00:14:45,539 INFO L132 encePairwiseOnDemand]: 73/81 looper letters, 25 selfloop transitions, 5 changer transitions 4/76 dead transitions. [2022-01-19 00:14:45,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 227 flow [2022-01-19 00:14:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:14:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:14:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 399 transitions. [2022-01-19 00:14:45,541 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2022-01-19 00:14:45,542 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 399 transitions. [2022-01-19 00:14:45,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 399 transitions. [2022-01-19 00:14:45,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:45,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 399 transitions. [2022-01-19 00:14:45,544 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 00:14:45,545 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 00:14:45,546 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 00:14:45,546 INFO L186 Difference]: Start difference. First operand has 68 places, 64 transitions, 132 flow. Second operand 7 states and 399 transitions. [2022-01-19 00:14:45,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 227 flow [2022-01-19 00:14:45,547 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 00:14:45,548 INFO L242 Difference]: Finished difference. Result has 75 places, 66 transitions, 159 flow [2022-01-19 00:14:45,548 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 00:14:45,548 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2022-01-19 00:14:45,549 INFO L470 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 159 flow [2022-01-19 00:14:45,549 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 00:14:45,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:45,549 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 00:14:45,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:14:45,549 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:14:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1998264494, now seen corresponding path program 1 times [2022-01-19 00:14:45,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:45,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150829429] [2022-01-19 00:14:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:45,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:45,657 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 00:14:45,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:45,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150829429] [2022-01-19 00:14:45,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150829429] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:14:45,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162368984] [2022-01-19 00:14:45,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:45,658 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:14:45,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:14:45,662 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 00:14:45,664 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 00:14:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:45,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 00:14:45,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:14:46,014 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 00:14:46,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:14:46,245 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 00:14:46,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162368984] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:14:46,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:14:46,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-19 00:14:46,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925640584] [2022-01-19 00:14:46,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:14:46,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:14:46,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:14:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:14:46,251 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 00:14:46,252 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 00:14:46,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:46,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 00:14:46,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:46,514 INFO L129 PetriNetUnfolder]: 38/186 cut-off events. [2022-01-19 00:14:46,514 INFO L130 PetriNetUnfolder]: For 26/34 co-relation queries the response was YES. [2022-01-19 00:14:46,514 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 00:14:46,515 INFO L132 encePairwiseOnDemand]: 70/81 looper letters, 40 selfloop transitions, 16 changer transitions 1/97 dead transitions. [2022-01-19 00:14:46,515 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 97 transitions, 361 flow [2022-01-19 00:14:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:14:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:14:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 611 transitions. [2022-01-19 00:14:46,517 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6857463524130191 [2022-01-19 00:14:46,518 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 611 transitions. [2022-01-19 00:14:46,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 611 transitions. [2022-01-19 00:14:46,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:46,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 611 transitions. [2022-01-19 00:14:46,519 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 00:14:46,521 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 00:14:46,521 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 00:14:46,521 INFO L186 Difference]: Start difference. First operand has 75 places, 66 transitions, 159 flow. Second operand 11 states and 611 transitions. [2022-01-19 00:14:46,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 97 transitions, 361 flow [2022-01-19 00:14:46,522 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 00:14:46,523 INFO L242 Difference]: Finished difference. Result has 84 places, 74 transitions, 244 flow [2022-01-19 00:14:46,524 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 00:14:46,524 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 13 predicate places. [2022-01-19 00:14:46,524 INFO L470 AbstractCegarLoop]: Abstraction has has 84 places, 74 transitions, 244 flow [2022-01-19 00:14:46,525 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 00:14:46,525 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:46,525 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 00:14:46,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 00:14:46,741 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 00:14:46,742 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:14:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -2140770938, now seen corresponding path program 2 times [2022-01-19 00:14:46,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:46,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121281870] [2022-01-19 00:14:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:46,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:46,863 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 00:14:46,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:46,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121281870] [2022-01-19 00:14:46,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121281870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:46,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:46,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:14:46,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635481047] [2022-01-19 00:14:46,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:46,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:14:46,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:14:46,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:14:46,869 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 00:14:46,870 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 00:14:46,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:46,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 00:14:46,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:46,946 INFO L129 PetriNetUnfolder]: 34/161 cut-off events. [2022-01-19 00:14:46,947 INFO L130 PetriNetUnfolder]: For 110/114 co-relation queries the response was YES. [2022-01-19 00:14:46,950 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 00:14:46,954 INFO L132 encePairwiseOnDemand]: 72/81 looper letters, 32 selfloop transitions, 5 changer transitions 7/84 dead transitions. [2022-01-19 00:14:46,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 84 transitions, 386 flow [2022-01-19 00:14:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:14:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:14:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 338 transitions. [2022-01-19 00:14:46,955 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6954732510288066 [2022-01-19 00:14:46,955 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 338 transitions. [2022-01-19 00:14:46,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 338 transitions. [2022-01-19 00:14:46,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:46,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 338 transitions. [2022-01-19 00:14:46,956 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 00:14:46,957 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 00:14:46,957 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 00:14:46,957 INFO L186 Difference]: Start difference. First operand has 84 places, 74 transitions, 244 flow. Second operand 6 states and 338 transitions. [2022-01-19 00:14:46,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 84 transitions, 386 flow [2022-01-19 00:14:46,961 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 00:14:46,964 INFO L242 Difference]: Finished difference. Result has 87 places, 74 transitions, 252 flow [2022-01-19 00:14:46,964 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 00:14:46,965 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 16 predicate places. [2022-01-19 00:14:46,965 INFO L470 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 252 flow [2022-01-19 00:14:46,966 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 00:14:46,966 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:46,966 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 00:14:46,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:14:46,966 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:14:46,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:46,967 INFO L85 PathProgramCache]: Analyzing trace with hash 265794878, now seen corresponding path program 1 times [2022-01-19 00:14:46,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:46,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641604090] [2022-01-19 00:14:46,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:46,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:47,063 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 00:14:47,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:47,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641604090] [2022-01-19 00:14:47,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641604090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:14:47,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:14:47,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:14:47,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756184264] [2022-01-19 00:14:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:14:47,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:14:47,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:14:47,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:14:47,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:14:47,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 00:14:47,067 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 00:14:47,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:14:47,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 00:14:47,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:14:47,164 INFO L129 PetriNetUnfolder]: 34/142 cut-off events. [2022-01-19 00:14:47,164 INFO L130 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-01-19 00:14:47,165 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 00:14:47,166 INFO L132 encePairwiseOnDemand]: 70/81 looper letters, 33 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2022-01-19 00:14:47,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 409 flow [2022-01-19 00:14:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:14:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:14:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 389 transitions. [2022-01-19 00:14:47,168 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6860670194003528 [2022-01-19 00:14:47,168 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 389 transitions. [2022-01-19 00:14:47,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 389 transitions. [2022-01-19 00:14:47,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:14:47,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 389 transitions. [2022-01-19 00:14:47,170 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 00:14:47,170 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 00:14:47,170 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 00:14:47,171 INFO L186 Difference]: Start difference. First operand has 87 places, 74 transitions, 252 flow. Second operand 7 states and 389 transitions. [2022-01-19 00:14:47,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 409 flow [2022-01-19 00:14:47,174 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 00:14:47,176 INFO L242 Difference]: Finished difference. Result has 89 places, 77 transitions, 297 flow [2022-01-19 00:14:47,176 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 00:14:47,178 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 18 predicate places. [2022-01-19 00:14:47,178 INFO L470 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 297 flow [2022-01-19 00:14:47,178 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 00:14:47,178 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:14:47,178 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 00:14:47,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:14:47,179 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:14:47,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:14:47,181 INFO L85 PathProgramCache]: Analyzing trace with hash -323089442, now seen corresponding path program 1 times [2022-01-19 00:14:47,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:14:47,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582000597] [2022-01-19 00:14:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:47,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:14:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:47,579 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 00:14:47,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:14:47,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582000597] [2022-01-19 00:14:47,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582000597] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:14:47,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597809002] [2022-01-19 00:14:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:14:47,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:14:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:14:47,581 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 00:14:47,620 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 00:14:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:14:47,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 00:14:47,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:15:01,958 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:16:34,982 WARN L228 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 31 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-19 00:16:47,889 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 00:16:47,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:17:07,148 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:17:07,352 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 00:17:07,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597809002] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:17:07,353 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:17:07,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2022-01-19 00:17:07,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619410108] [2022-01-19 00:17:07,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:17:07,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 00:17:07,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:17:07,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 00:17:07,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=467, Unknown=7, NotChecked=0, Total=600 [2022-01-19 00:17:07,355 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 00:17:07,356 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 00:17:07,356 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:17:07,356 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 00:17:07,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:17:12,857 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 00:17:15,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:17:22,642 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 00:17:25,647 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 00:17:28,873 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 00:17:36,175 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 00:17:38,275 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 00:17:40,559 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 00:17:54,507 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 00:17:55,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:18:05,717 INFO L129 PetriNetUnfolder]: 123/437 cut-off events. [2022-01-19 00:18:05,717 INFO L130 PetriNetUnfolder]: For 581/581 co-relation queries the response was YES. [2022-01-19 00:18:05,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 437 events. 123/437 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2216 event pairs, 5 based on Foata normal form. 4/440 useless extension candidates. Maximal degree in co-relation 1355. Up to 73 conditions per place. [2022-01-19 00:18:05,720 INFO L132 encePairwiseOnDemand]: 67/81 looper letters, 76 selfloop transitions, 71 changer transitions 16/203 dead transitions. [2022-01-19 00:18:05,720 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 203 transitions, 1425 flow [2022-01-19 00:18:05,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 00:18:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 00:18:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1584 transitions. [2022-01-19 00:18:05,724 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6743295019157088 [2022-01-19 00:18:05,724 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 1584 transitions. [2022-01-19 00:18:05,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 1584 transitions. [2022-01-19 00:18:05,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:18:05,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1584 transitions. [2022-01-19 00:18:05,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 54.62068965517241) internal successors, (1584), 29 states have internal predecessors, (1584), 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 00:18:05,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 81.0) internal successors, (2430), 30 states have internal predecessors, (2430), 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 00:18:05,730 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 81.0) internal successors, (2430), 30 states have internal predecessors, (2430), 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 00:18:05,730 INFO L186 Difference]: Start difference. First operand has 89 places, 77 transitions, 297 flow. Second operand 29 states and 1584 transitions. [2022-01-19 00:18:05,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 203 transitions, 1425 flow [2022-01-19 00:18:05,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 203 transitions, 1388 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-01-19 00:18:05,735 INFO L242 Difference]: Finished difference. Result has 129 places, 146 transitions, 1113 flow [2022-01-19 00:18:05,735 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=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1113, PETRI_PLACES=129, PETRI_TRANSITIONS=146} [2022-01-19 00:18:05,735 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 58 predicate places. [2022-01-19 00:18:05,735 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 146 transitions, 1113 flow [2022-01-19 00:18:05,736 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 00:18:05,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:18:05,736 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 00:18:05,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 00:18:05,936 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 00:18:05,937 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:18:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:18:05,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1331678400, now seen corresponding path program 2 times [2022-01-19 00:18:05,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:18:05,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224561261] [2022-01-19 00:18:05,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:18:05,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:18:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:18:06,203 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 00:18:06,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:18:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224561261] [2022-01-19 00:18:06,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224561261] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:18:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302337254] [2022-01-19 00:18:06,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 00:18:06,204 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:18:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:18:06,206 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 00:18:06,207 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 00:18:06,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 00:18:06,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:18:06,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 00:18:06,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:18:18,512 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:18:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:18:34,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:18:43,427 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 00:18:43,638 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 00:18:43,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302337254] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:18:43,639 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:18:43,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 26 [2022-01-19 00:18:43,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190357769] [2022-01-19 00:18:43,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:18:43,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 00:18:43,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:18:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 00:18:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=494, Unknown=2, NotChecked=0, Total=650 [2022-01-19 00:18:43,641 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 00:18:43,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 146 transitions, 1113 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 00:18:43,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:18:43,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 00:18:43,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:18:46,185 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 00:18:48,197 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 00:18:53,166 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 00:18:56,252 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 00:18:58,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:00,846 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 00:19:10,203 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 00:19:12,430 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 00:19:17,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:19,883 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 00:19:21,889 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 00:19:24,720 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 00:19:26,748 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 00:19:35,856 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 00:19:38,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:46,039 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 00:19:48,075 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 00:19:50,616 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 00:19:51,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:19:54,044 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 00:19:56,054 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 00:19:58,066 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 00:20:00,081 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 00:20:07,891 WARN L228 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 56 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:20:18,625 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 00:20:28,083 WARN L228 SmtUtils]: Spent 7.16s on a formula simplification. DAG size of input: 77 DAG size of output: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:20:30,094 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 00:20:45,199 WARN L228 SmtUtils]: Spent 13.81s on a formula simplification. DAG size of input: 65 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:20:56,773 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 00:21:04,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:07,033 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 00:21:16,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:20,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:23,683 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 00:21:26,575 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 00:21:28,442 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:21:33,160 INFO L129 PetriNetUnfolder]: 217/808 cut-off events. [2022-01-19 00:21:33,160 INFO L130 PetriNetUnfolder]: For 2387/2387 co-relation queries the response was YES. [2022-01-19 00:21:33,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3243 conditions, 808 events. 217/808 cut-off events. For 2387/2387 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5318 event pairs, 12 based on Foata normal form. 5/809 useless extension candidates. Maximal degree in co-relation 3215. Up to 185 conditions per place. [2022-01-19 00:21:33,168 INFO L132 encePairwiseOnDemand]: 66/81 looper letters, 125 selfloop transitions, 168 changer transitions 14/347 dead transitions. [2022-01-19 00:21:33,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 347 transitions, 3566 flow [2022-01-19 00:21:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-19 00:21:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-01-19 00:21:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2086 transitions. [2022-01-19 00:21:33,173 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6777128005198181 [2022-01-19 00:21:33,173 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2086 transitions. [2022-01-19 00:21:33,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2086 transitions. [2022-01-19 00:21:33,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:21:33,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2086 transitions. [2022-01-19 00:21:33,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 54.89473684210526) internal successors, (2086), 38 states have internal predecessors, (2086), 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 00:21:33,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 81.0) internal successors, (3159), 39 states have internal predecessors, (3159), 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 00:21:33,181 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 81.0) internal successors, (3159), 39 states have internal predecessors, (3159), 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 00:21:33,181 INFO L186 Difference]: Start difference. First operand has 129 places, 146 transitions, 1113 flow. Second operand 38 states and 2086 transitions. [2022-01-19 00:21:33,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 347 transitions, 3566 flow [2022-01-19 00:21:33,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 347 transitions, 3242 flow, removed 154 selfloop flow, removed 11 redundant places. [2022-01-19 00:21:33,197 INFO L242 Difference]: Finished difference. Result has 165 places, 259 transitions, 2655 flow [2022-01-19 00:21:33,197 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=81, PETRI_DIFFERENCE_MINUEND_FLOW=997, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2655, PETRI_PLACES=165, PETRI_TRANSITIONS=259} [2022-01-19 00:21:33,198 INFO L334 CegarLoopForPetriNet]: 71 programPoint places, 94 predicate places. [2022-01-19 00:21:33,198 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 259 transitions, 2655 flow [2022-01-19 00:21:33,198 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 00:21:33,198 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:21:33,198 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 00:21:33,203 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 00:21:33,401 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 00:21:33,402 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:21:33,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:21:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash 590009386, now seen corresponding path program 3 times [2022-01-19 00:21:33,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:21:33,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388781388] [2022-01-19 00:21:33,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:21:33,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:21:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:21:33,505 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 00:21:33,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:21:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388781388] [2022-01-19 00:21:33,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388781388] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:21:33,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25924051] [2022-01-19 00:21:33,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 00:21:33,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:21:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:21:33,507 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 00:21:33,508 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 00:21:55,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 00:21:55,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 00:21:55,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-19 00:21:55,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:22:16,044 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 00:22:16,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:24:36,334 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 00:24:36,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25924051] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:24:36,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:24:36,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 14] total 28 [2022-01-19 00:24:36,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207938228] [2022-01-19 00:24:36,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:24:36,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 00:24:36,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:24:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 00:24:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=591, Unknown=41, NotChecked=0, Total=756 [2022-01-19 00:24:36,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 81 [2022-01-19 00:24:36,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 259 transitions, 2655 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 00:24:36,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:24:36,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 81 [2022-01-19 00:24:36,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:24:45,371 WARN L228 SmtUtils]: Spent 8.83s 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 00:25:03,443 WARN L228 SmtUtils]: Spent 11.88s on a formula simplification. DAG size of input: 65 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:25:05,536 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 00:25:17,653 WARN L228 SmtUtils]: Spent 11.17s on a formula simplification. DAG size of input: 72 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:25:32,474 WARN L228 SmtUtils]: Spent 9.93s on a formula simplification. DAG size of input: 74 DAG size of output: 17 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:25:34,479 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 00:25:36,487 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 00:25:39,462 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 00:25:41,469 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 00:25:43,486 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 00:25:45,610 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 00:25:46,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:48,995 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 00:25:51,980 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 00:25:54,006 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 00:25:56,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:25:58,128 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 00:26:01,682 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 00:26:03,725 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 00:26:08,433 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 00:26:10,445 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 00:26:13,261 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 00:26:15,271 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 00:26:16,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:18,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:26:20,264 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 00:26:22,280 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 00:26:24,491 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 00:26:40,186 WARN L228 SmtUtils]: Spent 12.24s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:26:42,195 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 00:26:44,207 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 00:26:47,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:04,057 WARN L228 SmtUtils]: Spent 13.49s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 00:27:06,490 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 00:27:08,518 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 00:27:10,528 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 00:27:13,460 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 00:27:14,599 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 00:27:16,609 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 00:27:18,617 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 00:27:20,528 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 00:27:22,551 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 00:27:25,531 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 00:27:27,539 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 00:27:29,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:27:43,078 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 00:27:45,088 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 00:27:47,108 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 00:27:49,118 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 00:27:51,132 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 00:27:53,467 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 00:28:10,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 00:28:12,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:28:14,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 00:28:23,403 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 00:28:25,411 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 00:28:27,420 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 00:28:30,097 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 00:28:32,106 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 00:28:34,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 00:28:51,548 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 00:29:08,299 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 [] Received shutdown request... [2022-01-19 00:29:25,948 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 00:29:25,948 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 00:29:25,959 WARN L244 SmtUtils]: Removed 8 from assertion stack [2022-01-19 00:29:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:29:25,960 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 00:29:25,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 00:29:26,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:29:26,161 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 9501ms.. [2022-01-19 00:29:26,163 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 00:29:26,163 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 00:29:26,165 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2022-01-19 00:29:26,166 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 00:29:26,166 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 00:29:26,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 12:29:26 BasicIcfg [2022-01-19 00:29:26,168 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 00:29:26,168 INFO L158 Benchmark]: Toolchain (without parser) took 881894.94ms. Allocated memory was 388.0MB in the beginning and 572.5MB in the end (delta: 184.5MB). Free memory was 335.1MB in the beginning and 424.0MB in the end (delta: -88.8MB). Peak memory consumption was 96.6MB. Max. memory is 16.0GB. [2022-01-19 00:29:26,169 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 388.0MB. Free memory is still 351.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 00:29:26,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.88ms. Allocated memory was 388.0MB in the beginning and 572.5MB in the end (delta: 184.5MB). Free memory was 334.9MB in the beginning and 546.6MB in the end (delta: -211.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. [2022-01-19 00:29:26,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.86ms. Allocated memory is still 572.5MB. Free memory was 546.6MB in the beginning and 544.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 00:29:26,169 INFO L158 Benchmark]: Boogie Preprocessor took 26.88ms. Allocated memory is still 572.5MB. Free memory was 544.5MB in the beginning and 543.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 00:29:26,169 INFO L158 Benchmark]: RCFGBuilder took 285.56ms. Allocated memory is still 572.5MB. Free memory was 543.5MB in the beginning and 529.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2022-01-19 00:29:26,169 INFO L158 Benchmark]: TraceAbstraction took 881354.24ms. Allocated memory is still 572.5MB. Free memory was 528.8MB in the beginning and 424.0MB in the end (delta: 104.8MB). Peak memory consumption was 105.9MB. Max. memory is 16.0GB. [2022-01-19 00:29:26,170 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.12ms. Allocated memory is still 388.0MB. Free memory is still 351.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 187.88ms. Allocated memory was 388.0MB in the beginning and 572.5MB in the end (delta: 184.5MB). Free memory was 334.9MB in the beginning and 546.6MB in the end (delta: -211.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 34.86ms. Allocated memory is still 572.5MB. Free memory was 546.6MB in the beginning and 544.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.88ms. Allocated memory is still 572.5MB. Free memory was 544.5MB in the beginning and 543.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 285.56ms. Allocated memory is still 572.5MB. Free memory was 543.5MB in the beginning and 529.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 881354.24ms. Allocated memory is still 572.5MB. Free memory was 528.8MB in the beginning and 424.0MB in the end (delta: 104.8MB). Peak memory consumption was 105.9MB. 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 PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 9501ms.. - 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 PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 9501ms.. - 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 PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 84 for 9501ms.. - 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.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 518.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 81 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 246.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 362 SdHoareTripleChecker+Invalid, 244.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 672 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2351 IncrementalHoareTripleChecker+Invalid, 2583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 86 mSDtfsCounter, 2351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 635 GetRequests, 461 SyntacticMatches, 11 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 417.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2655occurred in iteration=7, InterpolantAutomatonStates: 100, 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, 22.8s SatisfiabilityAnalysisTime, 338.9s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 17474 SizeOfPredicates, 30 NumberOfNonLiveVariables, 584 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 3/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