./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/systemc/token_ring.01.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 01:03:25,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 01:03:25,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 01:03:25,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 01:03:25,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 01:03:25,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 01:03:25,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 01:03:25,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 01:03:25,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 01:03:25,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 01:03:25,719 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 01:03:25,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 01:03:25,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 01:03:25,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 01:03:25,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 01:03:25,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 01:03:25,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 01:03:25,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 01:03:25,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 01:03:25,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 01:03:25,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 01:03:25,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 01:03:25,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 01:03:25,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 01:03:25,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 01:03:25,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 01:03:25,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 01:03:25,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 01:03:25,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 01:03:25,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 01:03:25,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 01:03:25,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 01:03:25,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 01:03:25,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 01:03:25,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 01:03:25,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 01:03:25,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 01:03:25,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 01:03:25,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 01:03:25,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 01:03:25,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 01:03:25,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 01:03:25,778 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 01:03:25,779 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 01:03:25,780 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 01:03:25,780 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 01:03:25,780 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 01:03:25,781 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 01:03:25,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 01:03:25,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 01:03:25,782 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 01:03:25,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 01:03:25,783 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 01:03:25,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 01:03:25,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 01:03:25,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 01:03:25,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 01:03:25,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 01:03:25,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 01:03:25,784 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 01:03:25,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 01:03:25,784 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 01:03:25,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 01:03:25,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 01:03:25,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 01:03:25,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 01:03:25,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:03:25,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 01:03:25,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 01:03:25,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 01:03:25,785 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 01:03:25,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 01:03:25,785 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 01:03:25,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 01:03:25,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 01:03:25,786 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2021-12-28 01:03:26,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 01:03:26,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 01:03:26,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 01:03:26,062 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 01:03:26,063 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 01:03:26,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-12-28 01:03:26,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94396a71/513d6b57e04c465a8dfb403218a4fd12/FLAGbd7a711df [2021-12-28 01:03:26,449 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 01:03:26,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-12-28 01:03:26,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94396a71/513d6b57e04c465a8dfb403218a4fd12/FLAGbd7a711df [2021-12-28 01:03:26,860 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a94396a71/513d6b57e04c465a8dfb403218a4fd12 [2021-12-28 01:03:26,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 01:03:26,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 01:03:26,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 01:03:26,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 01:03:26,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 01:03:26,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:03:26" (1/1) ... [2021-12-28 01:03:26,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a924b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:26, skipping insertion in model container [2021-12-28 01:03:26,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:03:26" (1/1) ... [2021-12-28 01:03:26,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 01:03:26,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 01:03:26,970 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/systemc/token_ring.01.cil-1.c[671,684] [2021-12-28 01:03:27,014 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:03:27,032 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 01:03:27,040 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/systemc/token_ring.01.cil-1.c[671,684] [2021-12-28 01:03:27,057 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 01:03:27,067 INFO L208 MainTranslator]: Completed translation [2021-12-28 01:03:27,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27 WrapperNode [2021-12-28 01:03:27,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 01:03:27,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 01:03:27,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 01:03:27,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 01:03:27,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,094 INFO L137 Inliner]: procedures = 30, calls = 34, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 215 [2021-12-28 01:03:27,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 01:03:27,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 01:03:27,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 01:03:27,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 01:03:27,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 01:03:27,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 01:03:27,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 01:03:27,126 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 01:03:27,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (1/1) ... [2021-12-28 01:03:27,131 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 01:03:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:27,150 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-28 01:03:27,179 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-28 01:03:27,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 01:03:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2021-12-28 01:03:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2021-12-28 01:03:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2021-12-28 01:03:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2021-12-28 01:03:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-28 01:03:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-28 01:03:27,190 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2021-12-28 01:03:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2021-12-28 01:03:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2021-12-28 01:03:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2021-12-28 01:03:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 01:03:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2021-12-28 01:03:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2021-12-28 01:03:27,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 01:03:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 01:03:27,237 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 01:03:27,238 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 01:03:27,510 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 01:03:27,516 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 01:03:27,516 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-28 01:03:27,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:03:27 BoogieIcfgContainer [2021-12-28 01:03:27,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 01:03:27,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 01:03:27,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 01:03:27,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 01:03:27,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:03:26" (1/3) ... [2021-12-28 01:03:27,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1416dfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:03:27, skipping insertion in model container [2021-12-28 01:03:27,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:03:27" (2/3) ... [2021-12-28 01:03:27,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1416dfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:03:27, skipping insertion in model container [2021-12-28 01:03:27,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:03:27" (3/3) ... [2021-12-28 01:03:27,531 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-12-28 01:03:27,535 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 01:03:27,535 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 01:03:27,577 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 01:03:27,583 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-28 01:03:27,584 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 01:03:27,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-28 01:03:27,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 01:03:27,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:27,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:27,616 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1624964503, now seen corresponding path program 1 times [2021-12-28 01:03:27,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:27,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679475768] [2021-12-28 01:03:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:27,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:27,904 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-28 01:03:27,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:27,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679475768] [2021-12-28 01:03:27,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679475768] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:27,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:27,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:03:27,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313724562] [2021-12-28 01:03:27,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:27,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:03:27,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:27,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:03:27,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:03:27,928 INFO L87 Difference]: Start difference. First operand has 107 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 86 states have internal predecessors, (128), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:28,339 INFO L93 Difference]: Finished difference Result 339 states and 511 transitions. [2021-12-28 01:03:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:03:28,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2021-12-28 01:03:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:28,364 INFO L225 Difference]: With dead ends: 339 [2021-12-28 01:03:28,364 INFO L226 Difference]: Without dead ends: 233 [2021-12-28 01:03:28,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:03:28,369 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 293 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:28,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 448 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:03:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-28 01:03:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2021-12-28 01:03:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 155 states have internal predecessors, (219), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2021-12-28 01:03:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 272 transitions. [2021-12-28 01:03:28,409 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 272 transitions. Word has length 56 [2021-12-28 01:03:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:28,410 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 272 transitions. [2021-12-28 01:03:28,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 272 transitions. [2021-12-28 01:03:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 01:03:28,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:28,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:28,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 01:03:28,412 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 713012507, now seen corresponding path program 1 times [2021-12-28 01:03:28,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:28,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182972289] [2021-12-28 01:03:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:28,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:28,489 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-28 01:03:28,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:28,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182972289] [2021-12-28 01:03:28,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182972289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:28,490 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:28,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:03:28,490 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711555493] [2021-12-28 01:03:28,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:28,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:03:28,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:28,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:03:28,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:28,493 INFO L87 Difference]: Start difference. First operand 192 states and 272 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:28,961 INFO L93 Difference]: Finished difference Result 524 states and 746 transitions. [2021-12-28 01:03:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 01:03:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2021-12-28 01:03:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:28,964 INFO L225 Difference]: With dead ends: 524 [2021-12-28 01:03:28,964 INFO L226 Difference]: Without dead ends: 341 [2021-12-28 01:03:28,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-28 01:03:28,966 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:28,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 685 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:03:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-28 01:03:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 277. [2021-12-28 01:03:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 221 states have (on average 1.420814479638009) internal successors, (314), 224 states have internal predecessors, (314), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2021-12-28 01:03:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 389 transitions. [2021-12-28 01:03:28,993 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 389 transitions. Word has length 56 [2021-12-28 01:03:28,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:28,993 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 389 transitions. [2021-12-28 01:03:28,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:28,994 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 389 transitions. [2021-12-28 01:03:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 01:03:28,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:28,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:28,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 01:03:28,995 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1336375335, now seen corresponding path program 1 times [2021-12-28 01:03:28,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:28,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923172616] [2021-12-28 01:03:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:28,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,081 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-28 01:03:29,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:29,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923172616] [2021-12-28 01:03:29,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923172616] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:29,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:29,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:03:29,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329858147] [2021-12-28 01:03:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:29,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:03:29,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:03:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:29,083 INFO L87 Difference]: Start difference. First operand 277 states and 389 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:29,605 INFO L93 Difference]: Finished difference Result 860 states and 1213 transitions. [2021-12-28 01:03:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 01:03:29,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2021-12-28 01:03:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:29,608 INFO L225 Difference]: With dead ends: 860 [2021-12-28 01:03:29,608 INFO L226 Difference]: Without dead ends: 592 [2021-12-28 01:03:29,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-12-28 01:03:29,610 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 328 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:29,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 667 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 01:03:29,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-12-28 01:03:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 442. [2021-12-28 01:03:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4152542372881356) internal successors, (501), 359 states have internal predecessors, (501), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-28 01:03:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 620 transitions. [2021-12-28 01:03:29,639 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 620 transitions. Word has length 56 [2021-12-28 01:03:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:29,639 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 620 transitions. [2021-12-28 01:03:29,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:29,639 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 620 transitions. [2021-12-28 01:03:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 01:03:29,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:29,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:29,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 01:03:29,641 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2061198683, now seen corresponding path program 1 times [2021-12-28 01:03:29,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174112484] [2021-12-28 01:03:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:29,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,715 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-28 01:03:29,715 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:29,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174112484] [2021-12-28 01:03:29,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174112484] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:29,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:29,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 01:03:29,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774410310] [2021-12-28 01:03:29,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:29,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 01:03:29,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 01:03:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:29,719 INFO L87 Difference]: Start difference. First operand 442 states and 620 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:29,928 INFO L93 Difference]: Finished difference Result 961 states and 1363 transitions. [2021-12-28 01:03:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 01:03:29,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2021-12-28 01:03:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:29,932 INFO L225 Difference]: With dead ends: 961 [2021-12-28 01:03:29,932 INFO L226 Difference]: Without dead ends: 528 [2021-12-28 01:03:29,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:03:29,939 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 250 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:29,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 295 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:03:29,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2021-12-28 01:03:29,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 442. [2021-12-28 01:03:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 354 states have (on average 1.4011299435028248) internal successors, (496), 359 states have internal predecessors, (496), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2021-12-28 01:03:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 615 transitions. [2021-12-28 01:03:29,958 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 615 transitions. Word has length 56 [2021-12-28 01:03:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:29,958 INFO L470 AbstractCegarLoop]: Abstraction has 442 states and 615 transitions. [2021-12-28 01:03:29,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 615 transitions. [2021-12-28 01:03:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 01:03:29,960 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:29,960 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:29,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 01:03:29,960 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1985622119, now seen corresponding path program 1 times [2021-12-28 01:03:29,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:29,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093619185] [2021-12-28 01:03:29,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:29,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:29,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,037 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-28 01:03:30,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:30,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093619185] [2021-12-28 01:03:30,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093619185] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:30,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:30,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:03:30,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103466845] [2021-12-28 01:03:30,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:30,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:03:30,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:30,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:03:30,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:03:30,039 INFO L87 Difference]: Start difference. First operand 442 states and 615 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:30,415 INFO L93 Difference]: Finished difference Result 1435 states and 2006 transitions. [2021-12-28 01:03:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 01:03:30,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2021-12-28 01:03:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:30,420 INFO L225 Difference]: With dead ends: 1435 [2021-12-28 01:03:30,420 INFO L226 Difference]: Without dead ends: 1003 [2021-12-28 01:03:30,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-12-28 01:03:30,425 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 379 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:30,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 535 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:03:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-12-28 01:03:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 846. [2021-12-28 01:03:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 675 states have (on average 1.3733333333333333) internal successors, (927), 689 states have internal predecessors, (927), 102 states have call successors, (102), 60 states have call predecessors, (102), 68 states have return successors, (125), 100 states have call predecessors, (125), 102 states have call successors, (125) [2021-12-28 01:03:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1154 transitions. [2021-12-28 01:03:30,476 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1154 transitions. Word has length 56 [2021-12-28 01:03:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:30,476 INFO L470 AbstractCegarLoop]: Abstraction has 846 states and 1154 transitions. [2021-12-28 01:03:30,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 01:03:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1154 transitions. [2021-12-28 01:03:30,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-12-28 01:03:30,478 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:30,478 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:30,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 01:03:30,478 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash -34790867, now seen corresponding path program 1 times [2021-12-28 01:03:30,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:30,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184323631] [2021-12-28 01:03:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:30,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 01:03:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2021-12-28 01:03:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 01:03:30,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:30,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184323631] [2021-12-28 01:03:30,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184323631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:30,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708719449] [2021-12-28 01:03:30,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:30,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:30,572 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-28 01:03:30,600 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-28 01:03:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:30,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:03:30,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-28 01:03:30,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:30,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708719449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:30,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:30,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:30,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276279493] [2021-12-28 01:03:30,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:30,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:30,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:30,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:30,844 INFO L87 Difference]: Start difference. First operand 846 states and 1154 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:30,890 INFO L93 Difference]: Finished difference Result 2437 states and 3376 transitions. [2021-12-28 01:03:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:30,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 91 [2021-12-28 01:03:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:30,897 INFO L225 Difference]: With dead ends: 2437 [2021-12-28 01:03:30,897 INFO L226 Difference]: Without dead ends: 1602 [2021-12-28 01:03:30,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:30,901 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 113 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:30,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:30,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-12-28 01:03:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2021-12-28 01:03:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1280 states have (on average 1.36171875) internal successors, (1743), 1303 states have internal predecessors, (1743), 189 states have call successors, (189), 116 states have call predecessors, (189), 132 states have return successors, (260), 190 states have call predecessors, (260), 189 states have call successors, (260) [2021-12-28 01:03:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2192 transitions. [2021-12-28 01:03:30,979 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2192 transitions. Word has length 91 [2021-12-28 01:03:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:30,981 INFO L470 AbstractCegarLoop]: Abstraction has 1602 states and 2192 transitions. [2021-12-28 01:03:30,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2192 transitions. [2021-12-28 01:03:30,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-28 01:03:30,985 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:30,985 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:31,007 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-28 01:03:31,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 01:03:31,204 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:31,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1902655295, now seen corresponding path program 1 times [2021-12-28 01:03:31,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:31,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345682622] [2021-12-28 01:03:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:31,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 01:03:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 01:03:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 01:03:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 01:03:31,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:31,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345682622] [2021-12-28 01:03:31,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345682622] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089049287] [2021-12-28 01:03:31,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:31,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:31,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:31,304 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-28 01:03:31,305 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-28 01:03:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:31,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:03:31,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-28 01:03:31,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:31,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089049287] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:31,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:31,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2021-12-28 01:03:31,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118745563] [2021-12-28 01:03:31,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:31,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:31,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:31,580 INFO L87 Difference]: Start difference. First operand 1602 states and 2192 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 01:03:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:31,713 INFO L93 Difference]: Finished difference Result 4682 states and 6441 transitions. [2021-12-28 01:03:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 117 [2021-12-28 01:03:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:31,726 INFO L225 Difference]: With dead ends: 4682 [2021-12-28 01:03:31,726 INFO L226 Difference]: Without dead ends: 3094 [2021-12-28 01:03:31,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:31,731 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 68 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:31,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 277 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:31,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2021-12-28 01:03:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3052. [2021-12-28 01:03:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3052 states, 2440 states have (on average 1.353688524590164) internal successors, (3303), 2484 states have internal predecessors, (3303), 353 states have call successors, (353), 226 states have call predecessors, (353), 258 states have return successors, (476), 349 states have call predecessors, (476), 353 states have call successors, (476) [2021-12-28 01:03:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 4132 transitions. [2021-12-28 01:03:31,849 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 4132 transitions. Word has length 117 [2021-12-28 01:03:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:31,849 INFO L470 AbstractCegarLoop]: Abstraction has 3052 states and 4132 transitions. [2021-12-28 01:03:31,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2021-12-28 01:03:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 4132 transitions. [2021-12-28 01:03:31,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-28 01:03:31,855 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:31,855 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:31,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:32,059 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,SelfDestructingSolverStorable6 [2021-12-28 01:03:32,059 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash -844102889, now seen corresponding path program 1 times [2021-12-28 01:03:32,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:32,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135389191] [2021-12-28 01:03:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:32,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-12-28 01:03:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-28 01:03:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 01:03:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 01:03:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-28 01:03:32,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135389191] [2021-12-28 01:03:32,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135389191] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:32,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610030527] [2021-12-28 01:03:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:32,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:32,159 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-28 01:03:32,167 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-28 01:03:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:03:32,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-28 01:03:32,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:32,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610030527] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:32,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:32,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:32,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465691333] [2021-12-28 01:03:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:32,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:32,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:32,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:32,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:32,426 INFO L87 Difference]: Start difference. First operand 3052 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 01:03:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:32,519 INFO L93 Difference]: Finished difference Result 5716 states and 7745 transitions. [2021-12-28 01:03:32,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:32,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 133 [2021-12-28 01:03:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:32,560 INFO L225 Difference]: With dead ends: 5716 [2021-12-28 01:03:32,560 INFO L226 Difference]: Without dead ends: 3388 [2021-12-28 01:03:32,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:32,564 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 100 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:32,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 291 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2021-12-28 01:03:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3350. [2021-12-28 01:03:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 2706 states have (on average 1.3263118994826313) internal successors, (3589), 2750 states have internal predecessors, (3589), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2021-12-28 01:03:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4456 transitions. [2021-12-28 01:03:32,700 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4456 transitions. Word has length 133 [2021-12-28 01:03:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:32,700 INFO L470 AbstractCegarLoop]: Abstraction has 3350 states and 4456 transitions. [2021-12-28 01:03:32,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 01:03:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4456 transitions. [2021-12-28 01:03:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-28 01:03:32,706 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:32,706 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:32,725 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-28 01:03:32,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:32,920 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -797474129, now seen corresponding path program 1 times [2021-12-28 01:03:32,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:32,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234199784] [2021-12-28 01:03:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:32,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 01:03:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:33,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:33,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234199784] [2021-12-28 01:03:33,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234199784] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:33,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561027830] [2021-12-28 01:03:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:33,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:33,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:33,008 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-28 01:03:33,009 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-28 01:03:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 01:03:33,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 01:03:33,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:33,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561027830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:33,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:33,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:33,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769725935] [2021-12-28 01:03:33,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:33,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:33,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:33,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:33,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:33,241 INFO L87 Difference]: Start difference. First operand 3350 states and 4456 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 01:03:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:33,349 INFO L93 Difference]: Finished difference Result 5125 states and 6937 transitions. [2021-12-28 01:03:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:33,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 134 [2021-12-28 01:03:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:33,362 INFO L225 Difference]: With dead ends: 5125 [2021-12-28 01:03:33,362 INFO L226 Difference]: Without dead ends: 3376 [2021-12-28 01:03:33,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:33,367 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 98 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:33,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 373 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2021-12-28 01:03:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3334. [2021-12-28 01:03:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.3022304832713754) internal successors, (3503), 2734 states have internal predecessors, (3503), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (508), 355 states have call predecessors, (508), 359 states have call successors, (508) [2021-12-28 01:03:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4370 transitions. [2021-12-28 01:03:33,470 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4370 transitions. Word has length 134 [2021-12-28 01:03:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:33,471 INFO L470 AbstractCegarLoop]: Abstraction has 3334 states and 4370 transitions. [2021-12-28 01:03:33,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 01:03:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4370 transitions. [2021-12-28 01:03:33,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-28 01:03:33,493 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:33,494 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:33,512 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-28 01:03:33,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:33,703 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash -215256625, now seen corresponding path program 1 times [2021-12-28 01:03:33,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:33,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82194219] [2021-12-28 01:03:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:33,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2021-12-28 01:03:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:33,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:33,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82194219] [2021-12-28 01:03:33,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82194219] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:33,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401570051] [2021-12-28 01:03:33,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:33,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:33,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:33,792 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-28 01:03:33,793 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-28 01:03:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:33,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 01:03:33,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-28 01:03:34,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:34,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401570051] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:34,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:34,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2021-12-28 01:03:34,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969430098] [2021-12-28 01:03:34,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:34,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 01:03:34,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:34,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 01:03:34,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:34,001 INFO L87 Difference]: Start difference. First operand 3334 states and 4370 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 01:03:34,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:34,093 INFO L93 Difference]: Finished difference Result 6834 states and 9069 transitions. [2021-12-28 01:03:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 01:03:34,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2021-12-28 01:03:34,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:34,105 INFO L225 Difference]: With dead ends: 6834 [2021-12-28 01:03:34,105 INFO L226 Difference]: Without dead ends: 3516 [2021-12-28 01:03:34,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 01:03:34,114 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:34,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 166 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2021-12-28 01:03:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 3334. [2021-12-28 01:03:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 2690 states have (on average 1.262081784386617) internal successors, (3395), 2734 states have internal predecessors, (3395), 359 states have call successors, (359), 252 states have call predecessors, (359), 284 states have return successors, (482), 355 states have call predecessors, (482), 359 states have call successors, (482) [2021-12-28 01:03:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4236 transitions. [2021-12-28 01:03:34,235 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4236 transitions. Word has length 134 [2021-12-28 01:03:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:34,235 INFO L470 AbstractCegarLoop]: Abstraction has 3334 states and 4236 transitions. [2021-12-28 01:03:34,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 01:03:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4236 transitions. [2021-12-28 01:03:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:03:34,240 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:34,240 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:34,259 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-28 01:03:34,455 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,SelfDestructingSolverStorable9 [2021-12-28 01:03:34,456 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:34,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:34,456 INFO L85 PathProgramCache]: Analyzing trace with hash -564777140, now seen corresponding path program 1 times [2021-12-28 01:03:34,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:34,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084660620] [2021-12-28 01:03:34,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:34,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:34,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:34,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084660620] [2021-12-28 01:03:34,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084660620] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:34,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928808999] [2021-12-28 01:03:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:34,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:34,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:34,532 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-28 01:03:34,533 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-28 01:03:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:34,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:03:34,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 01:03:34,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:34,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928808999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:34,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:34,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-28 01:03:34,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870817959] [2021-12-28 01:03:34,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:34,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:34,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:34,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:34,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 01:03:34,805 INFO L87 Difference]: Start difference. First operand 3334 states and 4236 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:35,024 INFO L93 Difference]: Finished difference Result 4752 states and 6093 transitions. [2021-12-28 01:03:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 01:03:35,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2021-12-28 01:03:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:35,034 INFO L225 Difference]: With dead ends: 4752 [2021-12-28 01:03:35,034 INFO L226 Difference]: Without dead ends: 2682 [2021-12-28 01:03:35,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-28 01:03:35,039 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 137 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:35,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 257 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:03:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2021-12-28 01:03:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2658. [2021-12-28 01:03:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2658 states, 2142 states have (on average 1.2254901960784315) internal successors, (2625), 2168 states have internal predecessors, (2625), 295 states have call successors, (295), 204 states have call predecessors, (295), 220 states have return successors, (354), 289 states have call predecessors, (354), 295 states have call successors, (354) [2021-12-28 01:03:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 3274 transitions. [2021-12-28 01:03:35,182 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 3274 transitions. Word has length 135 [2021-12-28 01:03:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:35,182 INFO L470 AbstractCegarLoop]: Abstraction has 2658 states and 3274 transitions. [2021-12-28 01:03:35,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 3274 transitions. [2021-12-28 01:03:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:03:35,187 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:35,187 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:35,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 01:03:35,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:35,404 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:35,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:35,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1871919538, now seen corresponding path program 1 times [2021-12-28 01:03:35,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:35,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807764459] [2021-12-28 01:03:35,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:35,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:35,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807764459] [2021-12-28 01:03:35,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807764459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:35,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74311335] [2021-12-28 01:03:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:35,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:35,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:35,500 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-28 01:03:35,501 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-28 01:03:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:35,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 01:03:35,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-28 01:03:35,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:35,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74311335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:35,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:35,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2021-12-28 01:03:35,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379167426] [2021-12-28 01:03:35,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:35,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:35,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:35,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 01:03:35,752 INFO L87 Difference]: Start difference. First operand 2658 states and 3274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:35,928 INFO L93 Difference]: Finished difference Result 4962 states and 6189 transitions. [2021-12-28 01:03:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:03:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2021-12-28 01:03:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:35,937 INFO L225 Difference]: With dead ends: 4962 [2021-12-28 01:03:35,937 INFO L226 Difference]: Without dead ends: 2611 [2021-12-28 01:03:35,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-28 01:03:35,942 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 158 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:35,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 264 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 01:03:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2021-12-28 01:03:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1652. [2021-12-28 01:03:36,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1348 states have (on average 1.1802670623145401) internal successors, (1591), 1362 states have internal predecessors, (1591), 173 states have call successors, (173), 122 states have call predecessors, (173), 130 states have return successors, (203), 169 states have call predecessors, (203), 173 states have call successors, (203) [2021-12-28 01:03:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 1967 transitions. [2021-12-28 01:03:36,031 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 1967 transitions. Word has length 135 [2021-12-28 01:03:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:36,031 INFO L470 AbstractCegarLoop]: Abstraction has 1652 states and 1967 transitions. [2021-12-28 01:03:36,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 1967 transitions. [2021-12-28 01:03:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:03:36,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:36,034 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:36,052 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-28 01:03:36,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:36,247 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:36,248 INFO L85 PathProgramCache]: Analyzing trace with hash 25577228, now seen corresponding path program 1 times [2021-12-28 01:03:36,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:36,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549410760] [2021-12-28 01:03:36,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:36,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:36,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-12-28 01:03:36,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:36,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549410760] [2021-12-28 01:03:36,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549410760] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:36,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931175505] [2021-12-28 01:03:36,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:36,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:36,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:36,339 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-28 01:03:36,340 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-28 01:03:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:03:36,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-28 01:03:36,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:36,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931175505] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:36,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:36,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-28 01:03:36,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526578129] [2021-12-28 01:03:36,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:36,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:36,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:36,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:36,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:36,561 INFO L87 Difference]: Start difference. First operand 1652 states and 1967 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:36,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:36,643 INFO L93 Difference]: Finished difference Result 2779 states and 3331 transitions. [2021-12-28 01:03:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:03:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2021-12-28 01:03:36,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:36,646 INFO L225 Difference]: With dead ends: 2779 [2021-12-28 01:03:36,646 INFO L226 Difference]: Without dead ends: 1137 [2021-12-28 01:03:36,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 01:03:36,650 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 48 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:36,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 537 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:36,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-12-28 01:03:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1101. [2021-12-28 01:03:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 904 states have (on average 1.1537610619469028) internal successors, (1043), 914 states have internal predecessors, (1043), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-28 01:03:36,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1274 transitions. [2021-12-28 01:03:36,713 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1274 transitions. Word has length 135 [2021-12-28 01:03:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:36,713 INFO L470 AbstractCegarLoop]: Abstraction has 1101 states and 1274 transitions. [2021-12-28 01:03:36,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1274 transitions. [2021-12-28 01:03:36,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:03:36,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:36,714 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:36,733 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-28 01:03:36,931 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,SelfDestructingSolverStorable12 [2021-12-28 01:03:36,931 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:36,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 537608328, now seen corresponding path program 1 times [2021-12-28 01:03:36,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:36,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380150894] [2021-12-28 01:03:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:36,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:36,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,000 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-28 01:03:37,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:37,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380150894] [2021-12-28 01:03:37,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380150894] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 01:03:37,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145599982] [2021-12-28 01:03:37,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:37,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 01:03:37,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 01:03:37,002 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-28 01:03:37,003 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-28 01:03:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 01:03:37,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 01:03:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-12-28 01:03:37,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 01:03:37,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145599982] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:37,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 01:03:37,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2021-12-28 01:03:37,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478048616] [2021-12-28 01:03:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:37,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 01:03:37,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:37,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 01:03:37,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 01:03:37,195 INFO L87 Difference]: Start difference. First operand 1101 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:37,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:37,266 INFO L93 Difference]: Finished difference Result 2220 states and 2613 transitions. [2021-12-28 01:03:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 01:03:37,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 135 [2021-12-28 01:03:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:37,269 INFO L225 Difference]: With dead ends: 2220 [2021-12-28 01:03:37,269 INFO L226 Difference]: Without dead ends: 1129 [2021-12-28 01:03:37,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 01:03:37,271 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 10 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:37,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 523 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 01:03:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2021-12-28 01:03:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1113. [2021-12-28 01:03:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 916 states have (on average 1.1288209606986899) internal successors, (1034), 926 states have internal predecessors, (1034), 110 states have call successors, (110), 79 states have call predecessors, (110), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2021-12-28 01:03:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1265 transitions. [2021-12-28 01:03:37,319 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1265 transitions. Word has length 135 [2021-12-28 01:03:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:37,319 INFO L470 AbstractCegarLoop]: Abstraction has 1113 states and 1265 transitions. [2021-12-28 01:03:37,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 01:03:37,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1265 transitions. [2021-12-28 01:03:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-28 01:03:37,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:37,320 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:37,339 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-28 01:03:37,531 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,SelfDestructingSolverStorable13 [2021-12-28 01:03:37,531 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:37,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash -219686780, now seen corresponding path program 1 times [2021-12-28 01:03:37,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:37,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50594973] [2021-12-28 01:03:37,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:37,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:37,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:37,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-28 01:03:37,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:37,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50594973] [2021-12-28 01:03:37,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50594973] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:37,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:37,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:03:37,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915581863] [2021-12-28 01:03:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:37,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:03:37,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:03:37,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:03:37,642 INFO L87 Difference]: Start difference. First operand 1113 states and 1265 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 01:03:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:38,049 INFO L93 Difference]: Finished difference Result 2070 states and 2337 transitions. [2021-12-28 01:03:38,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 01:03:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 135 [2021-12-28 01:03:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:38,055 INFO L225 Difference]: With dead ends: 2070 [2021-12-28 01:03:38,055 INFO L226 Difference]: Without dead ends: 2068 [2021-12-28 01:03:38,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-12-28 01:03:38,056 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 470 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:38,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 474 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 01:03:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2021-12-28 01:03:38,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 1489. [2021-12-28 01:03:38,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1226 states have (on average 1.1305057096247961) internal successors, (1386), 1240 states have internal predecessors, (1386), 144 states have call successors, (144), 103 states have call predecessors, (144), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2021-12-28 01:03:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1693 transitions. [2021-12-28 01:03:38,134 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1693 transitions. Word has length 135 [2021-12-28 01:03:38,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:38,134 INFO L470 AbstractCegarLoop]: Abstraction has 1489 states and 1693 transitions. [2021-12-28 01:03:38,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2021-12-28 01:03:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1693 transitions. [2021-12-28 01:03:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-12-28 01:03:38,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 01:03:38,137 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:38,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 01:03:38,137 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 01:03:38,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 01:03:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1479334343, now seen corresponding path program 2 times [2021-12-28 01:03:38,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 01:03:38,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137126050] [2021-12-28 01:03:38,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 01:03:38,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 01:03:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 01:03:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 01:03:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 01:03:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-28 01:03:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 01:03:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 01:03:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 01:03:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 01:03:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-28 01:03:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 01:03:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 01:03:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2021-12-28 01:03:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 01:03:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-12-28 01:03:38,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 01:03:38,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137126050] [2021-12-28 01:03:38,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137126050] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 01:03:38,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 01:03:38,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 01:03:38,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869624922] [2021-12-28 01:03:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 01:03:38,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 01:03:38,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 01:03:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 01:03:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 01:03:38,205 INFO L87 Difference]: Start difference. First operand 1489 states and 1693 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 01:03:38,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 01:03:38,692 INFO L93 Difference]: Finished difference Result 3212 states and 3666 transitions. [2021-12-28 01:03:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 01:03:38,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 174 [2021-12-28 01:03:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 01:03:38,694 INFO L225 Difference]: With dead ends: 3212 [2021-12-28 01:03:38,694 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 01:03:38,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-28 01:03:38,697 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 582 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 01:03:38,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 418 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 01:03:38,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 01:03:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 01:03:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-28 01:03:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 01:03:38,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2021-12-28 01:03:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 01:03:38,699 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 01:03:38,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 01:03:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 01:03:38,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 01:03:38,701 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 01:03:38,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 01:03:38,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 01:03:50,236 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 133) no Hoare annotation was computed. [2021-12-28 01:03:50,236 INFO L854 garLoopResultBuilder]: At program point L155(lines 139 157) the Hoare annotation is: (let ((.cse20 (<= |activate_threads_is_transmit1_triggered_#res#1| 0)) (.cse22 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse23 (<= 0 |activate_threads_is_transmit1_triggered_#res#1|)) (.cse24 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse26 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse27 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse21 (<= |activate_threads_~tmp~1#1| 0)) (.cse28 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse9 (and .cse25 .cse26 .cse18 (<= 2 ~m_st~0) .cse27 .cse21 .cse28)) (.cse12 (not (= |old(~m_st~0)| 0))) (.cse14 (not (< ~local~0 ~token~0))) (.cse16 (not (<= ~token~0 (+ ~local~0 1)))) (.cse8 (not (<= 2 |old(~m_st~0)|))) (.cse10 (not (<= 2 ~E_1~0))) (.cse1 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse15 (not (<= 1 ~m_pc~0))) (.cse6 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse21 .cse28)) (.cse0 (not (<= 2 ~T1_E~0))) (.cse11 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse13 (and .cse25 .cse26 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21 .cse22 .cse28 .cse23 .cse24)) (.cse5 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse0 .cse1 .cse2 .cse9 .cse10) (or .cse8 .cse0 .cse11 .cse2 .cse4 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse14 .cse15 .cse12 .cse13 .cse10 .cse16) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and (= ~m_st~0 0) .cse20 .cse22 (not (= ~t1_st~0 0)) .cse23 .cse24) .cse8 .cse0 .cse1 .cse3 .cse14 .cse15 .cse10 .cse16) (or .cse8 .cse0 .cse11 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse4 .cse15 .cse13 .cse10 .cse7) (or .cse8 .cse0 .cse1 .cse3 .cse4 .cse15 .cse13 .cse10) (or .cse0 .cse1 .cse3 .cse4 .cse15 .cse5 .cse6 .cse7) (or .cse0 .cse11 .cse2 .cse4 .cse13 .cse5 .cse7)))) [2021-12-28 01:03:50,237 INFO L858 garLoopResultBuilder]: For program point L124-2(lines 124 133) no Hoare annotation was computed. [2021-12-28 01:03:50,237 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 152) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point L143-2(lines 143 152) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L854 garLoopResultBuilder]: At program point L135(lines 123 137) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse2 (not (<= ~t1_pc~0 0))) (.cse14 (= ~E_1~0 0)) (.cse11 (not (= ~token~0 ~local~0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse3 (not (= ~m_pc~0 0))) (.cse5 (and .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse10 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse13 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse9 .cse6) (or .cse0 .cse1 .cse7 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse6 .cse11) (or .cse1 .cse7 .cse8 .cse4 .cse12 .cse5 .cse10 .cse9 .cse6 .cse13) (or .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse14 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse11) (or .cse1 .cse7 .cse3 .cse8 .cse4 .cse5 .cse14 .cse11) (or .cse0 .cse1 .cse7 .cse8 .cse4 .cse5 .cse10 .cse6) (or .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (or .cse0 .cse1 (and .cse15 .cse16) .cse7 .cse8 .cse12 .cse10 .cse6 .cse13)))) [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point L327(lines 327 331) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point L327-2(lines 311 335) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 130) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point L319-2(lines 319 323) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L854 garLoopResultBuilder]: At program point L154(lines 142 156) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse19 (= ~m_st~0 |old(~m_st~0)|)) (.cse21 (<= |activate_threads_is_transmit1_triggered_~__retres1~1#1| 0)) (.cse22 (<= 0 |activate_threads_is_transmit1_triggered_~__retres1~1#1|)) (.cse23 (<= 0 |activate_threads_is_master_triggered_#res#1|)) (.cse24 (<= |activate_threads_is_master_triggered_#res#1| 0)) (.cse18 (< 0 (+ |activate_threads_~tmp~1#1| 1))) (.cse25 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|)) (.cse20 (<= |activate_threads_~tmp~1#1| 0)) (.cse26 (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0))) (let ((.cse16 (and .cse23 .cse24 .cse18 (<= 2 ~m_st~0) .cse25 .cse20 .cse26)) (.cse5 (not (< ~local~0 ~token~0))) (.cse9 (not (<= ~token~0 (+ ~local~0 1)))) (.cse7 (not (= |old(~m_st~0)| 0))) (.cse15 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse0 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse21 .cse26 .cse22)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse8 (not (<= 2 ~E_1~0))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (not (= ~t1_pc~0 1))) (.cse3 (= |old(~t1_st~0)| 0)) (.cse4 (not (<= 2 ~E_M~0))) (.cse6 (not (<= 1 ~m_pc~0))) (.cse11 (= ~E_1~0 0)) (.cse12 (and .cse23 .cse24 .cse17 .cse18 .cse19 .cse25 .cse20 .cse26)) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse12 .cse13) (or .cse0 .cse14 .cse1 .cse15 .cse4 .cse6 .cse8 .cse13) (or .cse14 .cse1 .cse2 .cse10 .cse16 .cse8) (or .cse14 .cse1 .cse15 .cse10 .cse4 .cse16 .cse8) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse14 .cse1 .cse2 .cse3 .cse5 .cse6 (and (= ~m_st~0 0) .cse21 (not (= ~t1_st~0 0)) .cse22) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse10 .cse3 .cse4 .cse7 .cse8) (or .cse0 .cse1 .cse15 .cse10 .cse4 .cse11 .cse13) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8) (or .cse0 .cse14 .cse1 .cse2 .cse4 .cse6 .cse8 .cse13) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse11 .cse12 .cse13)))) [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point L144(lines 144 149) no Hoare annotation was computed. [2021-12-28 01:03:50,238 INFO L854 garLoopResultBuilder]: At program point activate_threadsENTRY(lines 311 335) the Hoare annotation is: (let ((.cse13 (not (= |old(~m_st~0)| 0))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse10 (not (= ~m_pc~0 0))) (.cse4 (not (<= 2 ~E_M~0))) (.cse11 (= ~E_1~0 0)) (.cse7 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse8 (not (= ~t1_pc~0 1))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse12 (not (< ~local~0 ~token~0))) (.cse5 (not (<= 1 ~m_pc~0))) (.cse6 (not (<= 2 ~E_1~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse8 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse10 .cse6) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse5 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse11 .cse7) (or .cse1 .cse2 .cse8 .cse9 .cse4 .cse12 .cse5 .cse13 .cse6 .cse14) (or .cse1 .cse2 .cse8 .cse10 .cse9 .cse4 .cse13 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse6) (or .cse1 .cse2 .cse3 .cse10 .cse4 .cse11 .cse7) (or .cse0 .cse1 .cse2 .cse8 .cse9 .cse12 .cse5 .cse6 .cse14))) [2021-12-28 01:03:50,238 INFO L858 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 311 335) no Hoare annotation was computed. [2021-12-28 01:03:50,239 INFO L854 garLoopResultBuilder]: At program point L136(lines 120 138) the Hoare annotation is: (let ((.cse15 (= |old(~t1_st~0)| ~t1_st~0)) (.cse16 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse9 (not (= |old(~m_st~0)| 0))) (.cse4 (= ~E_1~0 0)) (.cse5 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~t1_pc~0 1))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse13 (not (< ~local~0 ~token~0))) (.cse12 (not (<= 1 ~m_pc~0))) (.cse14 (not (<= ~token~0 (+ ~local~0 1)))) (.cse11 (not (<= 2 |old(~m_st~0)|))) (.cse0 (not (<= 2 ~T1_E~0))) (.cse1 (not (<= ~t1_pc~0 0))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 ~E_M~0))) (.cse10 (not (<= 2 ~E_1~0))) (.cse6 (and (<= 0 |activate_threads_is_master_triggered_#res#1|) (<= |activate_threads_is_master_triggered_#res#1| 0) .cse15 .cse16 (<= 0 |activate_threads_is_master_triggered_~__retres1~0#1|) (<= |activate_threads_is_master_triggered_~__retres1~0#1| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse9 .cse10 .cse6) (or .cse11 .cse0 .cse1 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse13 .cse12 .cse9 .cse10 .cse14 .cse6) (or .cse11 .cse0 .cse7 .cse8 .cse3 .cse12 .cse10 .cse6) (or .cse11 .cse0 .cse7 .cse3 .cse12 .cse10 .cse5 .cse6) (or .cse0 .cse7 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse3 .cse12 .cse4 .cse5 .cse6) (or .cse11 .cse0 .cse7 .cse2 .cse10 .cse6) (or .cse11 .cse0 (and .cse15 .cse16) .cse7 .cse8 .cse13 .cse12 .cse10 .cse14) (or .cse11 .cse0 .cse1 .cse2 .cse3 .cse10 .cse6)))) [2021-12-28 01:03:50,239 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 336 346) no Hoare annotation was computed. [2021-12-28 01:03:50,239 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 336 346) the Hoare annotation is: (let ((.cse4 (not (= ~m_pc~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse9 (= ~E_1~0 0)) (.cse10 (not (= ~token~0 ~local~0))) (.cse0 (not (<= 2 |old(~m_st~0)|))) (.cse1 (not (<= 2 ~T1_E~0))) (.cse2 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse3 (not (= ~t1_pc~0 1))) (.cse6 (= |old(~t1_st~0)| 0)) (.cse8 (not (<= 1 ~m_pc~0))) (.cse5 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse9 .cse10) (or .cse1 .cse2 (not (<= ~t1_pc~0 0)) .cse4 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse6 (not (< ~local~0 ~token~0)) .cse8 .cse5 (not (<= ~token~0 (+ ~local~0 1)))))) [2021-12-28 01:03:50,239 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 336 346) no Hoare annotation was computed. [2021-12-28 01:03:50,239 INFO L858 garLoopResultBuilder]: For program point L192(lines 192 197) no Hoare annotation was computed. [2021-12-28 01:03:50,239 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 184 203) no Hoare annotation was computed. [2021-12-28 01:03:50,239 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 198) no Hoare annotation was computed. [2021-12-28 01:03:50,239 INFO L861 garLoopResultBuilder]: At program point exists_runnable_threadENTRY(lines 184 203) the Hoare annotation is: true [2021-12-28 01:03:50,240 INFO L861 garLoopResultBuilder]: At program point L200(lines 187 202) the Hoare annotation is: true [2021-12-28 01:03:50,240 INFO L858 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 184 203) no Hoare annotation was computed. [2021-12-28 01:03:50,240 INFO L854 garLoopResultBuilder]: At program point fire_delta_eventsENTRY(lines 255 282) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-28 01:03:50,240 INFO L858 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 255 282) no Hoare annotation was computed. [2021-12-28 01:03:50,240 INFO L858 garLoopResultBuilder]: For program point L274-1(lines 255 282) no Hoare annotation was computed. [2021-12-28 01:03:50,240 INFO L858 garLoopResultBuilder]: For program point L269-1(lines 258 281) no Hoare annotation was computed. [2021-12-28 01:03:50,240 INFO L858 garLoopResultBuilder]: For program point L264-1(lines 258 281) no Hoare annotation was computed. [2021-12-28 01:03:50,240 INFO L858 garLoopResultBuilder]: For program point L259-1(lines 258 281) no Hoare annotation was computed. [2021-12-28 01:03:50,241 INFO L858 garLoopResultBuilder]: For program point update_channelsEXIT(lines 158 165) no Hoare annotation was computed. [2021-12-28 01:03:50,241 INFO L861 garLoopResultBuilder]: At program point update_channelsFINAL(lines 158 165) the Hoare annotation is: true [2021-12-28 01:03:50,241 INFO L858 garLoopResultBuilder]: For program point L287-1(lines 286 309) no Hoare annotation was computed. [2021-12-28 01:03:50,241 INFO L854 garLoopResultBuilder]: At program point reset_delta_eventsENTRY(lines 283 310) the Hoare annotation is: (let ((.cse1 (not (<= ~t1_pc~0 0))) (.cse8 (not (= ~token~0 ~local~0))) (.cse7 (not (= ~m_st~0 0))) (.cse11 (= ~t1_st~0 0)) (.cse10 (not (<= 1 ~m_pc~0))) (.cse0 (not (<= 2 ~m_st~0))) (.cse9 (not (= ~t1_pc~0 1))) (.cse2 (not (= ~m_pc~0 0))) (.cse3 (not (<= 2 |old(~T1_E~0)|))) (.cse4 (not (<= 2 |old(~E_1~0)|))) (.cse5 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse6 (not (<= 2 |old(~E_M~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse3 .cse11 .cse4 .cse5 (not (< ~local~0 ~token~0)) .cse6 .cse10 .cse7 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse9 .cse2 .cse3 .cse11 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse9 .cse3 .cse11 .cse4 .cse5 .cse6 .cse10) (or .cse0 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-12-28 01:03:50,241 INFO L858 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 283 310) no Hoare annotation was computed. [2021-12-28 01:03:50,241 INFO L858 garLoopResultBuilder]: For program point L302-1(lines 283 310) no Hoare annotation was computed. [2021-12-28 01:03:50,241 INFO L858 garLoopResultBuilder]: For program point L297-1(lines 286 309) no Hoare annotation was computed. [2021-12-28 01:03:50,242 INFO L858 garLoopResultBuilder]: For program point L292-1(lines 286 309) no Hoare annotation was computed. [2021-12-28 01:03:50,242 INFO L861 garLoopResultBuilder]: At program point L481(lines 472 483) the Hoare annotation is: true [2021-12-28 01:03:50,242 INFO L854 garLoopResultBuilder]: At program point L234(lines 210 248) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,242 INFO L854 garLoopResultBuilder]: At program point L69-1(lines 43 82) the Hoare annotation is: (let ((.cse4 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (= ~m_pc~0 0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 (= ~token~0 ~local~0)) (and .cse4 .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse5) (and .cse4 .cse0 .cse1 .cse2 .cse3 .cse5))) [2021-12-28 01:03:50,242 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 01:03:50,242 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2021-12-28 01:03:50,242 INFO L861 garLoopResultBuilder]: At program point L466(lines 413 471) the Hoare annotation is: true [2021-12-28 01:03:50,242 INFO L854 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,243 INFO L858 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2021-12-28 01:03:50,243 INFO L854 garLoopResultBuilder]: At program point L21(lines 16 23) the Hoare annotation is: false [2021-12-28 01:03:50,243 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 174) no Hoare annotation was computed. [2021-12-28 01:03:50,243 INFO L858 garLoopResultBuilder]: For program point L170-2(lines 169 182) no Hoare annotation was computed. [2021-12-28 01:03:50,245 INFO L854 garLoopResultBuilder]: At program point L451(line 451) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,245 INFO L858 garLoopResultBuilder]: For program point L451-1(line 451) no Hoare annotation was computed. [2021-12-28 01:03:50,245 INFO L858 garLoopResultBuilder]: For program point L220(lines 210 248) no Hoare annotation was computed. [2021-12-28 01:03:50,245 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 96) no Hoare annotation was computed. [2021-12-28 01:03:50,245 INFO L858 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2021-12-28 01:03:50,245 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 244) no Hoare annotation was computed. [2021-12-28 01:03:50,245 INFO L854 garLoopResultBuilder]: At program point L353(lines 347 355) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,245 INFO L858 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2021-12-28 01:03:50,245 INFO L854 garLoopResultBuilder]: At program point L436(line 436) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,246 INFO L858 garLoopResultBuilder]: For program point L436-1(line 436) no Hoare annotation was computed. [2021-12-28 01:03:50,246 INFO L858 garLoopResultBuilder]: For program point L370-1(lines 359 382) no Hoare annotation was computed. [2021-12-28 01:03:50,246 INFO L854 garLoopResultBuilder]: At program point L421(line 421) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-28 01:03:50,246 INFO L858 garLoopResultBuilder]: For program point L421-1(line 421) no Hoare annotation was computed. [2021-12-28 01:03:50,246 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 01:03:50,246 INFO L858 garLoopResultBuilder]: For program point L223(lines 223 230) no Hoare annotation was computed. [2021-12-28 01:03:50,246 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2021-12-28 01:03:50,246 INFO L854 garLoopResultBuilder]: At program point L92(lines 87 118) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_pc~0 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~m_pc~0) .cse4 (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2021-12-28 01:03:50,246 INFO L854 garLoopResultBuilder]: At program point L175-1(lines 166 183) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2021-12-28 01:03:50,247 INFO L854 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 2 ~T1_E~0))) (or (and .cse0 .cse1 (<= ~token~0 (+ ~local~0 1)) .cse2 (<= 1 ~m_pc~0) .cse3 (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 0)))) [2021-12-28 01:03:50,247 INFO L858 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2021-12-28 01:03:50,247 INFO L854 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2021-12-28 01:03:50,247 INFO L854 garLoopResultBuilder]: At program point L423-1(line 423) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2021-12-28 01:03:50,248 INFO L854 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,248 INFO L854 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,248 INFO L854 garLoopResultBuilder]: At program point L77(lines 40 83) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~m_st~0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (= ~token~0 ~local~0))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 (<= ~t1_pc~0 0) .cse3 .cse4 .cse5))) [2021-12-28 01:03:50,248 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2021-12-28 01:03:50,248 INFO L854 garLoopResultBuilder]: At program point L424(line 424) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= ~t1_pc~0 0)) (.cse3 (= ~m_pc~0 0)) (.cse4 (= ~E_M~0 ~M_E~0)) (.cse5 (= ~M_E~0 2))) (or (and .cse0 .cse1 (<= 2 ~m_st~0) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 (= ~m_st~0 0) .cse2 .cse3 .cse4 (= ~token~0 ~local~0) .cse5))) [2021-12-28 01:03:50,248 INFO L854 garLoopResultBuilder]: At program point L391(lines 384 393) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~m_st~0 0) (<= ~t1_pc~0 0) (= ~m_pc~0 0) (= ~E_M~0 ~M_E~0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2021-12-28 01:03:50,248 INFO L854 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse5 (not (= ~t1_st~0 0))) (.cse1 (<= 2 ~E_M~0)) (.cse2 (<= 2 ~T1_E~0)) (.cse3 (not (= ~E_1~0 0))) (.cse4 (= ~m_pc~0 0)) (.cse6 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= 1 ~m_pc~0) .cse2 .cse3 .cse5 .cse6) (and .cse1 (<= ~t1_pc~0 0) .cse2 .cse3 .cse4 .cse6))) [2021-12-28 01:03:50,248 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 01:03:50,248 INFO L858 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2021-12-28 01:03:50,248 INFO L854 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,249 INFO L854 garLoopResultBuilder]: At program point L375-1(lines 356 383) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,249 INFO L854 garLoopResultBuilder]: At program point L442(line 442) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,249 INFO L854 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,249 INFO L854 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,249 INFO L858 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2021-12-28 01:03:50,249 INFO L858 garLoopResultBuilder]: For program point L360-2(lines 359 382) no Hoare annotation was computed. [2021-12-28 01:03:50,249 INFO L854 garLoopResultBuilder]: At program point L410(lines 394 412) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,249 INFO L854 garLoopResultBuilder]: At program point L113(lines 84 119) the Hoare annotation is: (let ((.cse3 (= ~m_st~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse8 (<= 2 ~m_st~0)) (.cse7 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse6 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 (+ ~local~0 1)) .cse7 .cse4 .cse6 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse7 .cse4 .cse6))) [2021-12-28 01:03:50,249 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2021-12-28 01:03:50,249 INFO L858 garLoopResultBuilder]: For program point L460(lines 460 464) no Hoare annotation was computed. [2021-12-28 01:03:50,250 INFO L858 garLoopResultBuilder]: For program point L213(line 213) no Hoare annotation was computed. [2021-12-28 01:03:50,250 INFO L854 garLoopResultBuilder]: At program point L48(lines 43 82) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (<= 2 ~E_M~0) (<= ~token~0 (+ ~local~0 1)) (<= 1 ~m_pc~0) (<= 2 ~T1_E~0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2021-12-28 01:03:50,250 INFO L854 garLoopResultBuilder]: At program point L428-1(lines 425 465) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,250 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 01:03:50,250 INFO L858 garLoopResultBuilder]: For program point L445(line 445) no Hoare annotation was computed. [2021-12-28 01:03:50,250 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2021-12-28 01:03:50,250 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2021-12-28 01:03:50,251 INFO L854 garLoopResultBuilder]: At program point L99-1(lines 87 118) the Hoare annotation is: (let ((.cse2 (<= 2 ~m_st~0)) (.cse6 (= ~m_pc~0 0)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (<= 2 ~E_M~0)) (.cse7 (= ~m_st~0 0)) (.cse3 (<= 1 ~m_pc~0)) (.cse4 (<= 2 ~T1_E~0)) (.cse5 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse7 (<= ~token~0 (+ ~local~0 1)) .cse3 .cse4 .cse5 (< ~local~0 ~token~0)))) [2021-12-28 01:03:50,251 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2021-12-28 01:03:50,251 INFO L858 garLoopResultBuilder]: For program point L215-1(lines 210 248) no Hoare annotation was computed. [2021-12-28 01:03:50,251 INFO L858 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2021-12-28 01:03:50,251 INFO L858 garLoopResultBuilder]: For program point L447(lines 447 456) no Hoare annotation was computed. [2021-12-28 01:03:50,251 INFO L858 garLoopResultBuilder]: For program point L447-2(lines 447 456) no Hoare annotation was computed. [2021-12-28 01:03:50,251 INFO L854 garLoopResultBuilder]: At program point L249(lines 204 254) the Hoare annotation is: (let ((.cse7 (<= ~t1_pc~0 0)) (.cse6 (= ~token~0 ~local~0)) (.cse9 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (<= 2 ~E_M~0)) (.cse3 (<= 2 ~m_st~0)) (.cse4 (<= 1 ~m_pc~0)) (.cse5 (<= 2 ~T1_E~0)) (.cse10 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse5 .cse8) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse9 .cse5 .cse8 .cse10) (and .cse1 .cse2 .cse9 .cse7 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse2 .cse9 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse5 .cse10 (< ~local~0 ~token~0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10))) [2021-12-28 01:03:50,251 INFO L858 garLoopResultBuilder]: For program point L365-1(lines 359 382) no Hoare annotation was computed. [2021-12-28 01:03:50,254 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 01:03:50,255 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 01:03:50,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:03:50 BoogieIcfgContainer [2021-12-28 01:03:50,291 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 01:03:50,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 01:03:50,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 01:03:50,292 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 01:03:50,292 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:03:27" (3/4) ... [2021-12-28 01:03:50,294 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 01:03:50,298 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2021-12-28 01:03:50,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-12-28 01:03:50,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2021-12-28 01:03:50,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2021-12-28 01:03:50,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2021-12-28 01:03:50,299 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2021-12-28 01:03:50,308 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2021-12-28 01:03:50,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-28 01:03:50,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-28 01:03:50,309 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-28 01:03:50,326 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) [2021-12-28 01:03:50,327 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) [2021-12-28 01:03:50,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) [2021-12-28 01:03:50,328 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) [2021-12-28 01:03:50,358 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 01:03:50,359 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 01:03:50,360 INFO L158 Benchmark]: Toolchain (without parser) took 23496.79ms. Allocated memory was 56.6MB in the beginning and 608.2MB in the end (delta: 551.6MB). Free memory was 35.9MB in the beginning and 361.8MB in the end (delta: -325.9MB). Peak memory consumption was 224.9MB. Max. memory is 16.1GB. [2021-12-28 01:03:50,360 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:03:50,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.33ms. Allocated memory is still 56.6MB. Free memory was 35.7MB in the beginning and 38.4MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 01:03:50,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.03ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 36.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 01:03:50,361 INFO L158 Benchmark]: Boogie Preprocessor took 16.40ms. Allocated memory is still 56.6MB. Free memory was 36.4MB in the beginning and 34.9MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 01:03:50,361 INFO L158 Benchmark]: RCFGBuilder took 391.48ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.9MB in the beginning and 45.4MB in the end (delta: -10.5MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2021-12-28 01:03:50,361 INFO L158 Benchmark]: TraceAbstraction took 22772.91ms. Allocated memory was 69.2MB in the beginning and 608.2MB in the end (delta: 539.0MB). Free memory was 45.1MB in the beginning and 369.2MB in the end (delta: -324.1MB). Peak memory consumption was 381.6MB. Max. memory is 16.1GB. [2021-12-28 01:03:50,362 INFO L158 Benchmark]: Witness Printer took 67.46ms. Allocated memory is still 608.2MB. Free memory was 369.2MB in the beginning and 361.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-28 01:03:50,365 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.10ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 38.9MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.33ms. Allocated memory is still 56.6MB. Free memory was 35.7MB in the beginning and 38.4MB in the end (delta: -2.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.03ms. Allocated memory is still 56.6MB. Free memory was 38.4MB in the beginning and 36.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.40ms. Allocated memory is still 56.6MB. Free memory was 36.4MB in the beginning and 34.9MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 391.48ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 34.9MB in the beginning and 45.4MB in the end (delta: -10.5MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 22772.91ms. Allocated memory was 69.2MB in the beginning and 608.2MB in the end (delta: 539.0MB). Free memory was 45.1MB in the beginning and 369.2MB in the end (delta: -324.1MB). Peak memory consumption was 381.6MB. Max. memory is 16.1GB. * Witness Printer took 67.46ms. Allocated memory is still 608.2MB. Free memory was 369.2MB in the beginning and 361.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 16, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3539 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3427 mSDsluCounter, 6603 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3794 mSDsCounter, 653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3424 IncrementalHoareTripleChecker+Invalid, 4077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 653 mSolverCounterUnsat, 2809 mSDtfsCounter, 3424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 1451 SyntacticMatches, 4 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3350occurred in iteration=8, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 2416 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 43 LocationsWithAnnotation, 5313 PreInvPairs, 6028 NumberOfFragments, 6978 HoareAnnotationTreeSize, 5313 FomulaSimplifications, 13474 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 43 FomulaSimplificationsInter, 159673 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2887 NumberOfCodeBlocks, 2887 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 4660 SizeOfPredicates, 6 NumberOfNonLiveVariables, 3527 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 1398/1568 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || !(2 <= E_1)) || (((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && 2 <= m_st) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && M_E == 2) || (((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && tmp <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || (((m_st == 0 && __retres1 <= 0) && !(t1_st == 0)) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || E_1 == 0) || !(token == local))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1))) && ((((((((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= __retres1) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) - InvariantResult [Line: 425]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local)) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || ((((((0 <= \result && \result <= 0) && 0 < tmp + 1) && 2 <= m_st) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((\old(t1_st) == t1_st && 0 < tmp + 1) && m_st == \old(m_st)) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1) || (((((m_st == 0 && \result <= 0) && __retres1 <= 0) && !(t1_st == 0)) && 0 <= \result) && 0 <= __retres1)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || !(2 <= E_1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(1 <= m_pc)) || E_1 == 0) || (((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && tmp <= 0) && __retres1 <= 0)) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((((((((((0 <= \result && \result <= 0) && \old(t1_st) == t1_st) && 0 < tmp + 1) && m_st == \old(m_st)) && 0 <= __retres1) && \result <= 0) && tmp <= 0) && __retres1 <= 0) && __retres1 <= 0) && 0 <= \result) && 0 <= __retres1)) || E_1 == 0) || !(token == local)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((2 <= E_1 && 2 <= E_M) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0))) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0) || (((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: (((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) || ((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || (((((2 <= E_1 && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || (((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1)) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(\old(m_st) == 0)) || !(2 <= E_1))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc <= 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token == local))) && (((((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || !(local < token)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(\old(m_st) == 0)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || E_1 == 0) || !(token == local))) && ((((((!(2 <= T1_E) || !(t1_pc <= 0)) || !(m_pc == 0)) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= T1_E) || !(t1_pc == 1)) || !(m_pc == 0)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || E_1 == 0) || !(token == local))) && (((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(2 <= E_M)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(1 <= m_pc)) || !(2 <= E_1))) && (((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(m_pc == 0)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && 0 <= __retres1) && __retres1 <= 0)) || !(2 <= E_1))) && ((((((((!(2 <= \old(m_st)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || \old(t1_st) == 0) || !(local < token)) || !(1 <= m_pc)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((((((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && token == local) || (((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0)) || ((((((2 <= E_1 && 2 <= E_M) && 2 <= m_st) && t1_pc <= 0) && 1 <= m_pc) && 2 <= T1_E) && token == local)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && 2 <= T1_E) && m_pc == 0) && !(t1_st == 0))) || ((((((2 <= E_1 && 2 <= E_M) && m_st == 0) && t1_pc <= 0) && 2 <= T1_E) && m_pc == 0) && token == local)) || ((((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && m_st == 0) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token)) || (((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 2 <= T1_E) && m_pc == 0)) || ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && 2 <= m_st) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((t1_pc == 1 && 2 <= E_1) && 2 <= E_M) && token <= local + 1) && 1 <= m_pc) && 2 <= T1_E) && !(t1_st == 0)) && local < token - InvariantResult [Line: 384]: Loop Invariant Derived loop invariant: ((((((T1_E == M_E && 2 <= E_1) && m_st == 0) && t1_pc <= 0) && m_pc == 0) && E_M == M_E) && token == local) && M_E == 2 RESULT: Ultimate proved your program to be correct! [2021-12-28 01:03:50,416 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 Result: TRUE