/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:48:52,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:48:52,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:48:52,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:48:52,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:48:52,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:48:52,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:48:52,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:48:52,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:48:52,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:48:52,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:48:52,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:48:52,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:48:52,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:48:52,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:48:52,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:48:52,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:48:52,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:48:52,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:48:52,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:48:52,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:48:52,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:48:52,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:48:52,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:48:52,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:48:52,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:48:52,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:48:52,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:48:52,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:48:52,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:48:52,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:48:52,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:48:52,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:48:52,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:48:52,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:48:52,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:48:52,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:48:52,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:48:52,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:48:52,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:48:52,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:48:52,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 13:48:52,136 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:48:52,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:48:52,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:48:52,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:48:52,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:48:52,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:48:52,138 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:48:52,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:48:52,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:48:52,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:48:52,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:48:52,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:48:52,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:48:52,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:48:52,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:48:52,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:48:52,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:48:52,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:48:52,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:48:52,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:48:52,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:48:52,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:48:52,140 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:48:52,141 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:48:52,141 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:48:52,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 13:48:52,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:48:52,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:48:52,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:48:52,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:48:52,340 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:48:52,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-01-19 13:48:52,399 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277f1b871/815bd38c3ea747b5bd2b725aa018edf5/FLAG96b87e9e1 [2022-01-19 13:48:52,695 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:48:52,695 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c [2022-01-19 13:48:52,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277f1b871/815bd38c3ea747b5bd2b725aa018edf5/FLAG96b87e9e1 [2022-01-19 13:48:53,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/277f1b871/815bd38c3ea747b5bd2b725aa018edf5 [2022-01-19 13:48:53,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:48:53,120 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:48:53,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:48:53,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:48:53,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:48:53,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e549837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53, skipping insertion in model container [2022-01-19 13:48:53,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:48:53,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:48:53,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-01-19 13:48:53,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:48:53,342 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:48:53,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-2.wvr-bad.c[6687,6700] [2022-01-19 13:48:53,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:48:53,416 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:48:53,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53 WrapperNode [2022-01-19 13:48:53,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:48:53,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:48:53,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:48:53,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:48:53,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,470 INFO L137 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 460 [2022-01-19 13:48:53,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:48:53,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:48:53,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:48:53,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:48:53,478 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:48:53,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:48:53,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:48:53,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:48:53,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (1/1) ... [2022-01-19 13:48:53,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:48:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:48:53,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 13:48:53,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 13:48:53,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:48:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:48:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:48:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:48:53,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:48:53,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:48:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:48:53,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:48:53,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 13:48:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 13:48:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 13:48:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 13:48:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:48:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 13:48:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 13:48:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 13:48:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:48:53,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:48:53,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:48:53,580 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 13:48:53,705 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:48:53,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:48:54,170 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:48:54,367 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:48:54,367 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-19 13:48:54,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:48:54 BoogieIcfgContainer [2022-01-19 13:48:54,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:48:54,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:48:54,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:48:54,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:48:54,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:48:53" (1/3) ... [2022-01-19 13:48:54,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582eaac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:48:54, skipping insertion in model container [2022-01-19 13:48:54,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:48:53" (2/3) ... [2022-01-19 13:48:54,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582eaac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:48:54, skipping insertion in model container [2022-01-19 13:48:54,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:48:54" (3/3) ... [2022-01-19 13:48:54,380 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2022-01-19 13:48:54,386 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:48:54,386 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:48:54,386 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:48:54,452 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,453 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,453 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,453 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,454 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,455 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,456 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,457 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,458 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,459 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,460 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,461 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,462 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,463 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,464 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,465 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,466 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,467 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,468 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,469 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,470 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,471 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,472 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,472 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,474 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,479 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,480 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,480 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,480 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,480 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,480 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,480 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,480 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,481 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,481 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,482 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,483 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,484 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,484 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,484 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,484 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,484 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,484 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,485 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,485 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,485 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,485 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,485 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,486 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,486 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,486 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,486 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,486 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,486 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,487 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,487 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,487 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,487 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,487 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,487 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,487 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,488 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,488 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,488 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,489 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,489 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,489 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,489 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,489 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,490 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,490 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,490 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,491 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,496 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,496 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,498 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,499 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,500 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,501 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~nondet19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,505 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,505 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,505 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~nondet24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,505 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,505 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,505 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,506 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,506 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,506 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~mem25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,506 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,507 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,507 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,507 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,507 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,507 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,507 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,507 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:48:54,512 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 13:48:54,551 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:48:54,557 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 13:48:54,557 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 13:48:54,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 332 places, 356 transitions, 744 flow [2022-01-19 13:48:54,672 INFO L129 PetriNetUnfolder]: 37/352 cut-off events. [2022-01-19 13:48:54,673 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 13:48:54,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 352 events. 37/352 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 239 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 308. Up to 8 conditions per place. [2022-01-19 13:48:54,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 356 transitions, 744 flow [2022-01-19 13:48:54,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 339 transitions, 702 flow [2022-01-19 13:48:54,745 INFO L129 PetriNetUnfolder]: 37/338 cut-off events. [2022-01-19 13:48:54,745 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 13:48:54,746 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:54,747 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:54,747 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)] === [2022-01-19 13:48:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash -768917108, now seen corresponding path program 1 times [2022-01-19 13:48:54,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:54,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438484370] [2022-01-19 13:48:54,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:54,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:48:55,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:55,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438484370] [2022-01-19 13:48:55,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438484370] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:55,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:55,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 13:48:55,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752562774] [2022-01-19 13:48:55,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:55,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 13:48:55,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:55,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 13:48:55,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 13:48:55,113 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 356 [2022-01-19 13:48:55,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 339 transitions, 702 flow. Second operand has 2 states, 2 states have (on average 325.0) internal successors, (650), 2 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,117 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:55,117 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 356 [2022-01-19 13:48:55,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:55,242 INFO L129 PetriNetUnfolder]: 56/358 cut-off events. [2022-01-19 13:48:55,242 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 13:48:55,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 358 events. 56/358 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs, 0 based on Foata normal form. 29/355 useless extension candidates. Maximal degree in co-relation 334. Up to 57 conditions per place. [2022-01-19 13:48:55,250 INFO L132 encePairwiseOnDemand]: 339/356 looper letters, 20 selfloop transitions, 0 changer transitions 9/322 dead transitions. [2022-01-19 13:48:55,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 322 transitions, 708 flow [2022-01-19 13:48:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 13:48:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 13:48:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 673 transitions. [2022-01-19 13:48:55,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452247191011236 [2022-01-19 13:48:55,279 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 673 transitions. [2022-01-19 13:48:55,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 673 transitions. [2022-01-19 13:48:55,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:55,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 673 transitions. [2022-01-19 13:48:55,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 336.5) internal successors, (673), 2 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,301 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 356.0) internal successors, (1068), 3 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,302 INFO L186 Difference]: Start difference. First operand has 315 places, 339 transitions, 702 flow. Second operand 2 states and 673 transitions. [2022-01-19 13:48:55,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 322 transitions, 708 flow [2022-01-19 13:48:55,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 322 transitions, 692 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 13:48:55,318 INFO L242 Difference]: Finished difference. Result has 308 places, 313 transitions, 634 flow [2022-01-19 13:48:55,320 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=634, PETRI_PLACES=308, PETRI_TRANSITIONS=313} [2022-01-19 13:48:55,327 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, -7 predicate places. [2022-01-19 13:48:55,327 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 313 transitions, 634 flow [2022-01-19 13:48:55,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 325.0) internal successors, (650), 2 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,328 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:55,329 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:55,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:48:55,329 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)] === [2022-01-19 13:48:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 130691898, now seen corresponding path program 1 times [2022-01-19 13:48:55,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:55,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085353915] [2022-01-19 13:48:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:55,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:48:55,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:55,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085353915] [2022-01-19 13:48:55,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085353915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:55,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:55,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:48:55,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299337356] [2022-01-19 13:48:55,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:55,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:48:55,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:55,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:48:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:48:55,657 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 356 [2022-01-19 13:48:55,658 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 313 transitions, 634 flow. Second operand has 5 states, 5 states have (on average 280.2) internal successors, (1401), 5 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,658 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:55,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 356 [2022-01-19 13:48:55,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:55,912 INFO L129 PetriNetUnfolder]: 107/476 cut-off events. [2022-01-19 13:48:55,912 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 13:48:55,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 476 events. 107/476 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 711 event pairs, 0 based on Foata normal form. 1/435 useless extension candidates. Maximal degree in co-relation 635. Up to 85 conditions per place. [2022-01-19 13:48:55,918 INFO L132 encePairwiseOnDemand]: 346/356 looper letters, 69 selfloop transitions, 7 changer transitions 4/335 dead transitions. [2022-01-19 13:48:55,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 335 transitions, 845 flow [2022-01-19 13:48:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:48:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:48:55,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1436 transitions. [2022-01-19 13:48:55,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8067415730337079 [2022-01-19 13:48:55,922 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1436 transitions. [2022-01-19 13:48:55,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1436 transitions. [2022-01-19 13:48:55,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:55,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1436 transitions. [2022-01-19 13:48:55,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 287.2) internal successors, (1436), 5 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,932 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,932 INFO L186 Difference]: Start difference. First operand has 308 places, 313 transitions, 634 flow. Second operand 5 states and 1436 transitions. [2022-01-19 13:48:55,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 335 transitions, 845 flow [2022-01-19 13:48:55,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 335 transitions, 845 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:48:55,942 INFO L242 Difference]: Finished difference. Result has 306 places, 319 transitions, 685 flow [2022-01-19 13:48:55,943 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=685, PETRI_PLACES=306, PETRI_TRANSITIONS=319} [2022-01-19 13:48:55,943 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, -9 predicate places. [2022-01-19 13:48:55,944 INFO L470 AbstractCegarLoop]: Abstraction has has 306 places, 319 transitions, 685 flow [2022-01-19 13:48:55,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 280.2) internal successors, (1401), 5 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:55,945 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:55,945 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:55,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:48:55,945 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)] === [2022-01-19 13:48:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2069722549, now seen corresponding path program 1 times [2022-01-19 13:48:55,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:55,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586712497] [2022-01-19 13:48:55,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:55,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:48:56,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:56,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586712497] [2022-01-19 13:48:56,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586712497] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:56,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:56,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:48:56,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638320008] [2022-01-19 13:48:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:56,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:48:56,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:48:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:48:56,166 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 356 [2022-01-19 13:48:56,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 319 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:56,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 356 [2022-01-19 13:48:56,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:56,297 INFO L129 PetriNetUnfolder]: 171/648 cut-off events. [2022-01-19 13:48:56,297 INFO L130 PetriNetUnfolder]: For 86/90 co-relation queries the response was YES. [2022-01-19 13:48:56,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 648 events. 171/648 cut-off events. For 86/90 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1492 event pairs, 3 based on Foata normal form. 19/590 useless extension candidates. Maximal degree in co-relation 947. Up to 124 conditions per place. [2022-01-19 13:48:56,305 INFO L132 encePairwiseOnDemand]: 349/356 looper letters, 44 selfloop transitions, 4 changer transitions 0/337 dead transitions. [2022-01-19 13:48:56,305 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 337 transitions, 838 flow [2022-01-19 13:48:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:48:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:48:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-01-19 13:48:56,308 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9213483146067416 [2022-01-19 13:48:56,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-01-19 13:48:56,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-01-19 13:48:56,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:56,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-01-19 13:48:56,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,314 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,314 INFO L186 Difference]: Start difference. First operand has 306 places, 319 transitions, 685 flow. Second operand 3 states and 984 transitions. [2022-01-19 13:48:56,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 337 transitions, 838 flow [2022-01-19 13:48:56,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 337 transitions, 824 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 13:48:56,320 INFO L242 Difference]: Finished difference. Result has 304 places, 322 transitions, 710 flow [2022-01-19 13:48:56,321 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=710, PETRI_PLACES=304, PETRI_TRANSITIONS=322} [2022-01-19 13:48:56,322 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, -11 predicate places. [2022-01-19 13:48:56,322 INFO L470 AbstractCegarLoop]: Abstraction has has 304 places, 322 transitions, 710 flow [2022-01-19 13:48:56,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,323 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:56,323 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:56,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:48:56,323 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)] === [2022-01-19 13:48:56,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2137770165, now seen corresponding path program 1 times [2022-01-19 13:48:56,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:56,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211321560] [2022-01-19 13:48:56,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:56,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:48:56,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:56,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211321560] [2022-01-19 13:48:56,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211321560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:56,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:56,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:48:56,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678030904] [2022-01-19 13:48:56,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:56,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:48:56,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:48:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:48:56,444 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 356 [2022-01-19 13:48:56,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 322 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:56,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 356 [2022-01-19 13:48:56,446 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:56,724 INFO L129 PetriNetUnfolder]: 317/1067 cut-off events. [2022-01-19 13:48:56,724 INFO L130 PetriNetUnfolder]: For 278/288 co-relation queries the response was YES. [2022-01-19 13:48:56,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 1067 events. 317/1067 cut-off events. For 278/288 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4030 event pairs, 15 based on Foata normal form. 15/925 useless extension candidates. Maximal degree in co-relation 1725. Up to 194 conditions per place. [2022-01-19 13:48:56,738 INFO L132 encePairwiseOnDemand]: 353/356 looper letters, 57 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2022-01-19 13:48:56,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 348 transitions, 934 flow [2022-01-19 13:48:56,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:48:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:48:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2022-01-19 13:48:56,741 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9222846441947565 [2022-01-19 13:48:56,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 985 transitions. [2022-01-19 13:48:56,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 985 transitions. [2022-01-19 13:48:56,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:56,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 985 transitions. [2022-01-19 13:48:56,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,748 INFO L186 Difference]: Start difference. First operand has 304 places, 322 transitions, 710 flow. Second operand 3 states and 985 transitions. [2022-01-19 13:48:56,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 348 transitions, 934 flow [2022-01-19 13:48:56,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 348 transitions, 927 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:48:56,755 INFO L242 Difference]: Finished difference. Result has 306 places, 323 transitions, 720 flow [2022-01-19 13:48:56,756 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=306, PETRI_TRANSITIONS=323} [2022-01-19 13:48:56,757 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, -9 predicate places. [2022-01-19 13:48:56,757 INFO L470 AbstractCegarLoop]: Abstraction has has 306 places, 323 transitions, 720 flow [2022-01-19 13:48:56,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:56,758 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:56,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:48:56,759 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)] === [2022-01-19 13:48:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:56,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1331819937, now seen corresponding path program 1 times [2022-01-19 13:48:56,759 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:56,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114548480] [2022-01-19 13:48:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:56,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:48:56,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114548480] [2022-01-19 13:48:56,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114548480] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:56,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:56,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:48:56,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951741035] [2022-01-19 13:48:56,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:56,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:48:56,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:48:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:48:56,901 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 356 [2022-01-19 13:48:56,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 323 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:56,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:56,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 356 [2022-01-19 13:48:56,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:57,266 INFO L129 PetriNetUnfolder]: 579/1866 cut-off events. [2022-01-19 13:48:57,266 INFO L130 PetriNetUnfolder]: For 684/700 co-relation queries the response was YES. [2022-01-19 13:48:57,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3119 conditions, 1866 events. 579/1866 cut-off events. For 684/700 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10159 event pairs, 29 based on Foata normal form. 33/1568 useless extension candidates. Maximal degree in co-relation 3112. Up to 363 conditions per place. [2022-01-19 13:48:57,295 INFO L132 encePairwiseOnDemand]: 353/356 looper letters, 59 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2022-01-19 13:48:57,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 350 transitions, 956 flow [2022-01-19 13:48:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:48:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:48:57,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2022-01-19 13:48:57,298 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9222846441947565 [2022-01-19 13:48:57,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 985 transitions. [2022-01-19 13:48:57,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 985 transitions. [2022-01-19 13:48:57,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:57,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 985 transitions. [2022-01-19 13:48:57,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,304 INFO L186 Difference]: Start difference. First operand has 306 places, 323 transitions, 720 flow. Second operand 3 states and 985 transitions. [2022-01-19 13:48:57,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 350 transitions, 956 flow [2022-01-19 13:48:57,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 350 transitions, 953 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:48:57,316 INFO L242 Difference]: Finished difference. Result has 308 places, 324 transitions, 732 flow [2022-01-19 13:48:57,317 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=308, PETRI_TRANSITIONS=324} [2022-01-19 13:48:57,320 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, -7 predicate places. [2022-01-19 13:48:57,320 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 324 transitions, 732 flow [2022-01-19 13:48:57,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,321 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:57,321 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:57,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:48:57,321 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)] === [2022-01-19 13:48:57,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:57,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1308273172, now seen corresponding path program 1 times [2022-01-19 13:48:57,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:57,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985449485] [2022-01-19 13:48:57,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:57,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:48:57,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:57,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985449485] [2022-01-19 13:48:57,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985449485] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:57,389 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:57,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:48:57,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172994277] [2022-01-19 13:48:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:57,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:48:57,390 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:57,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:48:57,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:48:57,392 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 356 [2022-01-19 13:48:57,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 324 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:57,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 356 [2022-01-19 13:48:57,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:57,889 INFO L129 PetriNetUnfolder]: 1212/3067 cut-off events. [2022-01-19 13:48:57,890 INFO L130 PetriNetUnfolder]: For 1592/1718 co-relation queries the response was YES. [2022-01-19 13:48:57,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5817 conditions, 3067 events. 1212/3067 cut-off events. For 1592/1718 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 18739 event pairs, 155 based on Foata normal form. 27/2525 useless extension candidates. Maximal degree in co-relation 5809. Up to 847 conditions per place. [2022-01-19 13:48:57,947 INFO L132 encePairwiseOnDemand]: 351/356 looper letters, 52 selfloop transitions, 6 changer transitions 0/346 dead transitions. [2022-01-19 13:48:57,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 346 transitions, 949 flow [2022-01-19 13:48:57,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:48:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:48:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2022-01-19 13:48:57,950 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9176029962546817 [2022-01-19 13:48:57,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 980 transitions. [2022-01-19 13:48:57,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 980 transitions. [2022-01-19 13:48:57,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:57,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 980 transitions. [2022-01-19 13:48:57,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,956 INFO L186 Difference]: Start difference. First operand has 308 places, 324 transitions, 732 flow. Second operand 3 states and 980 transitions. [2022-01-19 13:48:57,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 346 transitions, 949 flow [2022-01-19 13:48:57,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 346 transitions, 946 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:48:57,966 INFO L242 Difference]: Finished difference. Result has 311 places, 325 transitions, 760 flow [2022-01-19 13:48:57,967 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=311, PETRI_TRANSITIONS=325} [2022-01-19 13:48:57,969 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, -4 predicate places. [2022-01-19 13:48:57,969 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 325 transitions, 760 flow [2022-01-19 13:48:57,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:57,970 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:57,970 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:57,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:48:57,970 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)] === [2022-01-19 13:48:57,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1010840920, now seen corresponding path program 1 times [2022-01-19 13:48:57,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:57,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349054196] [2022-01-19 13:48:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:57,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 13:48:58,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:58,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349054196] [2022-01-19 13:48:58,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349054196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:58,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:58,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:48:58,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13443862] [2022-01-19 13:48:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:58,084 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:48:58,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:58,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:48:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:48:58,087 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 356 [2022-01-19 13:48:58,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 325 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:58,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:58,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 356 [2022-01-19 13:48:58,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:58,690 INFO L129 PetriNetUnfolder]: 807/2922 cut-off events. [2022-01-19 13:48:58,690 INFO L130 PetriNetUnfolder]: For 1978/2167 co-relation queries the response was YES. [2022-01-19 13:48:58,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 2922 events. 807/2922 cut-off events. For 1978/2167 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 18611 event pairs, 117 based on Foata normal form. 95/2491 useless extension candidates. Maximal degree in co-relation 5123. Up to 794 conditions per place. [2022-01-19 13:48:58,732 INFO L132 encePairwiseOnDemand]: 344/356 looper letters, 128 selfloop transitions, 11 changer transitions 0/383 dead transitions. [2022-01-19 13:48:58,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 383 transitions, 1186 flow [2022-01-19 13:48:58,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:48:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:48:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2539 transitions. [2022-01-19 13:48:58,738 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7924469413233458 [2022-01-19 13:48:58,738 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2539 transitions. [2022-01-19 13:48:58,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2539 transitions. [2022-01-19 13:48:58,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:58,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2539 transitions. [2022-01-19 13:48:58,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 282.1111111111111) internal successors, (2539), 9 states have internal predecessors, (2539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:58,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 356.0) internal successors, (3560), 10 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:58,750 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 356.0) internal successors, (3560), 10 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:58,750 INFO L186 Difference]: Start difference. First operand has 311 places, 325 transitions, 760 flow. Second operand 9 states and 2539 transitions. [2022-01-19 13:48:58,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 383 transitions, 1186 flow [2022-01-19 13:48:58,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 383 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:48:58,758 INFO L242 Difference]: Finished difference. Result has 319 places, 329 transitions, 794 flow [2022-01-19 13:48:58,758 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=794, PETRI_PLACES=319, PETRI_TRANSITIONS=329} [2022-01-19 13:48:58,759 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 4 predicate places. [2022-01-19 13:48:58,759 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 329 transitions, 794 flow [2022-01-19 13:48:58,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:58,760 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:58,760 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:58,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:48:58,760 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)] === [2022-01-19 13:48:58,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:58,761 INFO L85 PathProgramCache]: Analyzing trace with hash -661414508, now seen corresponding path program 1 times [2022-01-19 13:48:58,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:58,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735718035] [2022-01-19 13:48:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:58,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 13:48:58,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:58,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735718035] [2022-01-19 13:48:58,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735718035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:48:58,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:48:58,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:48:58,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038428831] [2022-01-19 13:48:58,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:48:58,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:48:58,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:48:58,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:48:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:48:58,833 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 356 [2022-01-19 13:48:58,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 329 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:58,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:48:58,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 356 [2022-01-19 13:48:58,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:48:59,227 INFO L129 PetriNetUnfolder]: 1134/2460 cut-off events. [2022-01-19 13:48:59,227 INFO L130 PetriNetUnfolder]: For 2038/2205 co-relation queries the response was YES. [2022-01-19 13:48:59,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5571 conditions, 2460 events. 1134/2460 cut-off events. For 2038/2205 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 10131 event pairs, 43 based on Foata normal form. 2/2251 useless extension candidates. Maximal degree in co-relation 5560. Up to 1047 conditions per place. [2022-01-19 13:48:59,265 INFO L132 encePairwiseOnDemand]: 351/356 looper letters, 48 selfloop transitions, 5 changer transitions 3/338 dead transitions. [2022-01-19 13:48:59,265 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 338 transitions, 928 flow [2022-01-19 13:48:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:48:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:48:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2022-01-19 13:48:59,267 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.900749063670412 [2022-01-19 13:48:59,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 962 transitions. [2022-01-19 13:48:59,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 962 transitions. [2022-01-19 13:48:59,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:48:59,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 962 transitions. [2022-01-19 13:48:59,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:59,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:59,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:59,272 INFO L186 Difference]: Start difference. First operand has 319 places, 329 transitions, 794 flow. Second operand 3 states and 962 transitions. [2022-01-19 13:48:59,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 338 transitions, 928 flow [2022-01-19 13:48:59,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 338 transitions, 919 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 13:48:59,279 INFO L242 Difference]: Finished difference. Result has 320 places, 323 transitions, 774 flow [2022-01-19 13:48:59,280 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=774, PETRI_PLACES=320, PETRI_TRANSITIONS=323} [2022-01-19 13:48:59,280 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2022-01-19 13:48:59,281 INFO L470 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 774 flow [2022-01-19 13:48:59,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:48:59,281 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:48:59,281 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:48:59,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:48:59,282 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)] === [2022-01-19 13:48:59,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:48:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1101377145, now seen corresponding path program 1 times [2022-01-19 13:48:59,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:48:59,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373660710] [2022-01-19 13:48:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:59,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:48:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:48:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:48:59,872 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:48:59,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373660710] [2022-01-19 13:48:59,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373660710] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:48:59,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262321002] [2022-01-19 13:48:59,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:48:59,873 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:48:59,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:48:59,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:48:59,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 13:49:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:00,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-19 13:49:00,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:00,285 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:00,351 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-19 13:49:00,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-01-19 13:49:01,209 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 13:49:01,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-01-19 13:49:01,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 13:49:03,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:03,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:04,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:04,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:49:04,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:49:06,402 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:49:06,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 56 [2022-01-19 13:49:06,414 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 13:49:06,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 773 [2022-01-19 13:49:06,426 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:49:06,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 766 treesize of output 574 [2022-01-19 13:49:06,437 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:49:06,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 574 treesize of output 526 [2022-01-19 13:49:06,448 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:49:06,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 526 treesize of output 430 [2022-01-19 13:49:06,461 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:49:06,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 202 [2022-01-19 13:49:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:49:07,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262321002] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:49:07,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:49:07,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 30, 25] total 65 [2022-01-19 13:49:07,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635719241] [2022-01-19 13:49:07,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:49:07,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-01-19 13:49:07,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:07,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-01-19 13:49:07,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=3310, Unknown=113, NotChecked=0, Total=4160 [2022-01-19 13:49:07,921 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 356 [2022-01-19 13:49:07,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 323 transitions, 774 flow. Second operand has 65 states, 65 states have (on average 174.26153846153846) internal successors, (11327), 65 states have internal predecessors, (11327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:07,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:07,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 356 [2022-01-19 13:49:07,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:13,504 INFO L129 PetriNetUnfolder]: 3870/10455 cut-off events. [2022-01-19 13:49:13,505 INFO L130 PetriNetUnfolder]: For 8394/9180 co-relation queries the response was YES. [2022-01-19 13:49:13,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22387 conditions, 10455 events. 3870/10455 cut-off events. For 8394/9180 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 89557 event pairs, 22 based on Foata normal form. 48/9205 useless extension candidates. Maximal degree in co-relation 22375. Up to 2245 conditions per place. [2022-01-19 13:49:13,656 INFO L132 encePairwiseOnDemand]: 314/356 looper letters, 379 selfloop transitions, 83 changer transitions 16/641 dead transitions. [2022-01-19 13:49:13,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 641 transitions, 2793 flow [2022-01-19 13:49:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 13:49:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 13:49:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 8407 transitions. [2022-01-19 13:49:13,676 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5024503944537413 [2022-01-19 13:49:13,676 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 8407 transitions. [2022-01-19 13:49:13,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 8407 transitions. [2022-01-19 13:49:13,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:13,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 8407 transitions. [2022-01-19 13:49:13,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 178.87234042553192) internal successors, (8407), 47 states have internal predecessors, (8407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:13,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 356.0) internal successors, (17088), 48 states have internal predecessors, (17088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:13,723 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 356.0) internal successors, (17088), 48 states have internal predecessors, (17088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:13,723 INFO L186 Difference]: Start difference. First operand has 320 places, 323 transitions, 774 flow. Second operand 47 states and 8407 transitions. [2022-01-19 13:49:13,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 641 transitions, 2793 flow [2022-01-19 13:49:13,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 641 transitions, 2728 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-01-19 13:49:13,740 INFO L242 Difference]: Finished difference. Result has 379 places, 382 transitions, 1405 flow [2022-01-19 13:49:13,741 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1405, PETRI_PLACES=379, PETRI_TRANSITIONS=382} [2022-01-19 13:49:13,742 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 64 predicate places. [2022-01-19 13:49:13,742 INFO L470 AbstractCegarLoop]: Abstraction has has 379 places, 382 transitions, 1405 flow [2022-01-19 13:49:13,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 174.26153846153846) internal successors, (11327), 65 states have internal predecessors, (11327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:13,745 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:13,745 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:13,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 13:49:13,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:13,968 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)] === [2022-01-19 13:49:13,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:13,969 INFO L85 PathProgramCache]: Analyzing trace with hash 97707508, now seen corresponding path program 1 times [2022-01-19 13:49:13,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:13,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088932483] [2022-01-19 13:49:13,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:13,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 13:49:14,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:14,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088932483] [2022-01-19 13:49:14,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088932483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:14,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:14,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:49:14,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245526256] [2022-01-19 13:49:14,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:14,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:49:14,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:14,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:49:14,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:49:14,121 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 356 [2022-01-19 13:49:14,122 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 382 transitions, 1405 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:14,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:14,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 356 [2022-01-19 13:49:14,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:16,066 INFO L129 PetriNetUnfolder]: 4120/11145 cut-off events. [2022-01-19 13:49:16,066 INFO L130 PetriNetUnfolder]: For 36163/38111 co-relation queries the response was YES. [2022-01-19 13:49:16,148 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31381 conditions, 11145 events. 4120/11145 cut-off events. For 36163/38111 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 101607 event pairs, 547 based on Foata normal form. 63/9597 useless extension candidates. Maximal degree in co-relation 31350. Up to 3185 conditions per place. [2022-01-19 13:49:16,253 INFO L132 encePairwiseOnDemand]: 351/356 looper letters, 97 selfloop transitions, 8 changer transitions 0/407 dead transitions. [2022-01-19 13:49:16,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 407 transitions, 1803 flow [2022-01-19 13:49:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:49:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:49:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2022-01-19 13:49:16,256 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9185393258426966 [2022-01-19 13:49:16,256 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 981 transitions. [2022-01-19 13:49:16,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 981 transitions. [2022-01-19 13:49:16,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:16,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 981 transitions. [2022-01-19 13:49:16,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.0) internal successors, (981), 3 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:16,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:16,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:16,261 INFO L186 Difference]: Start difference. First operand has 379 places, 382 transitions, 1405 flow. Second operand 3 states and 981 transitions. [2022-01-19 13:49:16,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 407 transitions, 1803 flow [2022-01-19 13:49:16,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 407 transitions, 1703 flow, removed 31 selfloop flow, removed 23 redundant places. [2022-01-19 13:49:16,380 INFO L242 Difference]: Finished difference. Result has 354 places, 378 transitions, 1316 flow [2022-01-19 13:49:16,381 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=354, PETRI_TRANSITIONS=378} [2022-01-19 13:49:16,381 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 39 predicate places. [2022-01-19 13:49:16,381 INFO L470 AbstractCegarLoop]: Abstraction has has 354 places, 378 transitions, 1316 flow [2022-01-19 13:49:16,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:16,382 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:16,382 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:16,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 13:49:16,382 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)] === [2022-01-19 13:49:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:16,383 INFO L85 PathProgramCache]: Analyzing trace with hash -2106631031, now seen corresponding path program 1 times [2022-01-19 13:49:16,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:16,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144807419] [2022-01-19 13:49:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:16,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 13:49:16,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:16,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144807419] [2022-01-19 13:49:16,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144807419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:16,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:16,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:49:16,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124461641] [2022-01-19 13:49:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:16,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:49:16,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:49:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:49:16,476 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 356 [2022-01-19 13:49:16,477 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 378 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:16,477 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:16,477 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 356 [2022-01-19 13:49:16,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:18,855 INFO L129 PetriNetUnfolder]: 5140/14798 cut-off events. [2022-01-19 13:49:18,855 INFO L130 PetriNetUnfolder]: For 50523/53873 co-relation queries the response was YES. [2022-01-19 13:49:18,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40688 conditions, 14798 events. 5140/14798 cut-off events. For 50523/53873 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 151297 event pairs, 898 based on Foata normal form. 48/12919 useless extension candidates. Maximal degree in co-relation 40662. Up to 3930 conditions per place. [2022-01-19 13:49:19,062 INFO L132 encePairwiseOnDemand]: 351/356 looper letters, 88 selfloop transitions, 8 changer transitions 0/399 dead transitions. [2022-01-19 13:49:19,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 399 transitions, 1677 flow [2022-01-19 13:49:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:49:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:49:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 980 transitions. [2022-01-19 13:49:19,064 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9176029962546817 [2022-01-19 13:49:19,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 980 transitions. [2022-01-19 13:49:19,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 980 transitions. [2022-01-19 13:49:19,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:19,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 980 transitions. [2022-01-19 13:49:19,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:19,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:19,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:19,069 INFO L186 Difference]: Start difference. First operand has 354 places, 378 transitions, 1316 flow. Second operand 3 states and 980 transitions. [2022-01-19 13:49:19,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 399 transitions, 1677 flow [2022-01-19 13:49:19,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 399 transitions, 1641 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-01-19 13:49:19,120 INFO L242 Difference]: Finished difference. Result has 356 places, 371 transitions, 1267 flow [2022-01-19 13:49:19,121 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1229, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1267, PETRI_PLACES=356, PETRI_TRANSITIONS=371} [2022-01-19 13:49:19,121 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 41 predicate places. [2022-01-19 13:49:19,121 INFO L470 AbstractCegarLoop]: Abstraction has has 356 places, 371 transitions, 1267 flow [2022-01-19 13:49:19,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:19,122 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:19,122 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:19,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 13:49:19,122 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)] === [2022-01-19 13:49:19,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1922442760, now seen corresponding path program 1 times [2022-01-19 13:49:19,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:19,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956980576] [2022-01-19 13:49:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:19,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 13:49:19,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:19,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956980576] [2022-01-19 13:49:19,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956980576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:19,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:19,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:49:19,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452692523] [2022-01-19 13:49:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:19,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:49:19,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:49:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:49:19,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 356 [2022-01-19 13:49:19,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 371 transitions, 1267 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:19,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:19,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 356 [2022-01-19 13:49:19,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:20,946 INFO L129 PetriNetUnfolder]: 2800/10024 cut-off events. [2022-01-19 13:49:20,946 INFO L130 PetriNetUnfolder]: For 39624/41356 co-relation queries the response was YES. [2022-01-19 13:49:21,007 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27621 conditions, 10024 events. 2800/10024 cut-off events. For 39624/41356 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 99102 event pairs, 271 based on Foata normal form. 189/9087 useless extension candidates. Maximal degree in co-relation 27594. Up to 2733 conditions per place. [2022-01-19 13:49:21,082 INFO L132 encePairwiseOnDemand]: 353/356 looper letters, 96 selfloop transitions, 2 changer transitions 0/403 dead transitions. [2022-01-19 13:49:21,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 403 transitions, 1737 flow [2022-01-19 13:49:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:49:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:49:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 982 transitions. [2022-01-19 13:49:21,085 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9194756554307116 [2022-01-19 13:49:21,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 982 transitions. [2022-01-19 13:49:21,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 982 transitions. [2022-01-19 13:49:21,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:21,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 982 transitions. [2022-01-19 13:49:21,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:21,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:21,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:21,090 INFO L186 Difference]: Start difference. First operand has 356 places, 371 transitions, 1267 flow. Second operand 3 states and 982 transitions. [2022-01-19 13:49:21,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 403 transitions, 1737 flow [2022-01-19 13:49:21,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 403 transitions, 1697 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-01-19 13:49:21,160 INFO L242 Difference]: Finished difference. Result has 354 places, 366 transitions, 1210 flow [2022-01-19 13:49:21,160 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=354, PETRI_TRANSITIONS=366} [2022-01-19 13:49:21,161 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 39 predicate places. [2022-01-19 13:49:21,161 INFO L470 AbstractCegarLoop]: Abstraction has has 354 places, 366 transitions, 1210 flow [2022-01-19 13:49:21,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:21,161 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:21,162 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:21,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 13:49:21,162 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)] === [2022-01-19 13:49:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 801453710, now seen corresponding path program 2 times [2022-01-19 13:49:21,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63441223] [2022-01-19 13:49:21,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:21,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 13:49:21,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:21,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63441223] [2022-01-19 13:49:21,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63441223] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:21,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:21,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:49:21,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977306279] [2022-01-19 13:49:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:21,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:49:21,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:49:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:49:21,222 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 356 [2022-01-19 13:49:21,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 366 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:21,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:21,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 356 [2022-01-19 13:49:21,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:23,792 INFO L129 PetriNetUnfolder]: 6436/15814 cut-off events. [2022-01-19 13:49:23,792 INFO L130 PetriNetUnfolder]: For 83527/86511 co-relation queries the response was YES. [2022-01-19 13:49:23,904 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55326 conditions, 15814 events. 6436/15814 cut-off events. For 83527/86511 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 143931 event pairs, 649 based on Foata normal form. 12/13990 useless extension candidates. Maximal degree in co-relation 55299. Up to 6079 conditions per place. [2022-01-19 13:49:24,052 INFO L132 encePairwiseOnDemand]: 351/356 looper letters, 82 selfloop transitions, 12 changer transitions 0/389 dead transitions. [2022-01-19 13:49:24,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 389 transitions, 1598 flow [2022-01-19 13:49:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:49:24,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:49:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2022-01-19 13:49:24,054 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.900749063670412 [2022-01-19 13:49:24,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 962 transitions. [2022-01-19 13:49:24,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 962 transitions. [2022-01-19 13:49:24,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:24,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 962 transitions. [2022-01-19 13:49:24,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:24,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:24,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:24,059 INFO L186 Difference]: Start difference. First operand has 354 places, 366 transitions, 1210 flow. Second operand 3 states and 962 transitions. [2022-01-19 13:49:24,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 389 transitions, 1598 flow [2022-01-19 13:49:24,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 389 transitions, 1596 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:49:24,093 INFO L242 Difference]: Finished difference. Result has 357 places, 367 transitions, 1264 flow [2022-01-19 13:49:24,093 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1264, PETRI_PLACES=357, PETRI_TRANSITIONS=367} [2022-01-19 13:49:24,094 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 42 predicate places. [2022-01-19 13:49:24,094 INFO L470 AbstractCegarLoop]: Abstraction has has 357 places, 367 transitions, 1264 flow [2022-01-19 13:49:24,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.6666666666667) internal successors, (929), 3 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:24,094 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:24,094 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:24,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:49:24,095 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:49:24,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash -449639935, now seen corresponding path program 1 times [2022-01-19 13:49:24,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:24,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389596417] [2022-01-19 13:49:24,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:24,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 13:49:24,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:24,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389596417] [2022-01-19 13:49:24,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389596417] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:24,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:24,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:49:24,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867300675] [2022-01-19 13:49:24,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:24,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:49:24,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:24,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:49:24,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:49:24,152 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 356 [2022-01-19 13:49:24,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 367 transitions, 1264 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:24,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:24,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 356 [2022-01-19 13:49:24,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:26,630 INFO L129 PetriNetUnfolder]: 6024/14711 cut-off events. [2022-01-19 13:49:26,630 INFO L130 PetriNetUnfolder]: For 80586/83401 co-relation queries the response was YES. [2022-01-19 13:49:26,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52706 conditions, 14711 events. 6024/14711 cut-off events. For 80586/83401 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 128433 event pairs, 675 based on Foata normal form. 116/13413 useless extension candidates. Maximal degree in co-relation 52678. Up to 5600 conditions per place. [2022-01-19 13:49:26,823 INFO L132 encePairwiseOnDemand]: 350/356 looper letters, 91 selfloop transitions, 5 changer transitions 0/391 dead transitions. [2022-01-19 13:49:26,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 391 transitions, 1660 flow [2022-01-19 13:49:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:49:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:49:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2022-01-19 13:49:26,825 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9026217228464419 [2022-01-19 13:49:26,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 964 transitions. [2022-01-19 13:49:26,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 964 transitions. [2022-01-19 13:49:26,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:26,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 964 transitions. [2022-01-19 13:49:26,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:26,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:26,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:26,829 INFO L186 Difference]: Start difference. First operand has 357 places, 367 transitions, 1264 flow. Second operand 3 states and 964 transitions. [2022-01-19 13:49:26,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 391 transitions, 1660 flow [2022-01-19 13:49:26,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 391 transitions, 1636 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:49:26,865 INFO L242 Difference]: Finished difference. Result has 359 places, 368 transitions, 1270 flow [2022-01-19 13:49:26,866 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1270, PETRI_PLACES=359, PETRI_TRANSITIONS=368} [2022-01-19 13:49:26,866 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 44 predicate places. [2022-01-19 13:49:26,866 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 368 transitions, 1270 flow [2022-01-19 13:49:26,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:26,867 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:26,867 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:26,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:49:26,867 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:49:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1213959807, now seen corresponding path program 1 times [2022-01-19 13:49:26,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:26,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002775936] [2022-01-19 13:49:26,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:26,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 13:49:26,944 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:26,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002775936] [2022-01-19 13:49:26,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002775936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:26,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:26,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:49:26,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092003999] [2022-01-19 13:49:26,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:26,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:49:26,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:49:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:49:26,948 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 356 [2022-01-19 13:49:26,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 368 transitions, 1270 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:26,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:26,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 356 [2022-01-19 13:49:26,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:28,880 INFO L129 PetriNetUnfolder]: 2938/10745 cut-off events. [2022-01-19 13:49:28,880 INFO L130 PetriNetUnfolder]: For 34250/35918 co-relation queries the response was YES. [2022-01-19 13:49:28,936 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29472 conditions, 10745 events. 2938/10745 cut-off events. For 34250/35918 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 104281 event pairs, 437 based on Foata normal form. 3/9535 useless extension candidates. Maximal degree in co-relation 29443. Up to 3534 conditions per place. [2022-01-19 13:49:28,981 INFO L132 encePairwiseOnDemand]: 346/356 looper letters, 110 selfloop transitions, 8 changer transitions 29/401 dead transitions. [2022-01-19 13:49:28,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 401 transitions, 1704 flow [2022-01-19 13:49:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:49:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:49:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2510 transitions. [2022-01-19 13:49:28,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7833957553058677 [2022-01-19 13:49:28,985 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2510 transitions. [2022-01-19 13:49:28,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2510 transitions. [2022-01-19 13:49:28,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:28,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2510 transitions. [2022-01-19 13:49:28,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 278.8888888888889) internal successors, (2510), 9 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:28,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 356.0) internal successors, (3560), 10 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:28,996 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 356.0) internal successors, (3560), 10 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:28,996 INFO L186 Difference]: Start difference. First operand has 359 places, 368 transitions, 1270 flow. Second operand 9 states and 2510 transitions. [2022-01-19 13:49:28,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 401 transitions, 1704 flow [2022-01-19 13:49:29,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 401 transitions, 1694 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:49:29,022 INFO L242 Difference]: Finished difference. Result has 367 places, 369 transitions, 1288 flow [2022-01-19 13:49:29,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1288, PETRI_PLACES=367, PETRI_TRANSITIONS=369} [2022-01-19 13:49:29,023 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 52 predicate places. [2022-01-19 13:49:29,023 INFO L470 AbstractCegarLoop]: Abstraction has has 367 places, 369 transitions, 1288 flow [2022-01-19 13:49:29,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:29,023 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:29,024 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:29,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 13:49:29,024 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:49:29,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1319579132, now seen corresponding path program 1 times [2022-01-19 13:49:29,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:29,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496220624] [2022-01-19 13:49:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:29,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 13:49:29,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:29,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496220624] [2022-01-19 13:49:29,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496220624] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:29,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111806789] [2022-01-19 13:49:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:29,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:29,572 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:49:29,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 13:49:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:29,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-19 13:49:29,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:31,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 13:49:31,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:31,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:32,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:32,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:49:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 13:49:32,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:49:33,782 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:49:33,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 56 [2022-01-19 13:49:33,794 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 13:49:33,795 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3222 treesize of output 3101 [2022-01-19 13:49:33,815 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:49:33,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3094 treesize of output 2326 [2022-01-19 13:49:33,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 13:49:33,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1163 treesize of output 1067 [2022-01-19 13:49:33,854 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:49:33,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2230 treesize of output 1846 [2022-01-19 13:49:33,872 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:49:33,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1846 treesize of output 1654 [2022-01-19 13:49:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 13:49:42,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111806789] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:49:42,607 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:49:42,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 21] total 58 [2022-01-19 13:49:42,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786907383] [2022-01-19 13:49:42,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:49:42,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-19 13:49:42,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:42,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-19 13:49:42,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=2707, Unknown=80, NotChecked=0, Total=3306 [2022-01-19 13:49:42,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 356 [2022-01-19 13:49:42,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 369 transitions, 1288 flow. Second operand has 58 states, 58 states have (on average 177.48275862068965) internal successors, (10294), 58 states have internal predecessors, (10294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:42,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:42,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 356 [2022-01-19 13:49:42,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:56,141 INFO L129 PetriNetUnfolder]: 24405/64748 cut-off events. [2022-01-19 13:49:56,141 INFO L130 PetriNetUnfolder]: For 310728/323084 co-relation queries the response was YES. [2022-01-19 13:49:57,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219594 conditions, 64748 events. 24405/64748 cut-off events. For 310728/323084 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 788661 event pairs, 1070 based on Foata normal form. 276/58708 useless extension candidates. Maximal degree in co-relation 219563. Up to 16631 conditions per place. [2022-01-19 13:49:57,806 INFO L132 encePairwiseOnDemand]: 320/356 looper letters, 464 selfloop transitions, 88 changer transitions 16/740 dead transitions. [2022-01-19 13:49:57,806 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 740 transitions, 4867 flow [2022-01-19 13:49:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 13:49:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 13:49:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 7970 transitions. [2022-01-19 13:49:57,816 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5088100102145046 [2022-01-19 13:49:57,816 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 7970 transitions. [2022-01-19 13:49:57,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 7970 transitions. [2022-01-19 13:49:57,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:57,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 7970 transitions. [2022-01-19 13:49:57,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 181.13636363636363) internal successors, (7970), 44 states have internal predecessors, (7970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:57,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 356.0) internal successors, (16020), 45 states have internal predecessors, (16020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:57,848 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 356.0) internal successors, (16020), 45 states have internal predecessors, (16020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:57,849 INFO L186 Difference]: Start difference. First operand has 367 places, 369 transitions, 1288 flow. Second operand 44 states and 7970 transitions. [2022-01-19 13:49:57,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 740 transitions, 4867 flow [2022-01-19 13:49:57,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 740 transitions, 4843 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-01-19 13:49:57,992 INFO L242 Difference]: Finished difference. Result has 421 places, 435 transitions, 2251 flow [2022-01-19 13:49:57,992 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=2251, PETRI_PLACES=421, PETRI_TRANSITIONS=435} [2022-01-19 13:49:57,992 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 106 predicate places. [2022-01-19 13:49:57,993 INFO L470 AbstractCegarLoop]: Abstraction has has 421 places, 435 transitions, 2251 flow [2022-01-19 13:49:57,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 177.48275862068965) internal successors, (10294), 58 states have internal predecessors, (10294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:57,995 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:57,995 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:49:58,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 13:49:58,219 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,SelfDestructingSolverStorable15 [2022-01-19 13:49:58,219 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:49:58,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash 992276515, now seen corresponding path program 2 times [2022-01-19 13:49:58,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:58,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600299252] [2022-01-19 13:49:58,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:58,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 13:49:58,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600299252] [2022-01-19 13:49:58,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600299252] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740528131] [2022-01-19 13:49:58,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:49:58,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:58,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:49:58,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 13:49:58,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 13:49:58,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:49:58,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 13:49:58,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-19 13:49:58,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 13:49:58,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740528131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:58,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 13:49:58,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-19 13:49:58,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84981627] [2022-01-19 13:49:58,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:58,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:49:58,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:49:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:49:58,855 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 356 [2022-01-19 13:49:58,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 435 transitions, 2251 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:49:58,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:58,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 356 [2022-01-19 13:49:58,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:50:13,163 INFO L129 PetriNetUnfolder]: 22797/61794 cut-off events. [2022-01-19 13:50:13,163 INFO L130 PetriNetUnfolder]: For 410410/426257 co-relation queries the response was YES. [2022-01-19 13:50:14,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 218178 conditions, 61794 events. 22797/61794 cut-off events. For 410410/426257 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 772377 event pairs, 3318 based on Foata normal form. 340/54972 useless extension candidates. Maximal degree in co-relation 218129. Up to 15312 conditions per place. [2022-01-19 13:50:14,659 INFO L132 encePairwiseOnDemand]: 353/356 looper letters, 151 selfloop transitions, 21 changer transitions 0/489 dead transitions. [2022-01-19 13:50:14,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 489 transitions, 3263 flow [2022-01-19 13:50:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:50:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:50:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 979 transitions. [2022-01-19 13:50:14,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2022-01-19 13:50:14,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 979 transitions. [2022-01-19 13:50:14,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 979 transitions. [2022-01-19 13:50:14,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:50:14,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 979 transitions. [2022-01-19 13:50:14,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:14,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:14,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:14,665 INFO L186 Difference]: Start difference. First operand has 421 places, 435 transitions, 2251 flow. Second operand 3 states and 979 transitions. [2022-01-19 13:50:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 489 transitions, 3263 flow [2022-01-19 13:50:15,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 489 transitions, 3006 flow, removed 110 selfloop flow, removed 21 redundant places. [2022-01-19 13:50:15,024 INFO L242 Difference]: Finished difference. Result has 396 places, 434 transitions, 2108 flow [2022-01-19 13:50:15,024 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=396, PETRI_TRANSITIONS=434} [2022-01-19 13:50:15,024 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 81 predicate places. [2022-01-19 13:50:15,025 INFO L470 AbstractCegarLoop]: Abstraction has has 396 places, 434 transitions, 2108 flow [2022-01-19 13:50:15,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:15,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:50:15,025 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:50:15,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 13:50:15,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:50:15,228 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:50:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:50:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash -622006076, now seen corresponding path program 1 times [2022-01-19 13:50:15,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:50:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974414527] [2022-01-19 13:50:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:50:15,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:50:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:50:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-19 13:50:15,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:50:15,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974414527] [2022-01-19 13:50:15,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974414527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:50:15,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:50:15,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:50:15,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262511458] [2022-01-19 13:50:15,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:50:15,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:50:15,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:50:15,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:50:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:50:15,277 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 356 [2022-01-19 13:50:15,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 434 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:15,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:50:15,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 356 [2022-01-19 13:50:15,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:50:23,868 INFO L129 PetriNetUnfolder]: 17497/43091 cut-off events. [2022-01-19 13:50:23,869 INFO L130 PetriNetUnfolder]: For 368440/378440 co-relation queries the response was YES. [2022-01-19 13:50:24,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170561 conditions, 43091 events. 17497/43091 cut-off events. For 368440/378440 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 469435 event pairs, 1933 based on Foata normal form. 349/39735 useless extension candidates. Maximal degree in co-relation 170518. Up to 13225 conditions per place. [2022-01-19 13:50:24,637 INFO L132 encePairwiseOnDemand]: 351/356 looper letters, 159 selfloop transitions, 4 changer transitions 0/469 dead transitions. [2022-01-19 13:50:24,637 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 469 transitions, 2864 flow [2022-01-19 13:50:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:50:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:50:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2022-01-19 13:50:24,638 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.901685393258427 [2022-01-19 13:50:24,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 963 transitions. [2022-01-19 13:50:24,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 963 transitions. [2022-01-19 13:50:24,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:50:24,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 963 transitions. [2022-01-19 13:50:24,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 321.0) internal successors, (963), 3 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:24,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:24,641 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:24,641 INFO L186 Difference]: Start difference. First operand has 396 places, 434 transitions, 2108 flow. Second operand 3 states and 963 transitions. [2022-01-19 13:50:24,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 469 transitions, 2864 flow [2022-01-19 13:50:24,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 469 transitions, 2786 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 13:50:24,803 INFO L242 Difference]: Finished difference. Result has 396 places, 429 transitions, 2027 flow [2022-01-19 13:50:24,804 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2027, PETRI_PLACES=396, PETRI_TRANSITIONS=429} [2022-01-19 13:50:24,804 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 81 predicate places. [2022-01-19 13:50:24,804 INFO L470 AbstractCegarLoop]: Abstraction has has 396 places, 429 transitions, 2027 flow [2022-01-19 13:50:24,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:24,805 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:50:24,805 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:50:24,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 13:50:24,805 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:50:24,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:50:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1451409838, now seen corresponding path program 1 times [2022-01-19 13:50:24,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:50:24,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804829810] [2022-01-19 13:50:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:50:24,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:50:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:50:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-19 13:50:24,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:50:24,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804829810] [2022-01-19 13:50:24,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804829810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:50:24,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:50:24,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:50:24,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639791654] [2022-01-19 13:50:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:50:24,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:50:24,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:50:24,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:50:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:50:24,887 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 356 [2022-01-19 13:50:24,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 429 transitions, 2027 flow. Second operand has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:24,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:50:24,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 356 [2022-01-19 13:50:24,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:50:30,801 INFO L129 PetriNetUnfolder]: 8941/31864 cut-off events. [2022-01-19 13:50:30,801 INFO L130 PetriNetUnfolder]: For 162079/167643 co-relation queries the response was YES. [2022-01-19 13:50:31,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97058 conditions, 31864 events. 8941/31864 cut-off events. For 162079/167643 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 390651 event pairs, 1319 based on Foata normal form. 24/28943 useless extension candidates. Maximal degree in co-relation 97015. Up to 11288 conditions per place. [2022-01-19 13:50:31,504 INFO L132 encePairwiseOnDemand]: 348/356 looper letters, 204 selfloop transitions, 8 changer transitions 0/468 dead transitions. [2022-01-19 13:50:31,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 468 transitions, 2787 flow [2022-01-19 13:50:31,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:50:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:50:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1965 transitions. [2022-01-19 13:50:31,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7885232744783307 [2022-01-19 13:50:31,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1965 transitions. [2022-01-19 13:50:31,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1965 transitions. [2022-01-19 13:50:31,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:50:31,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1965 transitions. [2022-01-19 13:50:31,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 280.7142857142857) internal successors, (1965), 7 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:31,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:31,510 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 356.0) internal successors, (2848), 8 states have internal predecessors, (2848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:31,510 INFO L186 Difference]: Start difference. First operand has 396 places, 429 transitions, 2027 flow. Second operand 7 states and 1965 transitions. [2022-01-19 13:50:31,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 468 transitions, 2787 flow [2022-01-19 13:50:31,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 468 transitions, 2779 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:50:31,632 INFO L242 Difference]: Finished difference. Result has 402 places, 431 transitions, 2049 flow [2022-01-19 13:50:31,633 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2049, PETRI_PLACES=402, PETRI_TRANSITIONS=431} [2022-01-19 13:50:31,633 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 87 predicate places. [2022-01-19 13:50:31,633 INFO L470 AbstractCegarLoop]: Abstraction has has 402 places, 431 transitions, 2049 flow [2022-01-19 13:50:31,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:31,634 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:50:31,634 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:50:31,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 13:50:31,634 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:50:31,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:50:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash -988165473, now seen corresponding path program 1 times [2022-01-19 13:50:31,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:50:31,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798358579] [2022-01-19 13:50:31,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:50:31,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:50:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:50:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 13:50:31,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:50:31,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798358579] [2022-01-19 13:50:31,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798358579] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:50:31,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662240194] [2022-01-19 13:50:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:50:31,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:50:31,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:50:31,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:50:31,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 13:50:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:50:31,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 13:50:31,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:50:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 13:50:32,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:50:33,081 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 13:50:33,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662240194] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:50:33,081 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:50:33,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-01-19 13:50:33,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392543000] [2022-01-19 13:50:33,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:50:33,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:50:33,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:50:33,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:50:33,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:50:33,087 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 356 [2022-01-19 13:50:33,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 431 transitions, 2049 flow. Second operand has 19 states, 19 states have (on average 266.8421052631579) internal successors, (5070), 19 states have internal predecessors, (5070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:33,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:50:33,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 356 [2022-01-19 13:50:33,091 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:50:36,605 INFO L129 PetriNetUnfolder]: 3872/16608 cut-off events. [2022-01-19 13:50:36,605 INFO L130 PetriNetUnfolder]: For 89643/92508 co-relation queries the response was YES. [2022-01-19 13:50:36,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48723 conditions, 16608 events. 3872/16608 cut-off events. For 89643/92508 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 187412 event pairs, 572 based on Foata normal form. 947/16144 useless extension candidates. Maximal degree in co-relation 48678. Up to 3950 conditions per place. [2022-01-19 13:50:36,782 INFO L132 encePairwiseOnDemand]: 334/356 looper letters, 196 selfloop transitions, 36 changer transitions 5/486 dead transitions. [2022-01-19 13:50:36,782 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 486 transitions, 2642 flow [2022-01-19 13:50:36,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:50:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:50:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4604 transitions. [2022-01-19 13:50:36,785 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7607402511566425 [2022-01-19 13:50:36,785 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4604 transitions. [2022-01-19 13:50:36,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4604 transitions. [2022-01-19 13:50:36,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:50:36,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4604 transitions. [2022-01-19 13:50:36,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 270.8235294117647) internal successors, (4604), 17 states have internal predecessors, (4604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:36,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 356.0) internal successors, (6408), 18 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:36,793 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 356.0) internal successors, (6408), 18 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:36,793 INFO L186 Difference]: Start difference. First operand has 402 places, 431 transitions, 2049 flow. Second operand 17 states and 4604 transitions. [2022-01-19 13:50:36,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 486 transitions, 2642 flow [2022-01-19 13:50:36,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 486 transitions, 2596 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-01-19 13:50:36,854 INFO L242 Difference]: Finished difference. Result has 413 places, 413 transitions, 1812 flow [2022-01-19 13:50:36,855 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1812, PETRI_PLACES=413, PETRI_TRANSITIONS=413} [2022-01-19 13:50:36,855 INFO L334 CegarLoopForPetriNet]: 315 programPoint places, 98 predicate places. [2022-01-19 13:50:36,855 INFO L470 AbstractCegarLoop]: Abstraction has has 413 places, 413 transitions, 1812 flow [2022-01-19 13:50:36,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 266.8421052631579) internal successors, (5070), 19 states have internal predecessors, (5070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:50:36,856 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:50:36,856 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:50:36,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 13:50:37,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:50:37,080 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:50:37,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:50:37,080 INFO L85 PathProgramCache]: Analyzing trace with hash 238562649, now seen corresponding path program 1 times [2022-01-19 13:50:37,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:50:37,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330433734] [2022-01-19 13:50:37,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:50:37,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:50:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:50:37,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-19 13:50:37,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:50:37,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330433734] [2022-01-19 13:50:37,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330433734] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:50:37,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79197728] [2022-01-19 13:50:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:50:37,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:50:37,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:50:37,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:50:37,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 13:50:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:50:37,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-19 13:50:37,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:50:39,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 13:50:39,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:50:39,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:50:39,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:50:39,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 13:50:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-19 13:50:40,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:50:41,366 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:50:41,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 56 [2022-01-19 13:50:41,389 INFO L353 Elim1Store]: treesize reduction 9, result has 43.8 percent of original size [2022-01-19 13:50:41,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51702 treesize of output 49661 [2022-01-19 13:50:41,586 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:50:41,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49654 treesize of output 48118 [2022-01-19 13:50:41,754 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:50:41,755 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48118 treesize of output 45046 [2022-01-19 13:50:41,874 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:50:41,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45046 treesize of output 32758 [2022-01-19 13:50:42,006 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-19 13:50:42,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32758 treesize of output 26614 Received shutdown request... [2022-01-19 14:02:36,857 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-19 14:02:36,859 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 14:02:36,869 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 14:02:36,869 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 14:02:36,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 14:02:37,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:02:37,060 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 286 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 22ms.. [2022-01-19 14:02:37,062 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-01-19 14:02:37,062 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 14:02:37,062 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 14:02:37,063 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-01-19 14:02:37,066 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:02:37,068 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 14:02:37,068 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 14:02:37,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 02:02:37 BasicIcfg [2022-01-19 14:02:37,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 14:02:37,071 INFO L158 Benchmark]: Toolchain (without parser) took 823951.09ms. Allocated memory was 369.1MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 314.9MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 13.0GB. Max. memory is 16.0GB. [2022-01-19 14:02:37,071 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory is still 332.4MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 14:02:37,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.17ms. Allocated memory is still 369.1MB. Free memory was 314.8MB in the beginning and 338.1MB in the end (delta: -23.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.0GB. [2022-01-19 14:02:37,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.25ms. Allocated memory is still 369.1MB. Free memory was 338.1MB in the beginning and 334.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 14:02:37,072 INFO L158 Benchmark]: Boogie Preprocessor took 36.52ms. Allocated memory is still 369.1MB. Free memory was 334.9MB in the beginning and 331.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 14:02:37,072 INFO L158 Benchmark]: RCFGBuilder took 862.67ms. Allocated memory is still 369.1MB. Free memory was 331.8MB in the beginning and 278.3MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. [2022-01-19 14:02:37,072 INFO L158 Benchmark]: TraceAbstraction took 822696.78ms. Allocated memory was 369.1MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 278.3MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 13.0GB. Max. memory is 16.0GB. [2022-01-19 14:02:37,074 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory is still 332.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 296.17ms. Allocated memory is still 369.1MB. Free memory was 314.8MB in the beginning and 338.1MB in the end (delta: -23.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.25ms. Allocated memory is still 369.1MB. Free memory was 338.1MB in the beginning and 334.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.52ms. Allocated memory is still 369.1MB. Free memory was 334.9MB in the beginning and 331.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 862.67ms. Allocated memory is still 369.1MB. Free memory was 331.8MB in the beginning and 278.3MB in the end (delta: 53.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.0GB. * TraceAbstraction took 822696.78ms. Allocated memory was 369.1MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 278.3MB in the beginning and 4.8GB in the end (delta: -4.5GB). Peak memory consumption was 13.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 206]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 286 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 22ms.. - TimeoutResultAtElement [Line: 199]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 286 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 22ms.. - TimeoutResultAtElement [Line: 197]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 286 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 22ms.. - TimeoutResultAtElement [Line: 198]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 286 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 22ms.. - TimeoutResultAtElement [Line: 196]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 286 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 1 for 22ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 372 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 822.5s, OverallIterations: 21, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 74.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6501 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6501 mSDsluCounter, 4375 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2277 IncrementalHoareTripleChecker+Unchecked, 5922 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5904 IncrementalHoareTripleChecker+Invalid, 8493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 484 mSDtfsCounter, 5904 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2119 GetRequests, 1848 SyntacticMatches, 5 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5374 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2251occurred in iteration=16, InterpolantAutomatonStates: 176, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 6245 NumberOfCodeBlocks, 6245 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 7027 ConstructedInterpolants, 228 QuantifiedInterpolants, 44026 SizeOfPredicates, 68 NumberOfNonLiveVariables, 2602 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 27 InterpolantComputations, 17 PerfectInterpolantSequences, 193/222 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown