./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:34:45,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:34:45,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:34:45,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:34:45,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:34:45,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:34:45,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:34:45,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:34:45,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:34:45,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:34:45,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:34:45,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:34:45,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:34:45,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:34:45,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:34:45,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:34:45,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:34:45,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:34:45,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:34:45,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:34:45,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:34:45,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:34:45,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:34:45,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:34:45,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:34:45,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:34:45,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:34:45,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:34:45,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:34:45,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:34:45,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:34:45,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:34:45,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:34:45,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:34:45,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:34:45,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:34:45,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:34:45,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:34:45,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:34:45,267 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:34:45,268 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:34:45,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 22:34:45,291 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:34:45,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:34:45,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:34:45,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:34:45,292 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:34:45,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:34:45,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:34:45,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:34:45,293 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:34:45,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:34:45,294 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:34:45,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 22:34:45,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:34:45,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:34:45,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:34:45,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:34:45,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:34:45,295 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:34:45,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:34:45,295 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:34:45,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:34:45,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:34:45,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:34:45,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:34:45,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:34:45,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:34:45,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:34:45,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:34:45,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 22:34:45,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 22:34:45,297 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:34:45,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:34:45,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:34:45,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:34:45,297 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 [2021-12-17 22:34:45,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:34:45,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:34:45,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:34:45,504 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:34:45,504 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:34:45,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2021-12-17 22:34:45,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac80ceda0/7ba1ed540a6c4c89b533ced88c8eb66f/FLAG72254b17b [2021-12-17 22:34:45,888 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:34:45,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c [2021-12-17 22:34:45,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac80ceda0/7ba1ed540a6c4c89b533ced88c8eb66f/FLAG72254b17b [2021-12-17 22:34:45,904 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac80ceda0/7ba1ed540a6c4c89b533ced88c8eb66f [2021-12-17 22:34:45,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:34:45,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:34:45,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:34:45,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:34:45,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:34:45,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:34:45" (1/1) ... [2021-12-17 22:34:45,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fadde6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:45, skipping insertion in model container [2021-12-17 22:34:45,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:34:45" (1/1) ... [2021-12-17 22:34:45,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:34:45,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:34:46,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c[2237,2250] [2021-12-17 22:34:46,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:34:46,044 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:34:46,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x3.wvr.c[2237,2250] [2021-12-17 22:34:46,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:34:46,073 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:34:46,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46 WrapperNode [2021-12-17 22:34:46,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:34:46,075 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:34:46,075 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:34:46,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:34:46,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,107 INFO L137 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2021-12-17 22:34:46,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:34:46,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:34:46,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:34:46,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:34:46,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:34:46,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:34:46,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:34:46,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:34:46,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (1/1) ... [2021-12-17 22:34:46,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:34:46,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:34:46,146 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) [2021-12-17 22:34:46,153 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 [2021-12-17 22:34:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:34:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-17 22:34:46,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-17 22:34:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-17 22:34:46,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-17 22:34:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-17 22:34:46,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-17 22:34:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-17 22:34:46,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-17 22:34:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 22:34:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:34:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 22:34:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:34:46,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:34:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-17 22:34:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:34:46,193 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:34:46,300 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:34:46,307 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:34:46,493 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:34:46,501 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:34:46,501 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-17 22:34:46,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:34:46 BoogieIcfgContainer [2021-12-17 22:34:46,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:34:46,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:34:46,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:34:46,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:34:46,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:34:45" (1/3) ... [2021-12-17 22:34:46,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ad79ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:34:46, skipping insertion in model container [2021-12-17 22:34:46,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:34:46" (2/3) ... [2021-12-17 22:34:46,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ad79ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:34:46, skipping insertion in model container [2021-12-17 22:34:46,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:34:46" (3/3) ... [2021-12-17 22:34:46,511 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2021-12-17 22:34:46,515 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:34:46,515 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:34:46,515 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 22:34:46,515 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:34:46,548 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,548 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,549 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,552 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,552 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,552 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,552 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,555 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,556 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,556 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,556 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,562 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,562 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,570 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,572 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,573 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:34:46,581 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-17 22:34:46,640 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:34:46,647 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=true, 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 [2021-12-17 22:34:46,648 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-17 22:34:46,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 282 flow [2021-12-17 22:34:46,698 INFO L129 PetriNetUnfolder]: 10/121 cut-off events. [2021-12-17 22:34:46,699 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-17 22:34:46,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 121 events. 10/121 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2021-12-17 22:34:46,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 282 flow [2021-12-17 22:34:46,707 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2021-12-17 22:34:46,725 INFO L129 PetriNetUnfolder]: 10/107 cut-off events. [2021-12-17 22:34:46,726 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-17 22:34:46,726 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:34:46,726 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:34:46,727 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:34:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:34:46,730 INFO L85 PathProgramCache]: Analyzing trace with hash -121838707, now seen corresponding path program 1 times [2021-12-17 22:34:46,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:34:46,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020498488] [2021-12-17 22:34:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:34:46,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:34:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:34:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:34:46,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:34:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020498488] [2021-12-17 22:34:46,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020498488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:34:46,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:34:46,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:34:46,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689895932] [2021-12-17 22:34:46,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:34:46,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 22:34:46,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:34:46,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 22:34:46,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 22:34:47,000 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2021-12-17 22:34:47,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 240 flow. Second operand has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 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) [2021-12-17 22:34:47,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:34:47,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2021-12-17 22:34:47,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:34:47,055 INFO L129 PetriNetUnfolder]: 4/102 cut-off events. [2021-12-17 22:34:47,059 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-12-17 22:34:47,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 102 events. 4/102 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 18/114 useless extension candidates. Maximal degree in co-relation 83. Up to 9 conditions per place. [2021-12-17 22:34:47,062 INFO L132 encePairwiseOnDemand]: 119/125 looper letters, 8 selfloop transitions, 0 changer transitions 2/102 dead transitions. [2021-12-17 22:34:47,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 244 flow [2021-12-17 22:34:47,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 22:34:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 22:34:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 234 transitions. [2021-12-17 22:34:47,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.936 [2021-12-17 22:34:47,072 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 234 transitions. [2021-12-17 22:34:47,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 234 transitions. [2021-12-17 22:34:47,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:34:47,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 234 transitions. [2021-12-17 22:34:47,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 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) [2021-12-17 22:34:47,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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) [2021-12-17 22:34:47,084 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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) [2021-12-17 22:34:47,085 INFO L186 Difference]: Start difference. First operand has 111 places, 108 transitions, 240 flow. Second operand 2 states and 234 transitions. [2021-12-17 22:34:47,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 244 flow [2021-12-17 22:34:47,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 228 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-17 22:34:47,090 INFO L242 Difference]: Finished difference. Result has 104 places, 100 transitions, 208 flow [2021-12-17 22:34:47,097 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=208, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2021-12-17 22:34:47,102 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -7 predicate places. [2021-12-17 22:34:47,102 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 208 flow [2021-12-17 22:34:47,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 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) [2021-12-17 22:34:47,102 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:34:47,106 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:34:47,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 22:34:47,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:34:47,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:34:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash 560355165, now seen corresponding path program 1 times [2021-12-17 22:34:47,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:34:47,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291074856] [2021-12-17 22:34:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:34:47,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:34:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:34:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:34:47,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:34:47,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291074856] [2021-12-17 22:34:47,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291074856] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:34:47,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:34:47,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:34:47,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194671828] [2021-12-17 22:34:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:34:47,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:34:47,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:34:47,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:34:47,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:34:47,602 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 125 [2021-12-17 22:34:47,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 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) [2021-12-17 22:34:47,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:34:47,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 125 [2021-12-17 22:34:47,604 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:34:47,906 INFO L129 PetriNetUnfolder]: 895/1602 cut-off events. [2021-12-17 22:34:47,907 INFO L130 PetriNetUnfolder]: For 80/135 co-relation queries the response was YES. [2021-12-17 22:34:47,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 1602 events. 895/1602 cut-off events. For 80/135 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7810 event pairs, 272 based on Foata normal form. 2/1156 useless extension candidates. Maximal degree in co-relation 2915. Up to 796 conditions per place. [2021-12-17 22:34:47,945 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 47 selfloop transitions, 7 changer transitions 4/122 dead transitions. [2021-12-17 22:34:47,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 122 transitions, 375 flow [2021-12-17 22:34:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:34:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:34:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2021-12-17 22:34:47,951 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7074285714285714 [2021-12-17 22:34:47,951 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2021-12-17 22:34:47,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2021-12-17 22:34:47,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:34:47,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2021-12-17 22:34:47,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 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) [2021-12-17 22:34:47,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:34:47,957 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:34:47,957 INFO L186 Difference]: Start difference. First operand has 104 places, 100 transitions, 208 flow. Second operand 7 states and 619 transitions. [2021-12-17 22:34:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 122 transitions, 375 flow [2021-12-17 22:34:47,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 122 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 22:34:47,960 INFO L242 Difference]: Finished difference. Result has 111 places, 104 transitions, 249 flow [2021-12-17 22:34:47,960 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2021-12-17 22:34:47,961 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2021-12-17 22:34:47,961 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 249 flow [2021-12-17 22:34:47,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 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) [2021-12-17 22:34:47,961 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:34:47,962 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:34:47,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 22:34:47,962 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:34:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:34:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1307809793, now seen corresponding path program 1 times [2021-12-17 22:34:47,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:34:47,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814014989] [2021-12-17 22:34:47,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:34:47,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:34:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:34:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:34:48,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:34:48,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814014989] [2021-12-17 22:34:48,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814014989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:34:48,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:34:48,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:34:48,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264379770] [2021-12-17 22:34:48,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:34:48,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:34:48,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:34:48,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:34:48,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:34:48,158 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2021-12-17 22:34:48,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 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) [2021-12-17 22:34:48,158 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:34:48,158 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2021-12-17 22:34:48,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:34:48,410 INFO L129 PetriNetUnfolder]: 869/1658 cut-off events. [2021-12-17 22:34:48,410 INFO L130 PetriNetUnfolder]: For 311/329 co-relation queries the response was YES. [2021-12-17 22:34:48,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 1658 events. 869/1658 cut-off events. For 311/329 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8682 event pairs, 210 based on Foata normal form. 0/1231 useless extension candidates. Maximal degree in co-relation 3478. Up to 798 conditions per place. [2021-12-17 22:34:48,420 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 57 selfloop transitions, 11 changer transitions 1/131 dead transitions. [2021-12-17 22:34:48,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 131 transitions, 458 flow [2021-12-17 22:34:48,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:34:48,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:34:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2021-12-17 22:34:48,422 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7186666666666667 [2021-12-17 22:34:48,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2021-12-17 22:34:48,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2021-12-17 22:34:48,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:34:48,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2021-12-17 22:34:48,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 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) [2021-12-17 22:34:48,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2021-12-17 22:34:48,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2021-12-17 22:34:48,425 INFO L186 Difference]: Start difference. First operand has 111 places, 104 transitions, 249 flow. Second operand 6 states and 539 transitions. [2021-12-17 22:34:48,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 131 transitions, 458 flow [2021-12-17 22:34:48,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 443 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-12-17 22:34:48,429 INFO L242 Difference]: Finished difference. Result has 111 places, 108 transitions, 289 flow [2021-12-17 22:34:48,429 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=289, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2021-12-17 22:34:48,429 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2021-12-17 22:34:48,429 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 289 flow [2021-12-17 22:34:48,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 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) [2021-12-17 22:34:48,430 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:34:48,430 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:34:48,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 22:34:48,430 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:34:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:34:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2025303591, now seen corresponding path program 2 times [2021-12-17 22:34:48,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:34:48,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127856105] [2021-12-17 22:34:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:34:48,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:34:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:34:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:34:48,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:34:48,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127856105] [2021-12-17 22:34:48,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127856105] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:34:48,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934852188] [2021-12-17 22:34:48,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:34:48,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:34:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:34:48,622 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) [2021-12-17 22:34:48,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 22:34:48,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:34:48,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:34:48,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 22:34:48,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:35:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:09,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:35:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:09,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934852188] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:35:09,550 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:35:09,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2021-12-17 22:35:09,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101416334] [2021-12-17 22:35:09,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:35:09,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 22:35:09,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 22:35:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-17 22:35:09,566 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2021-12-17 22:35:09,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 289 flow. Second operand has 14 states, 14 states have (on average 82.21428571428571) internal successors, (1151), 14 states have internal predecessors, (1151), 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) [2021-12-17 22:35:09,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:09,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2021-12-17 22:35:09,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:10,603 INFO L129 PetriNetUnfolder]: 1719/2912 cut-off events. [2021-12-17 22:35:10,603 INFO L130 PetriNetUnfolder]: For 1088/1159 co-relation queries the response was YES. [2021-12-17 22:35:10,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7199 conditions, 2912 events. 1719/2912 cut-off events. For 1088/1159 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16091 event pairs, 121 based on Foata normal form. 76/2475 useless extension candidates. Maximal degree in co-relation 7192. Up to 735 conditions per place. [2021-12-17 22:35:10,622 INFO L132 encePairwiseOnDemand]: 110/125 looper letters, 127 selfloop transitions, 26 changer transitions 1/216 dead transitions. [2021-12-17 22:35:10,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 216 transitions, 920 flow [2021-12-17 22:35:10,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-17 22:35:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-17 22:35:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1250 transitions. [2021-12-17 22:35:10,625 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2021-12-17 22:35:10,625 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1250 transitions. [2021-12-17 22:35:10,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1250 transitions. [2021-12-17 22:35:10,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:10,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1250 transitions. [2021-12-17 22:35:10,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.28571428571429) internal successors, (1250), 14 states have internal predecessors, (1250), 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) [2021-12-17 22:35:10,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 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) [2021-12-17 22:35:10,631 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 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) [2021-12-17 22:35:10,631 INFO L186 Difference]: Start difference. First operand has 111 places, 108 transitions, 289 flow. Second operand 14 states and 1250 transitions. [2021-12-17 22:35:10,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 216 transitions, 920 flow [2021-12-17 22:35:10,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 216 transitions, 902 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-17 22:35:10,638 INFO L242 Difference]: Finished difference. Result has 127 places, 120 transitions, 424 flow [2021-12-17 22:35:10,638 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=424, PETRI_PLACES=127, PETRI_TRANSITIONS=120} [2021-12-17 22:35:10,639 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 16 predicate places. [2021-12-17 22:35:10,639 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 120 transitions, 424 flow [2021-12-17 22:35:10,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 82.21428571428571) internal successors, (1151), 14 states have internal predecessors, (1151), 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) [2021-12-17 22:35:10,640 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:10,640 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:10,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 22:35:10,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:35:10,856 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:10,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:10,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2003856395, now seen corresponding path program 3 times [2021-12-17 22:35:10,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:10,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153127264] [2021-12-17 22:35:10,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:10,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:10,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:10,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:10,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153127264] [2021-12-17 22:35:10,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153127264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:35:10,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:35:10,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:35:10,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679850851] [2021-12-17 22:35:10,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:35:10,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:35:10,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:35:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:35:10,949 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2021-12-17 22:35:10,949 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 120 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:10,949 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:10,949 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2021-12-17 22:35:10,949 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:11,219 INFO L129 PetriNetUnfolder]: 1444/2595 cut-off events. [2021-12-17 22:35:11,219 INFO L130 PetriNetUnfolder]: For 4564/4582 co-relation queries the response was YES. [2021-12-17 22:35:11,228 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7523 conditions, 2595 events. 1444/2595 cut-off events. For 4564/4582 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15111 event pairs, 452 based on Foata normal form. 43/2111 useless extension candidates. Maximal degree in co-relation 7510. Up to 575 conditions per place. [2021-12-17 22:35:11,242 INFO L132 encePairwiseOnDemand]: 113/125 looper letters, 69 selfloop transitions, 21 changer transitions 0/162 dead transitions. [2021-12-17 22:35:11,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 162 transitions, 801 flow [2021-12-17 22:35:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:35:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:35:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2021-12-17 22:35:11,245 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7577142857142857 [2021-12-17 22:35:11,245 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 663 transitions. [2021-12-17 22:35:11,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 663 transitions. [2021-12-17 22:35:11,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:11,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 663 transitions. [2021-12-17 22:35:11,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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) [2021-12-17 22:35:11,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:11,248 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:11,248 INFO L186 Difference]: Start difference. First operand has 127 places, 120 transitions, 424 flow. Second operand 7 states and 663 transitions. [2021-12-17 22:35:11,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 162 transitions, 801 flow [2021-12-17 22:35:11,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 162 transitions, 771 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-12-17 22:35:11,259 INFO L242 Difference]: Finished difference. Result has 131 places, 129 transitions, 562 flow [2021-12-17 22:35:11,259 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=562, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2021-12-17 22:35:11,260 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 20 predicate places. [2021-12-17 22:35:11,260 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 562 flow [2021-12-17 22:35:11,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:11,260 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:11,261 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:11,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-17 22:35:11,261 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -615266273, now seen corresponding path program 1 times [2021-12-17 22:35:11,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:11,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295468149] [2021-12-17 22:35:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:11,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:11,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:11,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:11,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295468149] [2021-12-17 22:35:11,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295468149] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:35:11,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556822820] [2021-12-17 22:35:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:11,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:35:11,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:35:11,336 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) [2021-12-17 22:35:11,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 22:35:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:11,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-17 22:35:11,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:35:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:13,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:35:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:13,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556822820] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:35:13,538 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:35:13,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-17 22:35:13,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008088618] [2021-12-17 22:35:13,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:35:13,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 22:35:13,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:13,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 22:35:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-17 22:35:13,540 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2021-12-17 22:35:13,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 562 flow. Second operand has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 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) [2021-12-17 22:35:13,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:13,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2021-12-17 22:35:13,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:14,391 INFO L129 PetriNetUnfolder]: 2576/5021 cut-off events. [2021-12-17 22:35:14,391 INFO L130 PetriNetUnfolder]: For 13768/14032 co-relation queries the response was YES. [2021-12-17 22:35:14,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14772 conditions, 5021 events. 2576/5021 cut-off events. For 13768/14032 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 37646 event pairs, 374 based on Foata normal form. 172/4480 useless extension candidates. Maximal degree in co-relation 14755. Up to 1008 conditions per place. [2021-12-17 22:35:14,447 INFO L132 encePairwiseOnDemand]: 112/125 looper letters, 161 selfloop transitions, 22 changer transitions 0/262 dead transitions. [2021-12-17 22:35:14,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 262 transitions, 1948 flow [2021-12-17 22:35:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 22:35:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-17 22:35:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1117 transitions. [2021-12-17 22:35:14,451 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7446666666666667 [2021-12-17 22:35:14,451 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1117 transitions. [2021-12-17 22:35:14,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1117 transitions. [2021-12-17 22:35:14,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:14,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1117 transitions. [2021-12-17 22:35:14,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 93.08333333333333) internal successors, (1117), 12 states have internal predecessors, (1117), 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) [2021-12-17 22:35:14,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 125.0) internal successors, (1625), 13 states have internal predecessors, (1625), 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) [2021-12-17 22:35:14,458 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 125.0) internal successors, (1625), 13 states have internal predecessors, (1625), 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) [2021-12-17 22:35:14,458 INFO L186 Difference]: Start difference. First operand has 131 places, 129 transitions, 562 flow. Second operand 12 states and 1117 transitions. [2021-12-17 22:35:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 262 transitions, 1948 flow [2021-12-17 22:35:14,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 262 transitions, 1860 flow, removed 42 selfloop flow, removed 2 redundant places. [2021-12-17 22:35:14,478 INFO L242 Difference]: Finished difference. Result has 147 places, 141 transitions, 688 flow [2021-12-17 22:35:14,478 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=688, PETRI_PLACES=147, PETRI_TRANSITIONS=141} [2021-12-17 22:35:14,480 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 36 predicate places. [2021-12-17 22:35:14,480 INFO L470 AbstractCegarLoop]: Abstraction has has 147 places, 141 transitions, 688 flow [2021-12-17 22:35:14,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 88.5) internal successors, (885), 10 states have internal predecessors, (885), 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) [2021-12-17 22:35:14,481 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:14,481 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:14,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 22:35:14,691 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 [2021-12-17 22:35:14,692 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1045667113, now seen corresponding path program 1 times [2021-12-17 22:35:14,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:14,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177672925] [2021-12-17 22:35:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:14,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:14,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:14,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177672925] [2021-12-17 22:35:14,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177672925] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:35:14,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:35:14,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:35:14,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813305284] [2021-12-17 22:35:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:35:14,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:35:14,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:35:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:35:14,787 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2021-12-17 22:35:14,788 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 141 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:14,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:14,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2021-12-17 22:35:14,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:15,241 INFO L129 PetriNetUnfolder]: 2696/5142 cut-off events. [2021-12-17 22:35:15,241 INFO L130 PetriNetUnfolder]: For 14325/14606 co-relation queries the response was YES. [2021-12-17 22:35:15,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18851 conditions, 5142 events. 2696/5142 cut-off events. For 14325/14606 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 37365 event pairs, 473 based on Foata normal form. 223/5002 useless extension candidates. Maximal degree in co-relation 18827. Up to 2231 conditions per place. [2021-12-17 22:35:15,293 INFO L132 encePairwiseOnDemand]: 112/125 looper letters, 95 selfloop transitions, 16 changer transitions 0/188 dead transitions. [2021-12-17 22:35:15,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 188 transitions, 1156 flow [2021-12-17 22:35:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:35:15,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:35:15,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2021-12-17 22:35:15,295 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7565714285714286 [2021-12-17 22:35:15,295 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2021-12-17 22:35:15,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2021-12-17 22:35:15,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:15,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2021-12-17 22:35:15,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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) [2021-12-17 22:35:15,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:15,298 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:15,298 INFO L186 Difference]: Start difference. First operand has 147 places, 141 transitions, 688 flow. Second operand 7 states and 662 transitions. [2021-12-17 22:35:15,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 188 transitions, 1156 flow [2021-12-17 22:35:15,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 188 transitions, 1148 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-12-17 22:35:15,329 INFO L242 Difference]: Finished difference. Result has 153 places, 142 transitions, 742 flow [2021-12-17 22:35:15,329 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=742, PETRI_PLACES=153, PETRI_TRANSITIONS=142} [2021-12-17 22:35:15,330 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 42 predicate places. [2021-12-17 22:35:15,330 INFO L470 AbstractCegarLoop]: Abstraction has has 153 places, 142 transitions, 742 flow [2021-12-17 22:35:15,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:15,330 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:15,330 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:15,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-17 22:35:15,331 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash 537574045, now seen corresponding path program 2 times [2021-12-17 22:35:15,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:15,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651190075] [2021-12-17 22:35:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:15,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:15,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:15,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:15,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651190075] [2021-12-17 22:35:15,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651190075] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:35:15,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:35:15,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:35:15,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250157709] [2021-12-17 22:35:15,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:35:15,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:35:15,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:35:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:35:15,385 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2021-12-17 22:35:15,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 142 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:15,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:15,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2021-12-17 22:35:15,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:15,770 INFO L129 PetriNetUnfolder]: 2301/4332 cut-off events. [2021-12-17 22:35:15,771 INFO L130 PetriNetUnfolder]: For 17463/17690 co-relation queries the response was YES. [2021-12-17 22:35:15,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16841 conditions, 4332 events. 2301/4332 cut-off events. For 17463/17690 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 30525 event pairs, 247 based on Foata normal form. 165/4325 useless extension candidates. Maximal degree in co-relation 16814. Up to 1468 conditions per place. [2021-12-17 22:35:15,818 INFO L132 encePairwiseOnDemand]: 113/125 looper letters, 116 selfloop transitions, 24 changer transitions 0/218 dead transitions. [2021-12-17 22:35:15,818 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 218 transitions, 1691 flow [2021-12-17 22:35:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:35:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:35:15,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2021-12-17 22:35:15,820 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7554285714285714 [2021-12-17 22:35:15,820 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2021-12-17 22:35:15,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2021-12-17 22:35:15,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:15,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2021-12-17 22:35:15,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:35:15,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:15,823 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:15,824 INFO L186 Difference]: Start difference. First operand has 153 places, 142 transitions, 742 flow. Second operand 7 states and 661 transitions. [2021-12-17 22:35:15,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 218 transitions, 1691 flow [2021-12-17 22:35:15,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 218 transitions, 1671 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-12-17 22:35:15,864 INFO L242 Difference]: Finished difference. Result has 160 places, 152 transitions, 910 flow [2021-12-17 22:35:15,864 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=910, PETRI_PLACES=160, PETRI_TRANSITIONS=152} [2021-12-17 22:35:15,865 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 49 predicate places. [2021-12-17 22:35:15,865 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 152 transitions, 910 flow [2021-12-17 22:35:15,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:15,866 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:15,866 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:15,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-17 22:35:15,866 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:15,867 INFO L85 PathProgramCache]: Analyzing trace with hash -232571161, now seen corresponding path program 1 times [2021-12-17 22:35:15,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:15,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835886486] [2021-12-17 22:35:15,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:15,867 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:15,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:15,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835886486] [2021-12-17 22:35:15,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835886486] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:35:15,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:35:15,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:35:15,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316472346] [2021-12-17 22:35:15,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:35:15,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:35:15,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:15,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:35:15,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:35:15,998 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2021-12-17 22:35:15,999 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 152 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 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) [2021-12-17 22:35:15,999 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:15,999 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2021-12-17 22:35:15,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:16,516 INFO L129 PetriNetUnfolder]: 2820/4961 cut-off events. [2021-12-17 22:35:16,516 INFO L130 PetriNetUnfolder]: For 25050/25169 co-relation queries the response was YES. [2021-12-17 22:35:16,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21840 conditions, 4961 events. 2820/4961 cut-off events. For 25050/25169 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 32222 event pairs, 1087 based on Foata normal form. 11/4719 useless extension candidates. Maximal degree in co-relation 21809. Up to 3689 conditions per place. [2021-12-17 22:35:16,592 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 101 selfloop transitions, 13 changer transitions 8/184 dead transitions. [2021-12-17 22:35:16,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 184 transitions, 1402 flow [2021-12-17 22:35:16,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 22:35:16,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-17 22:35:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2021-12-17 22:35:16,595 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.716 [2021-12-17 22:35:16,595 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 537 transitions. [2021-12-17 22:35:16,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions. [2021-12-17 22:35:16,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:16,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions. [2021-12-17 22:35:16,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 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) [2021-12-17 22:35:16,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2021-12-17 22:35:16,598 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2021-12-17 22:35:16,598 INFO L186 Difference]: Start difference. First operand has 160 places, 152 transitions, 910 flow. Second operand 6 states and 537 transitions. [2021-12-17 22:35:16,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 184 transitions, 1402 flow [2021-12-17 22:35:16,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 184 transitions, 1382 flow, removed 8 selfloop flow, removed 2 redundant places. [2021-12-17 22:35:16,639 INFO L242 Difference]: Finished difference. Result has 165 places, 154 transitions, 955 flow [2021-12-17 22:35:16,640 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=955, PETRI_PLACES=165, PETRI_TRANSITIONS=154} [2021-12-17 22:35:16,641 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 54 predicate places. [2021-12-17 22:35:16,641 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 154 transitions, 955 flow [2021-12-17 22:35:16,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 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) [2021-12-17 22:35:16,641 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:16,641 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:16,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-17 22:35:16,642 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:16,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:16,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1377154653, now seen corresponding path program 2 times [2021-12-17 22:35:16,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:16,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715523699] [2021-12-17 22:35:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:16,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:16,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715523699] [2021-12-17 22:35:16,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715523699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:35:16,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:35:16,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-17 22:35:16,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577821280] [2021-12-17 22:35:16,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:35:16,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 22:35:16,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 22:35:16,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-17 22:35:16,802 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2021-12-17 22:35:16,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 154 transitions, 955 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 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) [2021-12-17 22:35:16,803 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:16,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2021-12-17 22:35:16,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:17,448 INFO L129 PetriNetUnfolder]: 3194/5458 cut-off events. [2021-12-17 22:35:17,448 INFO L130 PetriNetUnfolder]: For 27781/27847 co-relation queries the response was YES. [2021-12-17 22:35:17,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24508 conditions, 5458 events. 3194/5458 cut-off events. For 27781/27847 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 35812 event pairs, 644 based on Foata normal form. 108/5389 useless extension candidates. Maximal degree in co-relation 24474. Up to 2609 conditions per place. [2021-12-17 22:35:17,505 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 139 selfloop transitions, 19 changer transitions 2/222 dead transitions. [2021-12-17 22:35:17,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 222 transitions, 1878 flow [2021-12-17 22:35:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:35:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:35:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 628 transitions. [2021-12-17 22:35:17,507 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7177142857142857 [2021-12-17 22:35:17,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 628 transitions. [2021-12-17 22:35:17,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 628 transitions. [2021-12-17 22:35:17,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:17,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 628 transitions. [2021-12-17 22:35:17,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.71428571428571) internal successors, (628), 7 states have internal predecessors, (628), 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) [2021-12-17 22:35:17,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:17,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:17,510 INFO L186 Difference]: Start difference. First operand has 165 places, 154 transitions, 955 flow. Second operand 7 states and 628 transitions. [2021-12-17 22:35:17,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 222 transitions, 1878 flow [2021-12-17 22:35:17,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 222 transitions, 1863 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-17 22:35:17,593 INFO L242 Difference]: Finished difference. Result has 171 places, 159 transitions, 1064 flow [2021-12-17 22:35:17,593 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1064, PETRI_PLACES=171, PETRI_TRANSITIONS=159} [2021-12-17 22:35:17,593 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 60 predicate places. [2021-12-17 22:35:17,594 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 159 transitions, 1064 flow [2021-12-17 22:35:17,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 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) [2021-12-17 22:35:17,594 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:17,594 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:17,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-17 22:35:17,595 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash 142496601, now seen corresponding path program 2 times [2021-12-17 22:35:17,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:17,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172507587] [2021-12-17 22:35:17,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:17,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:17,678 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:17,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172507587] [2021-12-17 22:35:17,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172507587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:35:17,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:35:17,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 22:35:17,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972679419] [2021-12-17 22:35:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:35:17,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 22:35:17,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:35:17,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 22:35:17,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 22:35:17,681 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2021-12-17 22:35:17,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 159 transitions, 1064 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:17,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:35:17,682 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2021-12-17 22:35:17,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:35:18,299 INFO L129 PetriNetUnfolder]: 3169/5761 cut-off events. [2021-12-17 22:35:18,300 INFO L130 PetriNetUnfolder]: For 33850/34201 co-relation queries the response was YES. [2021-12-17 22:35:18,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26122 conditions, 5761 events. 3169/5761 cut-off events. For 33850/34201 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 40100 event pairs, 1046 based on Foata normal form. 297/5802 useless extension candidates. Maximal degree in co-relation 26086. Up to 2106 conditions per place. [2021-12-17 22:35:18,493 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 126 selfloop transitions, 24 changer transitions 0/230 dead transitions. [2021-12-17 22:35:18,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 230 transitions, 1951 flow [2021-12-17 22:35:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 22:35:18,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-17 22:35:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 663 transitions. [2021-12-17 22:35:18,495 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7577142857142857 [2021-12-17 22:35:18,495 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 663 transitions. [2021-12-17 22:35:18,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 663 transitions. [2021-12-17 22:35:18,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:35:18,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 663 transitions. [2021-12-17 22:35:18,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 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) [2021-12-17 22:35:18,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:18,498 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 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) [2021-12-17 22:35:18,499 INFO L186 Difference]: Start difference. First operand has 171 places, 159 transitions, 1064 flow. Second operand 7 states and 663 transitions. [2021-12-17 22:35:18,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 230 transitions, 1951 flow [2021-12-17 22:35:18,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 230 transitions, 1941 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-12-17 22:35:18,568 INFO L242 Difference]: Finished difference. Result has 178 places, 164 transitions, 1205 flow [2021-12-17 22:35:18,568 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=1058, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1205, PETRI_PLACES=178, PETRI_TRANSITIONS=164} [2021-12-17 22:35:18,570 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 67 predicate places. [2021-12-17 22:35:18,570 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 164 transitions, 1205 flow [2021-12-17 22:35:18,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 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) [2021-12-17 22:35:18,570 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:35:18,570 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:35:18,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-17 22:35:18,571 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:35:18,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:35:18,571 INFO L85 PathProgramCache]: Analyzing trace with hash 464729273, now seen corresponding path program 1 times [2021-12-17 22:35:18,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:35:18,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805812114] [2021-12-17 22:35:18,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:18,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:35:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:18,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:35:18,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805812114] [2021-12-17 22:35:18,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805812114] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:35:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52796448] [2021-12-17 22:35:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:35:18,975 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:35:18,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:35:18,976 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) [2021-12-17 22:35:18,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 22:35:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:35:19,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-17 22:35:19,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:35:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:35:48,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:36:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:36:10,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52796448] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:36:10,026 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:36:10,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2021-12-17 22:36:10,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795826061] [2021-12-17 22:36:10,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:36:10,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 22:36:10,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:36:10,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 22:36:10,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=545, Unknown=4, NotChecked=0, Total=702 [2021-12-17 22:36:10,028 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2021-12-17 22:36:10,030 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 164 transitions, 1205 flow. Second operand has 27 states, 27 states have (on average 80.5925925925926) internal successors, (2176), 27 states have internal predecessors, (2176), 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) [2021-12-17 22:36:10,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:36:10,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2021-12-17 22:36:10,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:36:12,684 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 [] [2021-12-17 22:36:14,734 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 [] [2021-12-17 22:36:16,752 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 [] [2021-12-17 22:36:18,765 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 [] [2021-12-17 22:36:20,789 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 [] [2021-12-17 22:36:22,800 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 [] [2021-12-17 22:36:24,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:36:26,124 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 [] [2021-12-17 22:37:15,508 WARN L227 SmtUtils]: Spent 44.46s on a formula simplification. DAG size of input: 72 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:37:16,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:37:23,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:37:25,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 [] [2021-12-17 22:37:27,500 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 [] [2021-12-17 22:37:30,038 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 [] [2021-12-17 22:37:32,055 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 [] [2021-12-17 22:37:34,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 [] [2021-12-17 22:37:36,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:37:38,680 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 [] [2021-12-17 22:37:41,350 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 [] [2021-12-17 22:37:43,361 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 [] [2021-12-17 22:37:45,368 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 [] [2021-12-17 22:37:47,378 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 [] [2021-12-17 22:37:49,523 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 [] [2021-12-17 22:37:50,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:37:52,732 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 [] [2021-12-17 22:37:55,657 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 [] [2021-12-17 22:37:58,612 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 [] [2021-12-17 22:38:01,484 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 [] [2021-12-17 22:38:03,493 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 [] [2021-12-17 22:38:05,539 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 [] [2021-12-17 22:38:07,556 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 [] [2021-12-17 22:38:09,932 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 [] [2021-12-17 22:38:11,941 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 [] [2021-12-17 22:38:14,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:38:21,578 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 [] [2021-12-17 22:38:23,605 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 [] [2021-12-17 22:38:24,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:38:26,982 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 [] [2021-12-17 22:39:14,951 WARN L227 SmtUtils]: Spent 36.51s on a formula simplification. DAG size of input: 74 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:39:16,954 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 [] [2021-12-17 22:39:18,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:39:20,984 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 [] [2021-12-17 22:39:22,993 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 [] [2021-12-17 22:39:25,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:39:27,014 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 [] [2021-12-17 22:39:29,383 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 [] [2021-12-17 22:39:31,529 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 [] [2021-12-17 22:39:33,757 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 [] [2021-12-17 22:39:36,285 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 [] [2021-12-17 22:39:38,297 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 [] [2021-12-17 22:39:41,104 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 [] [2021-12-17 22:39:43,113 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 [] [2021-12-17 22:39:45,142 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 [] [2021-12-17 22:39:47,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 [] [2021-12-17 22:39:50,446 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:39:54,186 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 [] [2021-12-17 22:39:56,204 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 [] [2021-12-17 22:40:08,227 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 [] [2021-12-17 22:40:10,240 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 [] [2021-12-17 22:40:12,269 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 [] [2021-12-17 22:40:14,291 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 [] [2021-12-17 22:40:16,321 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 [] [2021-12-17 22:40:18,330 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 [] [2021-12-17 22:40:20,910 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 [] [2021-12-17 22:40:22,921 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 [] [2021-12-17 22:40:31,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:40:33,396 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 [] [2021-12-17 22:40:35,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:41:00,774 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 [] [2021-12-17 22:41:05,128 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 [] [2021-12-17 22:41:07,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 [] [2021-12-17 22:41:09,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:41:13,017 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 [] [2021-12-17 22:41:16,828 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 [] [2021-12-17 22:41:18,842 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 [] [2021-12-17 22:41:21,104 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 [] [2021-12-17 22:41:28,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:41:33,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:41:35,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:41:37,319 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 [] [2021-12-17 22:41:39,231 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:41:41,234 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 [] [2021-12-17 22:41:43,243 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 [] [2021-12-17 22:42:10,377 WARN L227 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 64 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:42:12,380 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 [] [2021-12-17 22:42:13,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:42:15,917 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 [] [2021-12-17 22:42:17,926 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 [] [2021-12-17 22:42:21,542 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 [] [2021-12-17 22:42:23,574 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 [] [2021-12-17 22:42:25,585 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 [] [2021-12-17 22:42:27,612 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 [] [2021-12-17 22:42:29,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:42:38,095 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 [] [2021-12-17 22:42:40,145 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 [] [2021-12-17 22:42:42,156 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 [] [2021-12-17 22:42:45,810 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 [] [2021-12-17 22:42:47,818 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 [] [2021-12-17 22:42:49,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:42:51,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:42:53,522 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 [] [2021-12-17 22:43:09,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:43:19,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 [] [2021-12-17 22:43:21,583 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 [] [2021-12-17 22:43:23,592 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 [] [2021-12-17 22:43:38,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 [] [2021-12-17 22:43:41,218 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 [] [2021-12-17 22:43:43,260 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 [] [2021-12-17 22:43:56,569 INFO L129 PetriNetUnfolder]: 10237/17758 cut-off events. [2021-12-17 22:43:56,570 INFO L130 PetriNetUnfolder]: For 124661/124933 co-relation queries the response was YES. [2021-12-17 22:43:56,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87583 conditions, 17758 events. 10237/17758 cut-off events. For 124661/124933 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 142999 event pairs, 1075 based on Foata normal form. 54/17137 useless extension candidates. Maximal degree in co-relation 87544. Up to 6872 conditions per place. [2021-12-17 22:43:56,995 INFO L132 encePairwiseOnDemand]: 103/125 looper letters, 439 selfloop transitions, 298 changer transitions 18/817 dead transitions. [2021-12-17 22:43:56,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 817 transitions, 8974 flow [2021-12-17 22:43:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-17 22:43:56,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2021-12-17 22:43:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 3622 transitions. [2021-12-17 22:43:57,006 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7067317073170731 [2021-12-17 22:43:57,006 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 3622 transitions. [2021-12-17 22:43:57,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 3622 transitions. [2021-12-17 22:43:57,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:43:57,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 3622 transitions. [2021-12-17 22:43:57,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 88.34146341463415) internal successors, (3622), 41 states have internal predecessors, (3622), 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) [2021-12-17 22:43:57,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 125.0) internal successors, (5250), 42 states have internal predecessors, (5250), 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) [2021-12-17 22:43:57,031 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 125.0) internal successors, (5250), 42 states have internal predecessors, (5250), 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) [2021-12-17 22:43:57,031 INFO L186 Difference]: Start difference. First operand has 178 places, 164 transitions, 1205 flow. Second operand 41 states and 3622 transitions. [2021-12-17 22:43:57,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 817 transitions, 8974 flow [2021-12-17 22:43:57,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 817 transitions, 8869 flow, removed 47 selfloop flow, removed 3 redundant places. [2021-12-17 22:43:57,443 INFO L242 Difference]: Finished difference. Result has 233 places, 452 transitions, 5499 flow [2021-12-17 22:43:57,443 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=5499, PETRI_PLACES=233, PETRI_TRANSITIONS=452} [2021-12-17 22:43:57,444 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 122 predicate places. [2021-12-17 22:43:57,444 INFO L470 AbstractCegarLoop]: Abstraction has has 233 places, 452 transitions, 5499 flow [2021-12-17 22:43:57,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 80.5925925925926) internal successors, (2176), 27 states have internal predecessors, (2176), 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) [2021-12-17 22:43:57,445 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:43:57,445 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:43:57,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 22:43:57,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:43:57,646 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-17 22:43:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:43:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -189432737, now seen corresponding path program 2 times [2021-12-17 22:43:57,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 22:43:57,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801291140] [2021-12-17 22:43:57,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:43:57,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 22:43:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:43:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:43:57,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 22:43:57,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801291140] [2021-12-17 22:43:57,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801291140] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 22:43:57,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876020771] [2021-12-17 22:43:57,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:43:57,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:43:57,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:43:57,976 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) [2021-12-17 22:43:57,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 22:43:58,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:43:58,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:43:58,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 22:43:58,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:44:27,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:44:27,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:44:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:44:49,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876020771] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:44:49,020 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:44:49,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 26 [2021-12-17 22:44:49,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83540503] [2021-12-17 22:44:49,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:44:49,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-17 22:44:49,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:44:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-17 22:44:49,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=491, Unknown=12, NotChecked=0, Total=650 [2021-12-17 22:44:49,023 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2021-12-17 22:44:49,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 452 transitions, 5499 flow. Second operand has 26 states, 26 states have (on average 80.6923076923077) internal successors, (2098), 26 states have internal predecessors, (2098), 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) [2021-12-17 22:44:49,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:44:49,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2021-12-17 22:44:49,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:44:52,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:45:12,579 WARN L227 SmtUtils]: Spent 17.45s on a formula simplification. DAG size of input: 64 DAG size of output: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:45:27,948 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 [] [2021-12-17 22:45:54,958 WARN L227 SmtUtils]: Spent 16.37s on a formula simplification. DAG size of input: 71 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:45:57,034 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 [] [2021-12-17 22:45:59,087 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 [] [2021-12-17 22:46:01,096 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 [] [2021-12-17 22:46:03,328 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 [] [2021-12-17 22:46:20,570 WARN L227 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 77 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:46:23,010 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 [] [2021-12-17 22:46:25,018 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 [] [2021-12-17 22:46:27,026 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 [] [2021-12-17 22:46:35,376 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 [] [2021-12-17 22:46:37,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 [] [2021-12-17 22:46:40,444 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 [] [2021-12-17 22:46:42,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:46:44,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:47:30,593 WARN L227 SmtUtils]: Spent 40.02s on a formula simplification. DAG size of input: 90 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:47:33,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 [] [2021-12-17 22:47:34,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:47:39,839 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 [] [2021-12-17 22:47:41,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:47:43,758 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 [] [2021-12-17 22:47:45,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:47:47,867 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 [] [2021-12-17 22:47:49,884 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 [] [2021-12-17 22:47:52,429 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 [] [2021-12-17 22:47:54,441 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 [] [2021-12-17 22:47:56,481 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 [] [2021-12-17 22:47:58,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:48:00,660 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 [] [2021-12-17 22:48:02,670 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 [] [2021-12-17 22:48:15,735 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 [] [2021-12-17 22:48:17,757 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 [] [2021-12-17 22:48:19,766 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 [] [2021-12-17 22:48:21,773 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 [] [2021-12-17 22:48:23,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:48:25,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:48:28,123 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 [] [2021-12-17 22:48:30,134 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 [] [2021-12-17 22:48:32,146 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 [] [2021-12-17 22:48:34,182 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 [] [2021-12-17 22:48:36,191 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 [] [2021-12-17 22:48:38,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:48:41,463 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 [] [2021-12-17 22:48:43,513 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 [] [2021-12-17 22:48:45,522 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 [] [2021-12-17 22:48:46,731 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 [] [2021-12-17 22:49:02,572 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 [] [2021-12-17 22:49:19,356 WARN L227 SmtUtils]: Spent 9.57s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15