./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longest-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/triangular-longest-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 14:57:54,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 14:57:54,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 14:57:54,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 14:57:54,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 14:57:54,714 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 14:57:54,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 14:57:54,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 14:57:54,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 14:57:54,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 14:57:54,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 14:57:54,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 14:57:54,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 14:57:54,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 14:57:54,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 14:57:54,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 14:57:54,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 14:57:54,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 14:57:54,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 14:57:54,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 14:57:54,755 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 14:57:54,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 14:57:54,757 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 14:57:54,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 14:57:54,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 14:57:54,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 14:57:54,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 14:57:54,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 14:57:54,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 14:57:54,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 14:57:54,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 14:57:54,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 14:57:54,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 14:57:54,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 14:57:54,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 14:57:54,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 14:57:54,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 14:57:54,767 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 14:57:54,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 14:57:54,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 14:57:54,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 14:57:54,769 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 14:57:54,795 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 14:57:54,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 14:57:54,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 14:57:54,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 14:57:54,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 14:57:54,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 14:57:54,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 14:57:54,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 14:57:54,800 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 14:57:54,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 14:57:54,801 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 14:57:54,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 14:57:54,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 14:57:54,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 14:57:54,801 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 14:57:54,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 14:57:54,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 14:57:54,802 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 14:57:54,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 14:57:54,802 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 14:57:54,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 14:57:54,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 14:57:54,802 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 14:57:54,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 14:57:54,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:57:54,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 14:57:54,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 14:57:54,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 14:57:54,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 14:57:54,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 14:57:54,804 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 14:57:54,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 14:57:54,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 14:57:54,804 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 14:57:54,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 874fb84f685baf0441a9bf8db1864605baa10908128545fe3028b9b499246108 [2021-12-21 14:57:55,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 14:57:55,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 14:57:55,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 14:57:55,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 14:57:55,113 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 14:57:55,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-2.i [2021-12-21 14:57:55,175 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876a9acf0/9be6202a872740d59621c7a3e445ead8/FLAGe540a93e5 [2021-12-21 14:57:55,652 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 14:57:55,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i [2021-12-21 14:57:55,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876a9acf0/9be6202a872740d59621c7a3e445ead8/FLAGe540a93e5 [2021-12-21 14:57:56,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876a9acf0/9be6202a872740d59621c7a3e445ead8 [2021-12-21 14:57:56,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 14:57:56,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 14:57:56,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 14:57:56,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 14:57:56,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 14:57:56,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6771b7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56, skipping insertion in model container [2021-12-21 14:57:56,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 14:57:56,291 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 14:57:56,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2021-12-21 14:57:56,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:57:56,673 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 14:57:56,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-2.i[30964,30977] [2021-12-21 14:57:56,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:57:56,782 INFO L208 MainTranslator]: Completed translation [2021-12-21 14:57:56,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56 WrapperNode [2021-12-21 14:57:56,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 14:57:56,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 14:57:56,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 14:57:56,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 14:57:56,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,864 INFO L137 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2021-12-21 14:57:56,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 14:57:56,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 14:57:56,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 14:57:56,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 14:57:56,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 14:57:56,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 14:57:56,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 14:57:56,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 14:57:56,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (1/1) ... [2021-12-21 14:57:56,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:57:56,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:57:56,933 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 14:57:56,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 14:57:56,980 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-12-21 14:57:56,980 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-12-21 14:57:56,980 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-12-21 14:57:56,980 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-12-21 14:57:56,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 14:57:56,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 14:57:56,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 14:57:56,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 14:57:56,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 14:57:56,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 14:57:56,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 14:57:56,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 14:57:56,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 14:57:56,982 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 14:57:57,087 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 14:57:57,089 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 14:57:57,210 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 14:57:57,218 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 14:57:57,219 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 14:57:57,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:57:57 BoogieIcfgContainer [2021-12-21 14:57:57,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 14:57:57,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 14:57:57,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 14:57:57,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 14:57:57,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:57:56" (1/3) ... [2021-12-21 14:57:57,232 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a04b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:57:57, skipping insertion in model container [2021-12-21 14:57:57,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:57:56" (2/3) ... [2021-12-21 14:57:57,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a04b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:57:57, skipping insertion in model container [2021-12-21 14:57:57,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:57:57" (3/3) ... [2021-12-21 14:57:57,234 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2021-12-21 14:57:57,241 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 14:57:57,241 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 14:57:57,241 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 14:57:57,242 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 14:57:57,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,293 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,299 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,300 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,300 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,300 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,300 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,301 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,301 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,301 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,301 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,303 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,303 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,304 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,311 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,312 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,313 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,313 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,314 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,314 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,314 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,314 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,314 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,315 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,318 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,319 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,320 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,330 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,330 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,330 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,331 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,331 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,334 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,351 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,351 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,352 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,352 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,354 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,357 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,357 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,358 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,358 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,358 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 14:57:57,359 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-21 14:57:57,439 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 14:57:57,450 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 14:57:57,450 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-21 14:57:57,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 150 flow [2021-12-21 14:57:57,517 INFO L129 PetriNetUnfolder]: 5/68 cut-off events. [2021-12-21 14:57:57,518 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 14:57:57,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 68 events. 5/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-12-21 14:57:57,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 70 transitions, 150 flow [2021-12-21 14:57:57,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 68 transitions, 142 flow [2021-12-21 14:57:57,573 INFO L129 PetriNetUnfolder]: 4/58 cut-off events. [2021-12-21 14:57:57,573 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-21 14:57:57,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:57:57,574 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] [2021-12-21 14:57:57,574 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:57:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:57:57,578 INFO L85 PathProgramCache]: Analyzing trace with hash 398220865, now seen corresponding path program 1 times [2021-12-21 14:57:57,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:57:57,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920556528] [2021-12-21 14:57:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:57:57,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:57:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:57:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:57:58,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:57:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920556528] [2021-12-21 14:57:58,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920556528] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:57:58,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:57:58,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 14:57:58,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975495779] [2021-12-21 14:57:58,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:57:58,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 14:57:58,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:57:58,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 14:57:58,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 14:57:58,047 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:57:58,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:57:58,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:57:58,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:57:58,219 INFO L129 PetriNetUnfolder]: 42/210 cut-off events. [2021-12-21 14:57:58,219 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-21 14:57:58,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 210 events. 42/210 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 816 event pairs, 3 based on Foata normal form. 46/240 useless extension candidates. Maximal degree in co-relation 257. Up to 28 conditions per place. [2021-12-21 14:57:58,224 INFO L132 encePairwiseOnDemand]: 59/70 looper letters, 22 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2021-12-21 14:57:58,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 271 flow [2021-12-21 14:57:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 14:57:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-21 14:57:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 613 transitions. [2021-12-21 14:57:58,251 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8757142857142857 [2021-12-21 14:57:58,252 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 613 transitions. [2021-12-21 14:57:58,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 613 transitions. [2021-12-21 14:57:58,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:57:58,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 613 transitions. [2021-12-21 14:57:58,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 61.3) internal successors, (613), 10 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,291 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,292 INFO L186 Difference]: Start difference. First operand has 70 places, 68 transitions, 142 flow. Second operand 10 states and 613 transitions. [2021-12-21 14:57:58,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 271 flow [2021-12-21 14:57:58,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-21 14:57:58,300 INFO L242 Difference]: Finished difference. Result has 85 places, 85 transitions, 276 flow [2021-12-21 14:57:58,302 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2021-12-21 14:57:58,304 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2021-12-21 14:57:58,304 INFO L470 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 276 flow [2021-12-21 14:57:58,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,305 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:57:58,305 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] [2021-12-21 14:57:58,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 14:57:58,305 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:57:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:57:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash 245149124, now seen corresponding path program 1 times [2021-12-21 14:57:58,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:57:58,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513261192] [2021-12-21 14:57:58,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:57:58,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:57:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:57:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:57:58,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:57:58,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513261192] [2021-12-21 14:57:58,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513261192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:57:58,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:57:58,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 14:57:58,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277280740] [2021-12-21 14:57:58,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:57:58,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 14:57:58,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:57:58,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 14:57:58,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 14:57:58,397 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:57:58,397 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:57:58,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:57:58,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:57:58,465 INFO L129 PetriNetUnfolder]: 46/217 cut-off events. [2021-12-21 14:57:58,465 INFO L130 PetriNetUnfolder]: For 109/112 co-relation queries the response was YES. [2021-12-21 14:57:58,466 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 217 events. 46/217 cut-off events. For 109/112 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 853 event pairs, 0 based on Foata normal form. 3/204 useless extension candidates. Maximal degree in co-relation 376. Up to 35 conditions per place. [2021-12-21 14:57:58,467 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 16 selfloop transitions, 9 changer transitions 40/110 dead transitions. [2021-12-21 14:57:58,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 508 flow [2021-12-21 14:57:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 14:57:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-21 14:57:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 475 transitions. [2021-12-21 14:57:58,468 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2021-12-21 14:57:58,469 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 475 transitions. [2021-12-21 14:57:58,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 475 transitions. [2021-12-21 14:57:58,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:57:58,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 475 transitions. [2021-12-21 14:57:58,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 59.375) internal successors, (475), 8 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,471 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,471 INFO L186 Difference]: Start difference. First operand has 85 places, 85 transitions, 276 flow. Second operand 8 states and 475 transitions. [2021-12-21 14:57:58,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 508 flow [2021-12-21 14:57:58,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 110 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-21 14:57:58,475 INFO L242 Difference]: Finished difference. Result has 96 places, 67 transitions, 237 flow [2021-12-21 14:57:58,475 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=237, PETRI_PLACES=96, PETRI_TRANSITIONS=67} [2021-12-21 14:57:58,476 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2021-12-21 14:57:58,476 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 67 transitions, 237 flow [2021-12-21 14:57:58,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,476 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:57:58,476 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] [2021-12-21 14:57:58,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 14:57:58,477 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:57:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:57:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1444168350, now seen corresponding path program 1 times [2021-12-21 14:57:58,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:57:58,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466026791] [2021-12-21 14:57:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:57:58,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:57:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:57:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:57:58,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:57:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466026791] [2021-12-21 14:57:58,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466026791] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:57:58,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:57:58,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 14:57:58,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203643993] [2021-12-21 14:57:58,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:57:58,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 14:57:58,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:57:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 14:57:58,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 14:57:58,545 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:57:58,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 67 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:57:58,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:57:58,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:57:58,648 INFO L129 PetriNetUnfolder]: 37/196 cut-off events. [2021-12-21 14:57:58,649 INFO L130 PetriNetUnfolder]: For 258/265 co-relation queries the response was YES. [2021-12-21 14:57:58,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 196 events. 37/196 cut-off events. For 258/265 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 651 event pairs, 0 based on Foata normal form. 10/188 useless extension candidates. Maximal degree in co-relation 362. Up to 35 conditions per place. [2021-12-21 14:57:58,651 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 23 selfloop transitions, 11 changer transitions 8/87 dead transitions. [2021-12-21 14:57:58,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 457 flow [2021-12-21 14:57:58,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 14:57:58,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 14:57:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 530 transitions. [2021-12-21 14:57:58,654 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8412698412698413 [2021-12-21 14:57:58,654 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 530 transitions. [2021-12-21 14:57:58,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 530 transitions. [2021-12-21 14:57:58,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:57:58,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 530 transitions. [2021-12-21 14:57:58,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.888888888888886) internal successors, (530), 9 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,657 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,658 INFO L186 Difference]: Start difference. First operand has 96 places, 67 transitions, 237 flow. Second operand 9 states and 530 transitions. [2021-12-21 14:57:58,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 457 flow [2021-12-21 14:57:58,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 387 flow, removed 25 selfloop flow, removed 9 redundant places. [2021-12-21 14:57:58,664 INFO L242 Difference]: Finished difference. Result has 86 places, 72 transitions, 289 flow [2021-12-21 14:57:58,664 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2021-12-21 14:57:58,666 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 16 predicate places. [2021-12-21 14:57:58,666 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 289 flow [2021-12-21 14:57:58,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,666 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:57:58,666 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] [2021-12-21 14:57:58,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 14:57:58,667 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:57:58,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:57:58,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1245653052, now seen corresponding path program 2 times [2021-12-21 14:57:58,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:57:58,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149837004] [2021-12-21 14:57:58,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:57:58,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:57:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:57:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:57:58,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:57:58,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149837004] [2021-12-21 14:57:58,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149837004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:57:58,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:57:58,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 14:57:58,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150894094] [2021-12-21 14:57:58,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:57:58,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 14:57:58,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:57:58,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 14:57:58,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 14:57:58,742 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:57:58,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:57:58,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:57:58,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:57:58,818 INFO L129 PetriNetUnfolder]: 30/185 cut-off events. [2021-12-21 14:57:58,818 INFO L130 PetriNetUnfolder]: For 246/265 co-relation queries the response was YES. [2021-12-21 14:57:58,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 185 events. 30/185 cut-off events. For 246/265 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 614 event pairs, 0 based on Foata normal form. 16/184 useless extension candidates. Maximal degree in co-relation 373. Up to 32 conditions per place. [2021-12-21 14:57:58,820 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 19 selfloop transitions, 12 changer transitions 11/87 dead transitions. [2021-12-21 14:57:58,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 487 flow [2021-12-21 14:57:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 14:57:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 14:57:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 524 transitions. [2021-12-21 14:57:58,821 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2021-12-21 14:57:58,821 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 524 transitions. [2021-12-21 14:57:58,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 524 transitions. [2021-12-21 14:57:58,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:57:58,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 524 transitions. [2021-12-21 14:57:58,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,824 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,825 INFO L186 Difference]: Start difference. First operand has 86 places, 72 transitions, 289 flow. Second operand 9 states and 524 transitions. [2021-12-21 14:57:58,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 487 flow [2021-12-21 14:57:58,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 467 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-12-21 14:57:58,828 INFO L242 Difference]: Finished difference. Result has 93 places, 73 transitions, 332 flow [2021-12-21 14:57:58,828 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2021-12-21 14:57:58,829 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 23 predicate places. [2021-12-21 14:57:58,829 INFO L470 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 332 flow [2021-12-21 14:57:58,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,829 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:57:58,829 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] [2021-12-21 14:57:58,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 14:57:58,830 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:57:58,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:57:58,830 INFO L85 PathProgramCache]: Analyzing trace with hash 704825237, now seen corresponding path program 1 times [2021-12-21 14:57:58,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:57:58,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371719215] [2021-12-21 14:57:58,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:57:58,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:57:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:57:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:57:58,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:57:58,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371719215] [2021-12-21 14:57:58,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371719215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:57:58,888 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:57:58,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 14:57:58,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648653079] [2021-12-21 14:57:58,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:57:58,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 14:57:58,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:57:58,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 14:57:58,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 14:57:58,890 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:57:58,890 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:58,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:57:58,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:57:58,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:57:59,053 INFO L129 PetriNetUnfolder]: 43/227 cut-off events. [2021-12-21 14:57:59,053 INFO L130 PetriNetUnfolder]: For 607/629 co-relation queries the response was YES. [2021-12-21 14:57:59,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 227 events. 43/227 cut-off events. For 607/629 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 792 event pairs, 1 based on Foata normal form. 15/221 useless extension candidates. Maximal degree in co-relation 528. Up to 50 conditions per place. [2021-12-21 14:57:59,055 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 23 selfloop transitions, 21 changer transitions 8/97 dead transitions. [2021-12-21 14:57:59,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 660 flow [2021-12-21 14:57:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 14:57:59,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 14:57:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2021-12-21 14:57:59,057 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2021-12-21 14:57:59,057 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 644 transitions. [2021-12-21 14:57:59,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 644 transitions. [2021-12-21 14:57:59,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:57:59,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 644 transitions. [2021-12-21 14:57:59,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.54545454545455) internal successors, (644), 11 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 70.0) internal successors, (840), 12 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,060 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 70.0) internal successors, (840), 12 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,061 INFO L186 Difference]: Start difference. First operand has 93 places, 73 transitions, 332 flow. Second operand 11 states and 644 transitions. [2021-12-21 14:57:59,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 660 flow [2021-12-21 14:57:59,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 544 flow, removed 45 selfloop flow, removed 10 redundant places. [2021-12-21 14:57:59,064 INFO L242 Difference]: Finished difference. Result has 97 places, 79 transitions, 417 flow [2021-12-21 14:57:59,064 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=417, PETRI_PLACES=97, PETRI_TRANSITIONS=79} [2021-12-21 14:57:59,065 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 27 predicate places. [2021-12-21 14:57:59,065 INFO L470 AbstractCegarLoop]: Abstraction has has 97 places, 79 transitions, 417 flow [2021-12-21 14:57:59,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,065 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:57:59,065 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] [2021-12-21 14:57:59,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 14:57:59,066 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:57:59,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:57:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1426423327, now seen corresponding path program 2 times [2021-12-21 14:57:59,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:57:59,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320795752] [2021-12-21 14:57:59,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:57:59,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:57:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:57:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:57:59,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:57:59,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320795752] [2021-12-21 14:57:59,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320795752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:57:59,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:57:59,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 14:57:59,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69922664] [2021-12-21 14:57:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:57:59,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 14:57:59,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:57:59,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 14:57:59,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 14:57:59,129 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:57:59,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 79 transitions, 417 flow. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:57:59,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:57:59,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:57:59,753 INFO L129 PetriNetUnfolder]: 38/219 cut-off events. [2021-12-21 14:57:59,755 INFO L130 PetriNetUnfolder]: For 828/871 co-relation queries the response was YES. [2021-12-21 14:57:59,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 219 events. 38/219 cut-off events. For 828/871 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 805 event pairs, 1 based on Foata normal form. 25/223 useless extension candidates. Maximal degree in co-relation 579. Up to 46 conditions per place. [2021-12-21 14:57:59,758 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 21 selfloop transitions, 23 changer transitions 11/100 dead transitions. [2021-12-21 14:57:59,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 791 flow [2021-12-21 14:57:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:57:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-12-21 14:57:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 696 transitions. [2021-12-21 14:57:59,761 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2021-12-21 14:57:59,761 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 696 transitions. [2021-12-21 14:57:59,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 696 transitions. [2021-12-21 14:57:59,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:57:59,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 696 transitions. [2021-12-21 14:57:59,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.0) internal successors, (696), 12 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 70.0) internal successors, (910), 13 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,767 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 70.0) internal successors, (910), 13 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,768 INFO L186 Difference]: Start difference. First operand has 97 places, 79 transitions, 417 flow. Second operand 12 states and 696 transitions. [2021-12-21 14:57:59,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 791 flow [2021-12-21 14:57:59,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 100 transitions, 733 flow, removed 20 selfloop flow, removed 5 redundant places. [2021-12-21 14:57:59,777 INFO L242 Difference]: Finished difference. Result has 106 places, 82 transitions, 505 flow [2021-12-21 14:57:59,777 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=505, PETRI_PLACES=106, PETRI_TRANSITIONS=82} [2021-12-21 14:57:59,779 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2021-12-21 14:57:59,795 INFO L470 AbstractCegarLoop]: Abstraction has has 106 places, 82 transitions, 505 flow [2021-12-21 14:57:59,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:57:59,796 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:57:59,796 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] [2021-12-21 14:57:59,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 14:57:59,797 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:57:59,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:57:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash 827405232, now seen corresponding path program 1 times [2021-12-21 14:57:59,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:57:59,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20429673] [2021-12-21 14:57:59,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:57:59,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:57:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:00,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:00,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20429673] [2021-12-21 14:58:00,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20429673] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:00,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231165468] [2021-12-21 14:58:00,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:00,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:00,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:00,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:00,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 14:58:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:00,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 14:58:00,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:00,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:00,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:00,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231165468] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:00,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:00,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2021-12-21 14:58:00,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508284569] [2021-12-21 14:58:00,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:00,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 14:58:00,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:00,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 14:58:00,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-21 14:58:00,861 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:00,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 82 transitions, 505 flow. Second operand has 13 states, 13 states have (on average 56.61538461538461) internal successors, (736), 13 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:00,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:00,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:00,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:01,090 INFO L129 PetriNetUnfolder]: 50/302 cut-off events. [2021-12-21 14:58:01,091 INFO L130 PetriNetUnfolder]: For 1595/1642 co-relation queries the response was YES. [2021-12-21 14:58:01,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 302 events. 50/302 cut-off events. For 1595/1642 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1067 event pairs, 0 based on Foata normal form. 29/300 useless extension candidates. Maximal degree in co-relation 868. Up to 62 conditions per place. [2021-12-21 14:58:01,094 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 35 selfloop transitions, 17 changer transitions 20/117 dead transitions. [2021-12-21 14:58:01,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1183 flow [2021-12-21 14:58:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 14:58:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-12-21 14:58:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1104 transitions. [2021-12-21 14:58:01,096 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8300751879699249 [2021-12-21 14:58:01,096 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1104 transitions. [2021-12-21 14:58:01,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1104 transitions. [2021-12-21 14:58:01,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:01,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1104 transitions. [2021-12-21 14:58:01,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 58.10526315789474) internal successors, (1104), 19 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:01,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 70.0) internal successors, (1400), 20 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:01,101 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 70.0) internal successors, (1400), 20 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:01,101 INFO L186 Difference]: Start difference. First operand has 106 places, 82 transitions, 505 flow. Second operand 19 states and 1104 transitions. [2021-12-21 14:58:01,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1183 flow [2021-12-21 14:58:01,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 117 transitions, 1094 flow, removed 27 selfloop flow, removed 9 redundant places. [2021-12-21 14:58:01,106 INFO L242 Difference]: Finished difference. Result has 125 places, 88 transitions, 628 flow [2021-12-21 14:58:01,107 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=628, PETRI_PLACES=125, PETRI_TRANSITIONS=88} [2021-12-21 14:58:01,107 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 55 predicate places. [2021-12-21 14:58:01,107 INFO L470 AbstractCegarLoop]: Abstraction has has 125 places, 88 transitions, 628 flow [2021-12-21 14:58:01,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 56.61538461538461) internal successors, (736), 13 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:01,108 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:01,108 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] [2021-12-21 14:58:01,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-21 14:58:01,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:01,323 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:01,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1816530946, now seen corresponding path program 2 times [2021-12-21 14:58:01,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:01,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77570620] [2021-12-21 14:58:01,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:01,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:01,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:01,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77570620] [2021-12-21 14:58:01,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77570620] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:01,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182123225] [2021-12-21 14:58:01,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 14:58:01,394 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:01,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:01,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 14:58:01,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 14:58:01,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 14:58:01,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 14:58:01,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:01,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:01,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182123225] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:01,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:01,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-12-21 14:58:01,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503594872] [2021-12-21 14:58:01,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:01,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 14:58:01,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 14:58:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-21 14:58:01,897 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:01,897 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 88 transitions, 628 flow. Second operand has 14 states, 14 states have (on average 56.714285714285715) internal successors, (794), 14 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:01,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:01,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:01,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:02,426 INFO L129 PetriNetUnfolder]: 70/430 cut-off events. [2021-12-21 14:58:02,427 INFO L130 PetriNetUnfolder]: For 5983/6065 co-relation queries the response was YES. [2021-12-21 14:58:02,429 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1713 conditions, 430 events. 70/430 cut-off events. For 5983/6065 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2129 event pairs, 0 based on Foata normal form. 30/418 useless extension candidates. Maximal degree in co-relation 1644. Up to 94 conditions per place. [2021-12-21 14:58:02,432 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 32 selfloop transitions, 43 changer transitions 23/143 dead transitions. [2021-12-21 14:58:02,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 143 transitions, 2111 flow [2021-12-21 14:58:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 14:58:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-12-21 14:58:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1564 transitions. [2021-12-21 14:58:02,458 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8275132275132275 [2021-12-21 14:58:02,458 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1564 transitions. [2021-12-21 14:58:02,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1564 transitions. [2021-12-21 14:58:02,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:02,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1564 transitions. [2021-12-21 14:58:02,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 57.925925925925924) internal successors, (1564), 27 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:02,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:02,467 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:02,467 INFO L186 Difference]: Start difference. First operand has 125 places, 88 transitions, 628 flow. Second operand 27 states and 1564 transitions. [2021-12-21 14:58:02,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 143 transitions, 2111 flow [2021-12-21 14:58:02,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 143 transitions, 1735 flow, removed 177 selfloop flow, removed 12 redundant places. [2021-12-21 14:58:02,483 INFO L242 Difference]: Finished difference. Result has 151 places, 108 transitions, 1053 flow [2021-12-21 14:58:02,483 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1053, PETRI_PLACES=151, PETRI_TRANSITIONS=108} [2021-12-21 14:58:02,484 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 81 predicate places. [2021-12-21 14:58:02,484 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 108 transitions, 1053 flow [2021-12-21 14:58:02,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 56.714285714285715) internal successors, (794), 14 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:02,485 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:02,485 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] [2021-12-21 14:58:02,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-21 14:58:02,719 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,SelfDestructingSolverStorable7 [2021-12-21 14:58:02,719 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:02,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:02,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2100588598, now seen corresponding path program 1 times [2021-12-21 14:58:02,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:02,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923326137] [2021-12-21 14:58:02,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:02,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:02,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923326137] [2021-12-21 14:58:02,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923326137] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:02,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309429476] [2021-12-21 14:58:02,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:02,797 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:02,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:02,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:02,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 14:58:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:02,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 14:58:02,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:02,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:03,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:03,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309429476] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:03,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:03,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2021-12-21 14:58:03,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446982717] [2021-12-21 14:58:03,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:03,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 14:58:03,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 14:58:03,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-12-21 14:58:03,198 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:03,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 108 transitions, 1053 flow. Second operand has 15 states, 15 states have (on average 56.53333333333333) internal successors, (848), 15 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:03,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:03,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:03,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:03,494 INFO L129 PetriNetUnfolder]: 99/635 cut-off events. [2021-12-21 14:58:03,494 INFO L130 PetriNetUnfolder]: For 17396/17503 co-relation queries the response was YES. [2021-12-21 14:58:03,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 635 events. 99/635 cut-off events. For 17396/17503 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3769 event pairs, 1 based on Foata normal form. 38/609 useless extension candidates. Maximal degree in co-relation 3131. Up to 140 conditions per place. [2021-12-21 14:58:03,501 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 42 selfloop transitions, 59 changer transitions 20/166 dead transitions. [2021-12-21 14:58:03,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 3308 flow [2021-12-21 14:58:03,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-21 14:58:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-12-21 14:58:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1509 transitions. [2021-12-21 14:58:03,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8291208791208792 [2021-12-21 14:58:03,506 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1509 transitions. [2021-12-21 14:58:03,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1509 transitions. [2021-12-21 14:58:03,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:03,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1509 transitions. [2021-12-21 14:58:03,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 58.03846153846154) internal successors, (1509), 26 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:03,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 70.0) internal successors, (1890), 27 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:03,514 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 70.0) internal successors, (1890), 27 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:03,514 INFO L186 Difference]: Start difference. First operand has 151 places, 108 transitions, 1053 flow. Second operand 26 states and 1509 transitions. [2021-12-21 14:58:03,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 3308 flow [2021-12-21 14:58:03,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 166 transitions, 2734 flow, removed 280 selfloop flow, removed 11 redundant places. [2021-12-21 14:58:03,537 INFO L242 Difference]: Finished difference. Result has 172 places, 124 transitions, 1475 flow [2021-12-21 14:58:03,537 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1475, PETRI_PLACES=172, PETRI_TRANSITIONS=124} [2021-12-21 14:58:03,538 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 102 predicate places. [2021-12-21 14:58:03,538 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 124 transitions, 1475 flow [2021-12-21 14:58:03,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 56.53333333333333) internal successors, (848), 15 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:03,539 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:03,539 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] [2021-12-21 14:58:03,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 14:58:03,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:03,756 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 139077154, now seen corresponding path program 2 times [2021-12-21 14:58:03,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:03,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418317875] [2021-12-21 14:58:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:03,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:03,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:03,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418317875] [2021-12-21 14:58:03,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418317875] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:03,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329442724] [2021-12-21 14:58:03,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 14:58:03,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:03,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:03,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:03,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 14:58:03,920 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 14:58:03,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 14:58:03,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 14:58:03,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:04,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:04,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:04,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329442724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:04,158 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:04,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2021-12-21 14:58:04,158 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544200871] [2021-12-21 14:58:04,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:04,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-21 14:58:04,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:04,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-21 14:58:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-21 14:58:04,160 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:04,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 124 transitions, 1475 flow. Second operand has 16 states, 16 states have (on average 56.5) internal successors, (904), 16 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:04,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:04,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:04,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:04,530 INFO L129 PetriNetUnfolder]: 106/672 cut-off events. [2021-12-21 14:58:04,530 INFO L130 PetriNetUnfolder]: For 27817/28030 co-relation queries the response was YES. [2021-12-21 14:58:04,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3905 conditions, 672 events. 106/672 cut-off events. For 27817/28030 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4037 event pairs, 1 based on Foata normal form. 45/650 useless extension candidates. Maximal degree in co-relation 3815. Up to 152 conditions per place. [2021-12-21 14:58:04,537 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 36 selfloop transitions, 81 changer transitions 25/187 dead transitions. [2021-12-21 14:58:04,537 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 4401 flow [2021-12-21 14:58:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 14:58:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-12-21 14:58:04,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1564 transitions. [2021-12-21 14:58:04,539 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8275132275132275 [2021-12-21 14:58:04,539 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1564 transitions. [2021-12-21 14:58:04,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1564 transitions. [2021-12-21 14:58:04,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:04,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1564 transitions. [2021-12-21 14:58:04,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 57.925925925925924) internal successors, (1564), 27 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:04,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:04,545 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 70.0) internal successors, (1960), 28 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:04,545 INFO L186 Difference]: Start difference. First operand has 172 places, 124 transitions, 1475 flow. Second operand 27 states and 1564 transitions. [2021-12-21 14:58:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 4401 flow [2021-12-21 14:58:04,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 187 transitions, 3249 flow, removed 540 selfloop flow, removed 22 redundant places. [2021-12-21 14:58:04,573 INFO L242 Difference]: Finished difference. Result has 186 places, 143 transitions, 1907 flow [2021-12-21 14:58:04,573 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1907, PETRI_PLACES=186, PETRI_TRANSITIONS=143} [2021-12-21 14:58:04,573 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 116 predicate places. [2021-12-21 14:58:04,574 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 143 transitions, 1907 flow [2021-12-21 14:58:04,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 56.5) internal successors, (904), 16 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:04,574 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:04,574 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:58:04,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 14:58:04,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:04,801 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1699425060, now seen corresponding path program 3 times [2021-12-21 14:58:04,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:04,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088595753] [2021-12-21 14:58:04,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:04,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:04,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:04,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088595753] [2021-12-21 14:58:04,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088595753] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:04,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819986899] [2021-12-21 14:58:04,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 14:58:04,937 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:04,956 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) [2021-12-21 14:58:04,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 14:58:05,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-21 14:58:05,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 14:58:05,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 14:58:05,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:05,170 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:05,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:05,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819986899] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:05,392 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:05,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2021-12-21 14:58:05,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73673132] [2021-12-21 14:58:05,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:05,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 14:58:05,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 14:58:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2021-12-21 14:58:05,394 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:05,395 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 143 transitions, 1907 flow. Second operand has 24 states, 24 states have (on average 56.375) internal successors, (1353), 24 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:05,396 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:05,396 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:05,396 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:06,281 INFO L129 PetriNetUnfolder]: 145/918 cut-off events. [2021-12-21 14:58:06,281 INFO L130 PetriNetUnfolder]: For 36320/36461 co-relation queries the response was YES. [2021-12-21 14:58:06,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 918 events. 145/918 cut-off events. For 36320/36461 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5423 event pairs, 0 based on Foata normal form. 41/866 useless extension candidates. Maximal degree in co-relation 5246. Up to 196 conditions per place. [2021-12-21 14:58:06,292 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 48 selfloop transitions, 120 changer transitions 29/242 dead transitions. [2021-12-21 14:58:06,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 242 transitions, 6499 flow [2021-12-21 14:58:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-12-21 14:58:06,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2021-12-21 14:58:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2720 transitions. [2021-12-21 14:58:06,296 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8267477203647416 [2021-12-21 14:58:06,296 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 2720 transitions. [2021-12-21 14:58:06,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 2720 transitions. [2021-12-21 14:58:06,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:06,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 2720 transitions. [2021-12-21 14:58:06,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 57.87234042553192) internal successors, (2720), 47 states have internal predecessors, (2720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:06,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 70.0) internal successors, (3360), 48 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:06,304 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 70.0) internal successors, (3360), 48 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:06,304 INFO L186 Difference]: Start difference. First operand has 186 places, 143 transitions, 1907 flow. Second operand 47 states and 2720 transitions. [2021-12-21 14:58:06,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 242 transitions, 6499 flow [2021-12-21 14:58:06,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 242 transitions, 5536 flow, removed 447 selfloop flow, removed 20 redundant places. [2021-12-21 14:58:06,344 INFO L242 Difference]: Finished difference. Result has 233 places, 180 transitions, 3004 flow [2021-12-21 14:58:06,345 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3004, PETRI_PLACES=233, PETRI_TRANSITIONS=180} [2021-12-21 14:58:06,345 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 163 predicate places. [2021-12-21 14:58:06,345 INFO L470 AbstractCegarLoop]: Abstraction has has 233 places, 180 transitions, 3004 flow [2021-12-21 14:58:06,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 56.375) internal successors, (1353), 24 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:06,346 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:06,346 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:58:06,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 14:58:06,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-21 14:58:06,563 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:06,563 INFO L85 PathProgramCache]: Analyzing trace with hash 736772455, now seen corresponding path program 4 times [2021-12-21 14:58:06,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:06,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382695863] [2021-12-21 14:58:06,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:06,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:06,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:06,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382695863] [2021-12-21 14:58:06,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382695863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:06,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183126948] [2021-12-21 14:58:06,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 14:58:06,772 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:06,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:06,773 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:06,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 14:58:06,863 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 14:58:06,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 14:58:06,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 14:58:06,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:07,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:07,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183126948] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:07,760 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:07,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 35 [2021-12-21 14:58:07,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169154000] [2021-12-21 14:58:07,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:07,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-21 14:58:07,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-21 14:58:07,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=923, Unknown=0, NotChecked=0, Total=1190 [2021-12-21 14:58:07,763 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:07,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 180 transitions, 3004 flow. Second operand has 35 states, 35 states have (on average 56.2) internal successors, (1967), 35 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:07,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:07,764 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:07,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:08,820 INFO L129 PetriNetUnfolder]: 203/1348 cut-off events. [2021-12-21 14:58:08,820 INFO L130 PetriNetUnfolder]: For 111335/111640 co-relation queries the response was YES. [2021-12-21 14:58:08,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10256 conditions, 1348 events. 203/1348 cut-off events. For 111335/111640 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8044 event pairs, 1 based on Foata normal form. 43/1247 useless extension candidates. Maximal degree in co-relation 10144. Up to 298 conditions per place. [2021-12-21 14:58:08,837 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 106 selfloop transitions, 109 changer transitions 50/310 dead transitions. [2021-12-21 14:58:08,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 310 transitions, 11645 flow [2021-12-21 14:58:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-12-21 14:58:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-12-21 14:58:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 3233 transitions. [2021-12-21 14:58:08,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8247448979591837 [2021-12-21 14:58:08,841 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 3233 transitions. [2021-12-21 14:58:08,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 3233 transitions. [2021-12-21 14:58:08,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:08,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 3233 transitions. [2021-12-21 14:58:08,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 57.732142857142854) internal successors, (3233), 56 states have internal predecessors, (3233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:08,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 70.0) internal successors, (3990), 57 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:08,881 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 70.0) internal successors, (3990), 57 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:08,881 INFO L186 Difference]: Start difference. First operand has 233 places, 180 transitions, 3004 flow. Second operand 56 states and 3233 transitions. [2021-12-21 14:58:08,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 310 transitions, 11645 flow [2021-12-21 14:58:09,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 310 transitions, 9275 flow, removed 1160 selfloop flow, removed 23 redundant places. [2021-12-21 14:58:09,081 INFO L242 Difference]: Finished difference. Result has 288 places, 224 transitions, 4214 flow [2021-12-21 14:58:09,082 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=4214, PETRI_PLACES=288, PETRI_TRANSITIONS=224} [2021-12-21 14:58:09,082 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 218 predicate places. [2021-12-21 14:58:09,082 INFO L470 AbstractCegarLoop]: Abstraction has has 288 places, 224 transitions, 4214 flow [2021-12-21 14:58:09,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 56.2) internal successors, (1967), 35 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:09,084 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:09,084 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:58:09,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-21 14:58:09,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:09,304 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1777329741, now seen corresponding path program 5 times [2021-12-21 14:58:09,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:09,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253118293] [2021-12-21 14:58:09,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:09,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:09,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:09,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253118293] [2021-12-21 14:58:09,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253118293] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:09,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581622852] [2021-12-21 14:58:09,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 14:58:09,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:09,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:09,493 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:09,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 14:58:09,555 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-12-21 14:58:09,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 14:58:09,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-21 14:58:09,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:09,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:10,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581622852] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:10,362 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:10,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 36 [2021-12-21 14:58:10,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514218441] [2021-12-21 14:58:10,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:10,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-21 14:58:10,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:10,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-21 14:58:10,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2021-12-21 14:58:10,364 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:10,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 224 transitions, 4214 flow. Second operand has 36 states, 36 states have (on average 56.25) internal successors, (2025), 36 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:10,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:10,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:10,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:11,940 INFO L129 PetriNetUnfolder]: 262/1770 cut-off events. [2021-12-21 14:58:11,940 INFO L130 PetriNetUnfolder]: For 243126/243628 co-relation queries the response was YES. [2021-12-21 14:58:11,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15740 conditions, 1770 events. 262/1770 cut-off events. For 243126/243628 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 11606 event pairs, 0 based on Foata normal form. 43/1629 useless extension candidates. Maximal degree in co-relation 15608. Up to 406 conditions per place. [2021-12-21 14:58:11,967 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 72 selfloop transitions, 213 changer transitions 50/380 dead transitions. [2021-12-21 14:58:11,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 380 transitions, 15876 flow [2021-12-21 14:58:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-12-21 14:58:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-12-21 14:58:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 3814 transitions. [2021-12-21 14:58:11,972 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8255411255411256 [2021-12-21 14:58:11,972 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 3814 transitions. [2021-12-21 14:58:11,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 3814 transitions. [2021-12-21 14:58:11,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:11,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 3814 transitions. [2021-12-21 14:58:11,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 57.78787878787879) internal successors, (3814), 66 states have internal predecessors, (3814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:11,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 70.0) internal successors, (4690), 67 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:11,982 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 70.0) internal successors, (4690), 67 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:11,982 INFO L186 Difference]: Start difference. First operand has 288 places, 224 transitions, 4214 flow. Second operand 66 states and 3814 transitions. [2021-12-21 14:58:11,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 380 transitions, 15876 flow [2021-12-21 14:58:12,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 380 transitions, 13348 flow, removed 1227 selfloop flow, removed 30 redundant places. [2021-12-21 14:58:12,234 INFO L242 Difference]: Finished difference. Result has 345 places, 285 transitions, 6241 flow [2021-12-21 14:58:12,235 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=3366, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=6241, PETRI_PLACES=345, PETRI_TRANSITIONS=285} [2021-12-21 14:58:12,235 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 275 predicate places. [2021-12-21 14:58:12,235 INFO L470 AbstractCegarLoop]: Abstraction has has 345 places, 285 transitions, 6241 flow [2021-12-21 14:58:12,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 56.25) internal successors, (2025), 36 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:12,237 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:12,237 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:58:12,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-21 14:58:12,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:12,454 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:12,454 INFO L85 PathProgramCache]: Analyzing trace with hash -408255069, now seen corresponding path program 6 times [2021-12-21 14:58:12,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:12,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337552575] [2021-12-21 14:58:12,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:12,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:12,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:12,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337552575] [2021-12-21 14:58:12,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337552575] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:12,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337094180] [2021-12-21 14:58:12,639 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 14:58:12,639 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:12,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:12,644 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:12,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 14:58:12,708 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-12-21 14:58:12,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 14:58:12,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-21 14:58:12,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:12,917 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:12,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:13,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337094180] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:13,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:13,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 35 [2021-12-21 14:58:13,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200457216] [2021-12-21 14:58:13,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:13,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-21 14:58:13,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:13,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-21 14:58:13,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=917, Unknown=0, NotChecked=0, Total=1190 [2021-12-21 14:58:13,300 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:13,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 285 transitions, 6241 flow. Second operand has 35 states, 35 states have (on average 56.22857142857143) internal successors, (1968), 35 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:13,301 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:13,301 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:13,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:15,570 INFO L129 PetriNetUnfolder]: 320/2100 cut-off events. [2021-12-21 14:58:15,570 INFO L130 PetriNetUnfolder]: For 426184/427259 co-relation queries the response was YES. [2021-12-21 14:58:15,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22517 conditions, 2100 events. 320/2100 cut-off events. For 426184/427259 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13952 event pairs, 1 based on Foata normal form. 54/1938 useless extension candidates. Maximal degree in co-relation 22362. Up to 490 conditions per place. [2021-12-21 14:58:15,610 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 79 selfloop transitions, 277 changer transitions 53/454 dead transitions. [2021-12-21 14:58:15,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 454 transitions, 23682 flow [2021-12-21 14:58:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-12-21 14:58:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-12-21 14:58:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 4570 transitions. [2021-12-21 14:58:15,620 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8264014466546112 [2021-12-21 14:58:15,620 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 4570 transitions. [2021-12-21 14:58:15,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 4570 transitions. [2021-12-21 14:58:15,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:15,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 4570 transitions. [2021-12-21 14:58:15,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 57.848101265822784) internal successors, (4570), 79 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:15,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 70.0) internal successors, (5600), 80 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:15,637 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 70.0) internal successors, (5600), 80 states have internal predecessors, (5600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:15,637 INFO L186 Difference]: Start difference. First operand has 345 places, 285 transitions, 6241 flow. Second operand 79 states and 4570 transitions. [2021-12-21 14:58:15,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 454 transitions, 23682 flow [2021-12-21 14:58:16,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 454 transitions, 19694 flow, removed 1907 selfloop flow, removed 37 redundant places. [2021-12-21 14:58:16,060 INFO L242 Difference]: Finished difference. Result has 419 places, 341 transitions, 8978 flow [2021-12-21 14:58:16,061 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=4743, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=79, PETRI_FLOW=8978, PETRI_PLACES=419, PETRI_TRANSITIONS=341} [2021-12-21 14:58:16,061 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 349 predicate places. [2021-12-21 14:58:16,061 INFO L470 AbstractCegarLoop]: Abstraction has has 419 places, 341 transitions, 8978 flow [2021-12-21 14:58:16,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 56.22857142857143) internal successors, (1968), 35 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:16,062 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:16,062 INFO L254 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:58:16,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-21 14:58:16,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-21 14:58:16,275 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:16,276 INFO L85 PathProgramCache]: Analyzing trace with hash -744878844, now seen corresponding path program 7 times [2021-12-21 14:58:16,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:16,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002865798] [2021-12-21 14:58:16,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:16,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:16,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:58:16,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002865798] [2021-12-21 14:58:16,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002865798] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 14:58:16,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701380029] [2021-12-21 14:58:16,630 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-21 14:58:16,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 14:58:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:58:16,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 14:58:16,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 14:58:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:58:16,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-21 14:58:16,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 14:58:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:17,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 14:58:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 832 backedges. 0 proven. 832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:58:17,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701380029] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 14:58:17,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 14:58:17,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 50 [2021-12-21 14:58:17,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645099265] [2021-12-21 14:58:17,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 14:58:17,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-21 14:58:17,687 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:58:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-21 14:58:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1898, Unknown=0, NotChecked=0, Total=2450 [2021-12-21 14:58:17,690 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2021-12-21 14:58:17,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 341 transitions, 8978 flow. Second operand has 50 states, 50 states have (on average 56.2) internal successors, (2810), 50 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:17,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 14:58:17,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2021-12-21 14:58:17,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 14:58:20,989 INFO L129 PetriNetUnfolder]: 423/2913 cut-off events. [2021-12-21 14:58:20,996 INFO L130 PetriNetUnfolder]: For 946950/947347 co-relation queries the response was YES. [2021-12-21 14:58:21,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36049 conditions, 2913 events. 423/2913 cut-off events. For 946950/947347 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 19529 event pairs, 0 based on Foata normal form. 50/2657 useless extension candidates. Maximal degree in co-relation 35862. Up to 640 conditions per place. [2021-12-21 14:58:21,062 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 104 selfloop transitions, 386 changer transitions 47/582 dead transitions. [2021-12-21 14:58:21,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 582 transitions, 36059 flow [2021-12-21 14:58:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2021-12-21 14:58:21,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2021-12-21 14:58:21,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 6064 transitions. [2021-12-21 14:58:21,067 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8250340136054422 [2021-12-21 14:58:21,067 INFO L72 ComplementDD]: Start complementDD. Operand 105 states and 6064 transitions. [2021-12-21 14:58:21,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 6064 transitions. [2021-12-21 14:58:21,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 14:58:21,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 6064 transitions. [2021-12-21 14:58:21,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 106 states, 105 states have (on average 57.75238095238095) internal successors, (6064), 105 states have internal predecessors, (6064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:21,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 106 states, 106 states have (on average 70.0) internal successors, (7420), 106 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:21,081 INFO L81 ComplementDD]: Finished complementDD. Result has 106 states, 106 states have (on average 70.0) internal successors, (7420), 106 states have internal predecessors, (7420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:21,081 INFO L186 Difference]: Start difference. First operand has 419 places, 341 transitions, 8978 flow. Second operand 105 states and 6064 transitions. [2021-12-21 14:58:21,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 582 transitions, 36059 flow [2021-12-21 14:58:22,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 582 transitions, 28444 flow, removed 3703 selfloop flow, removed 43 redundant places. [2021-12-21 14:58:22,389 INFO L242 Difference]: Finished difference. Result has 508 places, 448 transitions, 12107 flow [2021-12-21 14:58:22,390 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=6077, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=280, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=12107, PETRI_PLACES=508, PETRI_TRANSITIONS=448} [2021-12-21 14:58:22,390 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 438 predicate places. [2021-12-21 14:58:22,390 INFO L470 AbstractCegarLoop]: Abstraction has has 508 places, 448 transitions, 12107 flow [2021-12-21 14:58:22,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 56.2) internal successors, (2810), 50 states have internal predecessors, (2810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 14:58:22,391 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 14:58:22,391 INFO L254 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:58:22,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 14:58:22,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-21 14:58:22,608 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-21 14:58:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:58:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1956549026, now seen corresponding path program 8 times [2021-12-21 14:58:22,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:58:22,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543575730] [2021-12-21 14:58:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:58:22,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:58:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:58:22,642 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 14:58:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:58:22,731 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 14:58:22,731 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 14:58:22,732 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2021-12-21 14:58:22,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2021-12-21 14:58:22,733 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2021-12-21 14:58:22,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 14:58:22,736 INFO L732 BasicCegarLoop]: Path program histogram: [8, 2, 2, 2, 1, 1] [2021-12-21 14:58:22,739 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-21 14:58:22,739 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 14:58:22,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:58:22 BasicIcfg [2021-12-21 14:58:22,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 14:58:22,867 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 14:58:22,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 14:58:22,868 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 14:58:22,868 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:57:57" (3/4) ... [2021-12-21 14:58:22,869 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 14:58:22,951 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 14:58:22,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 14:58:22,951 INFO L158 Benchmark]: Toolchain (without parser) took 26754.56ms. Allocated memory was 88.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 47.0MB in the beginning and 818.2MB in the end (delta: -771.2MB). Peak memory consumption was 305.9MB. Max. memory is 16.1GB. [2021-12-21 14:58:22,952 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:58:22,952 INFO L158 Benchmark]: CACSL2BoogieTranslator took 585.03ms. Allocated memory is still 88.1MB. Free memory was 46.9MB in the beginning and 56.3MB in the end (delta: -9.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-12-21 14:58:22,952 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.42ms. Allocated memory is still 88.1MB. Free memory was 55.9MB in the beginning and 54.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 14:58:22,952 INFO L158 Benchmark]: Boogie Preprocessor took 35.49ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 52.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:58:22,953 INFO L158 Benchmark]: RCFGBuilder took 319.14ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.9MB in the beginning and 78.1MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-21 14:58:22,953 INFO L158 Benchmark]: TraceAbstraction took 25638.66ms. Allocated memory was 107.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 77.4MB in the beginning and 859.1MB in the end (delta: -781.7MB). Peak memory consumption was 522.2MB. Max. memory is 16.1GB. [2021-12-21 14:58:22,953 INFO L158 Benchmark]: Witness Printer took 83.62ms. Allocated memory is still 1.2GB. Free memory was 859.1MB in the beginning and 818.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2021-12-21 14:58:22,954 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.21ms. Allocated memory is still 88.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 585.03ms. Allocated memory is still 88.1MB. Free memory was 46.9MB in the beginning and 56.3MB in the end (delta: -9.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.42ms. Allocated memory is still 88.1MB. Free memory was 55.9MB in the beginning and 54.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.49ms. Allocated memory is still 88.1MB. Free memory was 54.2MB in the beginning and 52.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.14ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.9MB in the beginning and 78.1MB in the end (delta: -25.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25638.66ms. Allocated memory was 107.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 77.4MB in the beginning and 859.1MB in the end (delta: -781.7MB). Peak memory consumption was 522.2MB. Max. memory is 16.1GB. * Witness Printer took 83.62ms. Allocated memory is still 1.2GB. Free memory was 859.1MB in the beginning and 818.2MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L694] 0 int i = 3, j = 6; VAL [i=3, j=6] [L712] 0 pthread_t id1, id2; VAL [\old(argc)=49, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=3, id1={5:0}, id2={3:0}, j=6, pthread_create(&id1, ((void *)0), t1, ((void *)0))=6] [L696] 1 int k = 0; VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, i=7, id1={5:0}, id2={3:0}, j=6, k=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=7] [L704] 2 int k = 0; VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, i=7, id1={5:0}, id2={3:0}, j=6, k=0, k=0] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=0] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=0] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=0] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=1] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=1] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=2] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=2, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=3] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=3] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=3, k=5] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=3] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=5, k=4] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=4] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=4] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=5] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=5] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=5, k=6] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=6] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=6] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=6, k=7] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=7] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=7] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=8] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=8] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=9] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=8, k=10] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=8] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=10] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=9] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=10] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=10] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=11] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=11] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=12] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=12, k=13] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=13] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=13, k=14] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=13, k=15] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=15, k=13] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=15, k=14] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=14, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=15] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=15] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=15] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=16] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=16] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=16] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=16] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=17] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=17] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=17, k=18] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=18] [L696] 1 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=18] [L696] COND TRUE 1 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=18] [L698] 1 i = j + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=18, k=19] [L704] 2 k++ VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(argc)=49, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=49, argv={51:50}, argv={51:50}, condI=0, condJ=1, i=45, id1={5:0}, id2={3:0}, j=46, k=19, k=19] - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 88 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.3s, OverallIterations: 16, TraceHistogramMax: 20, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1367 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1367 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 338 mSDsCounter, 1694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2409 IncrementalHoareTripleChecker+Invalid, 4103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1694 mSolverCounterUnsat, 67 mSDtfsCounter, 2409 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2093 GetRequests, 1422 SyntacticMatches, 3 SemanticMatches, 668 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17860 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12107occurred in iteration=15, InterpolantAutomatonStates: 511, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1985 NumberOfCodeBlocks, 1985 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2476 ConstructedInterpolants, 0 QuantifiedInterpolants, 8997 SizeOfPredicates, 101 NumberOfNonLiveVariables, 1744 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 1/4224 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 proved your program to be incorrect! [2021-12-21 14:58:22,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE