/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain IntervalDomain -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 00:09:43,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 00:09:43,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 00:09:43,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 00:09:43,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 00:09:43,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 00:09:43,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 00:09:43,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 00:09:43,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 00:09:43,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 00:09:43,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 00:09:43,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 00:09:43,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 00:09:43,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 00:09:43,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 00:09:43,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 00:09:43,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 00:09:43,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 00:09:43,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 00:09:43,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 00:09:43,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 00:09:43,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 00:09:43,834 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 00:09:43,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 00:09:43,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 00:09:43,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 00:09:43,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 00:09:43,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 00:09:43,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 00:09:43,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 00:09:43,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 00:09:43,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 00:09:43,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 00:09:43,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 00:09:43,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 00:09:43,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 00:09:43,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 00:09:43,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 00:09:43,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 00:09:43,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 00:09:43,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 00:09:43,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 00:09:43,884 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 00:09:43,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 00:09:43,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 00:09:43,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 00:09:43,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 00:09:43,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 00:09:43,886 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 00:09:43,886 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 00:09:43,886 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 00:09:43,886 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 00:09:43,887 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 00:09:43,887 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 00:09:43,888 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 00:09:43,888 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 00:09:43,888 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 00:09:43,888 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 00:09:43,888 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 00:09:43,888 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 00:09:43,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 00:09:43,889 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 00:09:43,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 00:09:43,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 00:09:43,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 00:09:43,890 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 00:09:43,890 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 00:09:43,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 00:09:43,890 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 00:09:43,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 00:09:43,890 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 00:09:43,891 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 00:09:43,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 00:09:43,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 00:09:43,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:09:43,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 00:09:43,892 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 00:09:43,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 00:09:43,892 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 00:09:43,892 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 00:09:43,892 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 00:09:43,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 00:09:43,892 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 00:09:43,893 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.sifa: Abstract Domain -> IntervalDomain [2023-04-01 00:09:44,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 00:09:44,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 00:09:44,171 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 00:09:44,173 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 00:09:44,174 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 00:09:44,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2023-04-01 00:09:45,495 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 00:09:45,707 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 00:09:45,708 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2023-04-01 00:09:45,716 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199c3e22a/198070ac34fc482d884359a8f27aec60/FLAGe9a6d373d [2023-04-01 00:09:45,728 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/199c3e22a/198070ac34fc482d884359a8f27aec60 [2023-04-01 00:09:45,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 00:09:45,732 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 00:09:45,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 00:09:45,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 00:09:45,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 00:09:45,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:09:45" (1/1) ... [2023-04-01 00:09:45,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e8f3e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:45, skipping insertion in model container [2023-04-01 00:09:45,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 12:09:45" (1/1) ... [2023-04-01 00:09:45,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 00:09:45,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 00:09:45,976 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2023-04-01 00:09:45,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:09:45,992 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 00:09:46,041 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2023-04-01 00:09:46,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 00:09:46,065 INFO L208 MainTranslator]: Completed translation [2023-04-01 00:09:46,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46 WrapperNode [2023-04-01 00:09:46,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 00:09:46,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 00:09:46,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 00:09:46,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 00:09:46,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,147 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 00:09:46,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 00:09:46,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 00:09:46,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 00:09:46,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (1/1) ... [2023-04-01 00:09:46,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 00:09:46,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:09:46,195 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) [2023-04-01 00:09:46,204 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 [2023-04-01 00:09:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 00:09:46,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2023-04-01 00:09:46,248 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2023-04-01 00:09:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2023-04-01 00:09:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2023-04-01 00:09:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 00:09:46,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-04-01 00:09:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 00:09:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 00:09:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 00:09:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 00:09:46,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2023-04-01 00:09:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2023-04-01 00:09:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure read [2023-04-01 00:09:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure write [2023-04-01 00:09:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-04-01 00:09:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2023-04-01 00:09:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2023-04-01 00:09:46,250 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure init [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure check [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2023-04-01 00:09:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2023-04-01 00:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 00:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 00:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 00:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 00:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 00:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 00:09:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 00:09:46,394 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 00:09:46,397 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 00:09:47,025 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 00:09:47,171 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 00:09:47,172 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-04-01 00:09:47,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:09:47 BoogieIcfgContainer [2023-04-01 00:09:47,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 00:09:47,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 00:09:47,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 00:09:47,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 00:09:47,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 12:09:45" (1/3) ... [2023-04-01 00:09:47,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3c9ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:09:47, skipping insertion in model container [2023-04-01 00:09:47,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 12:09:46" (2/3) ... [2023-04-01 00:09:47,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a3c9ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 12:09:47, skipping insertion in model container [2023-04-01 00:09:47,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 12:09:47" (3/3) ... [2023-04-01 00:09:47,187 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2023-04-01 00:09:47,204 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 00:09:47,205 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 00:09:47,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 00:09:47,270 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e4f4bb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 00:09:47,270 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 00:09:47,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 107 states have internal predecessors, (148), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-04-01 00:09:47,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-01 00:09:47,283 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:09:47,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:09:47,284 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:09:47,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:09:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash 634688777, now seen corresponding path program 1 times [2023-04-01 00:09:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:09:47,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158620350] [2023-04-01 00:09:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:09:47,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:09:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:09:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:47,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:09:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158620350] [2023-04-01 00:09:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158620350] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:09:47,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:09:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 00:09:47,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243982226] [2023-04-01 00:09:47,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:09:47,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 00:09:47,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:09:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 00:09:47,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 00:09:47,651 INFO L87 Difference]: Start difference. First operand has 160 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 107 states have internal predecessors, (148), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:09:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:09:47,787 INFO L93 Difference]: Finished difference Result 318 states and 500 transitions. [2023-04-01 00:09:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:09:47,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-04-01 00:09:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:09:47,805 INFO L225 Difference]: With dead ends: 318 [2023-04-01 00:09:47,805 INFO L226 Difference]: Without dead ends: 163 [2023-04-01 00:09:47,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:09:47,815 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 6 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:09:47,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 609 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:09:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-04-01 00:09:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2023-04-01 00:09:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 108 states have internal predecessors, (148), 41 states have call successors, (41), 15 states have call predecessors, (41), 14 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-04-01 00:09:47,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 229 transitions. [2023-04-01 00:09:47,871 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 229 transitions. Word has length 20 [2023-04-01 00:09:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:09:47,871 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 229 transitions. [2023-04-01 00:09:47,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:09:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 229 transitions. [2023-04-01 00:09:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 00:09:47,873 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:09:47,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:09:47,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 00:09:47,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:09:47,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:09:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1278620177, now seen corresponding path program 1 times [2023-04-01 00:09:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:09:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293493860] [2023-04-01 00:09:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:09:47,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:09:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:09:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:47,944 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:09:47,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293493860] [2023-04-01 00:09:47,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293493860] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:09:47,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:09:47,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 00:09:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24639115] [2023-04-01 00:09:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:09:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 00:09:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:09:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 00:09:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 00:09:47,947 INFO L87 Difference]: Start difference. First operand 161 states and 229 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:09:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:09:48,059 INFO L93 Difference]: Finished difference Result 328 states and 474 transitions. [2023-04-01 00:09:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:09:48,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-04-01 00:09:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:09:48,064 INFO L225 Difference]: With dead ends: 328 [2023-04-01 00:09:48,064 INFO L226 Difference]: Without dead ends: 175 [2023-04-01 00:09:48,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:09:48,067 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 22 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:09:48,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 613 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:09:48,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-04-01 00:09:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2023-04-01 00:09:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 115 states have (on average 1.4) internal successors, (161), 118 states have internal predecessors, (161), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-04-01 00:09:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 244 transitions. [2023-04-01 00:09:48,098 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 244 transitions. Word has length 21 [2023-04-01 00:09:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:09:48,099 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 244 transitions. [2023-04-01 00:09:48,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 00:09:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 244 transitions. [2023-04-01 00:09:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-01 00:09:48,100 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:09:48,100 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 00:09:48,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 00:09:48,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:09:48,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:09:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1003025931, now seen corresponding path program 1 times [2023-04-01 00:09:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:09:48,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239077165] [2023-04-01 00:09:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:09:48,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:09:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:09:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:48,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:09:48,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239077165] [2023-04-01 00:09:48,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239077165] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:09:48,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:09:48,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 00:09:48,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011222964] [2023-04-01 00:09:48,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:09:48,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 00:09:48,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:09:48,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 00:09:48,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 00:09:48,212 INFO L87 Difference]: Start difference. First operand 173 states and 244 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 00:09:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:09:48,256 INFO L93 Difference]: Finished difference Result 360 states and 520 transitions. [2023-04-01 00:09:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 00:09:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2023-04-01 00:09:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:09:48,259 INFO L225 Difference]: With dead ends: 360 [2023-04-01 00:09:48,259 INFO L226 Difference]: Without dead ends: 202 [2023-04-01 00:09:48,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 00:09:48,261 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 22 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:09:48,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 415 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:09:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-04-01 00:09:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 175. [2023-04-01 00:09:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 117 states have (on average 1.393162393162393) internal successors, (163), 120 states have internal predecessors, (163), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-04-01 00:09:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 246 transitions. [2023-04-01 00:09:48,280 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 246 transitions. Word has length 28 [2023-04-01 00:09:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:09:48,281 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 246 transitions. [2023-04-01 00:09:48,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 00:09:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 246 transitions. [2023-04-01 00:09:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-01 00:09:48,282 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:09:48,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:09:48,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-04-01 00:09:48,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:09:48,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:09:48,283 INFO L85 PathProgramCache]: Analyzing trace with hash -916616099, now seen corresponding path program 1 times [2023-04-01 00:09:48,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:09:48,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561111872] [2023-04-01 00:09:48,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:09:48,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:09:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:09:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:48,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:09:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561111872] [2023-04-01 00:09:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561111872] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:09:48,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:09:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 00:09:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731141561] [2023-04-01 00:09:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:09:48,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 00:09:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:09:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 00:09:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:09:48,444 INFO L87 Difference]: Start difference. First operand 175 states and 246 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 00:09:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:09:48,535 INFO L93 Difference]: Finished difference Result 338 states and 479 transitions. [2023-04-01 00:09:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 00:09:48,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-04-01 00:09:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:09:48,540 INFO L225 Difference]: With dead ends: 338 [2023-04-01 00:09:48,540 INFO L226 Difference]: Without dead ends: 183 [2023-04-01 00:09:48,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 00:09:48,549 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 2 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 00:09:48,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 822 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 00:09:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-04-01 00:09:48,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 179. [2023-04-01 00:09:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 123 states have internal predecessors, (166), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 41 states have call successors, (42) [2023-04-01 00:09:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 250 transitions. [2023-04-01 00:09:48,578 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 250 transitions. Word has length 36 [2023-04-01 00:09:48,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:09:48,578 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 250 transitions. [2023-04-01 00:09:48,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 00:09:48,578 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 250 transitions. [2023-04-01 00:09:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 00:09:48,579 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:09:48,579 INFO L195 NwaCegarLoop]: 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] [2023-04-01 00:09:48,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 00:09:48,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:09:48,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:09:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash -369677220, now seen corresponding path program 1 times [2023-04-01 00:09:48,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:09:48,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093186610] [2023-04-01 00:09:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:09:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:09:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:09:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:48,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:09:48,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093186610] [2023-04-01 00:09:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093186610] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:09:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 00:09:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 00:09:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960048085] [2023-04-01 00:09:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:09:48,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 00:09:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:09:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 00:09:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 00:09:48,696 INFO L87 Difference]: Start difference. First operand 179 states and 250 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:09:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:09:48,753 INFO L93 Difference]: Finished difference Result 301 states and 421 transitions. [2023-04-01 00:09:48,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 00:09:48,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2023-04-01 00:09:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:09:48,756 INFO L225 Difference]: With dead ends: 301 [2023-04-01 00:09:48,756 INFO L226 Difference]: Without dead ends: 175 [2023-04-01 00:09:48,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 00:09:48,759 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:09:48,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 00:09:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-04-01 00:09:48,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2023-04-01 00:09:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 117 states have (on average 1.358974358974359) internal successors, (159), 120 states have internal predecessors, (159), 42 states have call successors, (42), 16 states have call predecessors, (42), 15 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-04-01 00:09:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 242 transitions. [2023-04-01 00:09:48,774 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 242 transitions. Word has length 37 [2023-04-01 00:09:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:09:48,774 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 242 transitions. [2023-04-01 00:09:48,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-04-01 00:09:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 242 transitions. [2023-04-01 00:09:48,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-04-01 00:09:48,781 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:09:48,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:09:48,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-04-01 00:09:48,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:09:48,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:09:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 52813242, now seen corresponding path program 1 times [2023-04-01 00:09:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:09:48,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498290685] [2023-04-01 00:09:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:09:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:09:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:09:48,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:48,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:09:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498290685] [2023-04-01 00:09:48,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498290685] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:09:48,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072583246] [2023-04-01 00:09:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:09:48,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:09:48,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:09:48,905 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) [2023-04-01 00:09:48,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 00:09:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:09:49,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 00:09:49,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:09:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:49,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:09:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:09:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072583246] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:09:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [913903018] [2023-04-01 00:09:49,160 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2023-04-01 00:09:49,160 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:09:49,163 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 00:09:49,168 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 00:09:49,168 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 00:09:49,813 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 114 for LOIs [2023-04-01 00:09:49,893 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 91 for LOIs [2023-04-01 00:09:49,946 INFO L197 IcfgInterpreter]: Interpreting procedure init with input of size 56 for LOIs [2023-04-01 00:09:50,234 INFO L197 IcfgInterpreter]: Interpreting procedure add_history_type with input of size 61 for LOIs [2023-04-01 00:09:50,896 INFO L197 IcfgInterpreter]: Interpreting procedure read_history_bool with input of size 60 for LOIs [2023-04-01 00:09:50,921 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 00:09:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [913903018] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:09:52,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:09:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [4, 4, 4] total 25 [2023-04-01 00:09:52,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705287540] [2023-04-01 00:09:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:09:52,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 00:09:52,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:09:52,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 00:09:52,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-04-01 00:09:52,926 INFO L87 Difference]: Start difference. First operand 175 states and 242 transitions. Second operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 00:10:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:10:00,228 INFO L93 Difference]: Finished difference Result 385 states and 530 transitions. [2023-04-01 00:10:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-01 00:10:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2023-04-01 00:10:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:10:00,230 INFO L225 Difference]: With dead ends: 385 [2023-04-01 00:10:00,230 INFO L226 Difference]: Without dead ends: 219 [2023-04-01 00:10:00,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=253, Invalid=1469, Unknown=0, NotChecked=0, Total=1722 [2023-04-01 00:10:00,231 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 250 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-04-01 00:10:00,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 234 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-04-01 00:10:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-04-01 00:10:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 208. [2023-04-01 00:10:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 145 states have internal predecessors, (191), 45 states have call successors, (45), 21 states have call predecessors, (45), 20 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-04-01 00:10:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2023-04-01 00:10:00,277 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 38 [2023-04-01 00:10:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:10:00,279 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2023-04-01 00:10:00,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 00:10:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2023-04-01 00:10:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-04-01 00:10:00,281 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:10:00,281 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-04-01 00:10:00,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 00:10:00,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-04-01 00:10:00,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:10:00,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:10:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1952075819, now seen corresponding path program 1 times [2023-04-01 00:10:00,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:10:00,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651542750] [2023-04-01 00:10:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:10:00,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:10:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:10:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:10:00,544 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:10:00,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651542750] [2023-04-01 00:10:00,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651542750] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:10:00,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84016729] [2023-04-01 00:10:00,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:10:00,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:10:00,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:10:00,547 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) [2023-04-01 00:10:00,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 00:10:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:10:00,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 00:10:00,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:10:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:10:00,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:10:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 00:10:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84016729] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:10:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [713000617] [2023-04-01 00:10:00,718 INFO L159 IcfgInterpreter]: Started Sifa with 33 locations of interest [2023-04-01 00:10:00,718 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:10:00,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 00:10:00,719 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 00:10:00,719 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 00:10:01,022 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 114 for LOIs [2023-04-01 00:10:01,083 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 91 for LOIs [2023-04-01 00:10:01,118 INFO L197 IcfgInterpreter]: Interpreting procedure init with input of size 56 for LOIs [2023-04-01 00:10:01,308 INFO L197 IcfgInterpreter]: Interpreting procedure add_history_type with input of size 61 for LOIs [2023-04-01 00:10:01,788 INFO L197 IcfgInterpreter]: Interpreting procedure read_history_bool with input of size 63 for LOIs [2023-04-01 00:10:01,876 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 00:10:04,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [713000617] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:10:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:10:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [4, 4, 4] total 27 [2023-04-01 00:10:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101049684] [2023-04-01 00:10:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:10:04,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 00:10:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:10:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 00:10:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2023-04-01 00:10:04,224 INFO L87 Difference]: Start difference. First operand 208 states and 280 transitions. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 00:10:11,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:10:11,615 INFO L93 Difference]: Finished difference Result 411 states and 561 transitions. [2023-04-01 00:10:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-01 00:10:11,616 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 38 [2023-04-01 00:10:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:10:11,617 INFO L225 Difference]: With dead ends: 411 [2023-04-01 00:10:11,617 INFO L226 Difference]: Without dead ends: 224 [2023-04-01 00:10:11,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=304, Invalid=1766, Unknown=0, NotChecked=0, Total=2070 [2023-04-01 00:10:11,619 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 251 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 2115 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-04-01 00:10:11,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 234 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2115 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-04-01 00:10:11,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-04-01 00:10:11,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 213. [2023-04-01 00:10:11,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 149 states have internal predecessors, (195), 45 states have call successors, (45), 22 states have call predecessors, (45), 21 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-04-01 00:10:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 284 transitions. [2023-04-01 00:10:11,662 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 284 transitions. Word has length 38 [2023-04-01 00:10:11,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:10:11,663 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 284 transitions. [2023-04-01 00:10:11,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 8 states have call successors, (8), 6 states have call predecessors, (8), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 00:10:11,663 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 284 transitions. [2023-04-01 00:10:11,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 00:10:11,663 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 00:10:11,664 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:10:11,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 00:10:11,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-04-01 00:10:11,873 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 00:10:11,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 00:10:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1474497807, now seen corresponding path program 1 times [2023-04-01 00:10:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 00:10:11,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051138940] [2023-04-01 00:10:11,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:10:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 00:10:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:10:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:10:11,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 00:10:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051138940] [2023-04-01 00:10:11,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051138940] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 00:10:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936646492] [2023-04-01 00:10:11,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 00:10:11,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:10:11,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 00:10:11,974 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) [2023-04-01 00:10:11,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 00:10:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 00:10:12,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 00:10:12,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 00:10:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 00:10:12,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 00:10:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 00:10:12,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936646492] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 00:10:12,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845022486] [2023-04-01 00:10:12,126 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2023-04-01 00:10:12,126 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 00:10:12,127 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 00:10:12,127 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 00:10:12,127 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 00:10:12,340 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 114 for LOIs [2023-04-01 00:10:12,376 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 91 for LOIs [2023-04-01 00:10:12,405 INFO L197 IcfgInterpreter]: Interpreting procedure init with input of size 56 for LOIs [2023-04-01 00:10:12,612 INFO L197 IcfgInterpreter]: Interpreting procedure add_history_type with input of size 61 for LOIs [2023-04-01 00:10:13,074 INFO L197 IcfgInterpreter]: Interpreting procedure read_history_bool with input of size 63 for LOIs [2023-04-01 00:10:13,151 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 00:10:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1845022486] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 00:10:15,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 00:10:15,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [4, 4, 4] total 29 [2023-04-01 00:10:15,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891796413] [2023-04-01 00:10:15,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 00:10:15,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 00:10:15,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 00:10:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 00:10:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2023-04-01 00:10:15,414 INFO L87 Difference]: Start difference. First operand 213 states and 284 transitions. Second operand has 25 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 00:10:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 00:10:20,854 INFO L93 Difference]: Finished difference Result 227 states and 297 transitions. [2023-04-01 00:10:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-04-01 00:10:20,857 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 55 [2023-04-01 00:10:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 00:10:20,858 INFO L225 Difference]: With dead ends: 227 [2023-04-01 00:10:20,858 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 00:10:20,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=331, Invalid=2219, Unknown=0, NotChecked=0, Total=2550 [2023-04-01 00:10:20,860 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 00:10:20,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 11 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 00:10:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 00:10:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 00:10:20,861 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) [2023-04-01 00:10:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 00:10:20,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2023-04-01 00:10:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 00:10:20,861 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 00:10:20,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 8 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 00:10:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 00:10:20,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 00:10:20,864 INFO L805 garLoopResultBuilder]: Registering result SAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 00:10:20,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 00:10:21,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 00:10:21,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 00:10:25,483 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2023-04-01 00:10:25,483 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 3) no Hoare annotation was computed. [2023-04-01 00:10:25,484 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 398 428) the Hoare annotation is: true [2023-04-01 00:10:25,484 INFO L902 garLoopResultBuilder]: At program point L406(line 406) the Hoare annotation is: true [2023-04-01 00:10:25,484 INFO L899 garLoopResultBuilder]: For program point L406-1(lines 404 427) no Hoare annotation was computed. [2023-04-01 00:10:25,484 INFO L899 garLoopResultBuilder]: For program point gate3_each_pals_periodEXIT(lines 398 428) no Hoare annotation was computed. [2023-04-01 00:10:25,484 INFO L902 garLoopResultBuilder]: At program point L171(line 171) the Hoare annotation is: true [2023-04-01 00:10:25,484 INFO L899 garLoopResultBuilder]: For program point L171-1(lines 161 175) no Hoare annotation was computed. [2023-04-01 00:10:25,484 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 161 175) the Hoare annotation is: true [2023-04-01 00:10:25,484 INFO L899 garLoopResultBuilder]: For program point L166(lines 166 172) no Hoare annotation was computed. [2023-04-01 00:10:25,484 INFO L899 garLoopResultBuilder]: For program point write_history_int8EXIT(lines 161 175) no Hoare annotation was computed. [2023-04-01 00:10:25,484 INFO L895 garLoopResultBuilder]: At program point L508(line 508) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,485 INFO L895 garLoopResultBuilder]: At program point L506(line 506) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,485 INFO L895 garLoopResultBuilder]: At program point L506-1(line 506) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,485 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 470 523) no Hoare annotation was computed. [2023-04-01 00:10:25,485 INFO L895 garLoopResultBuilder]: At program point L504-2(lines 504 520) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,486 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 470 523) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (and (= ~votedValue_History_2~0 0) (= ~gate1Failed_History_0~0 0) (= 0 ~gate2Failed_History_1~0) (= ~gate1Failed_History_2~0 0) (= ~gate3Failed_History_2~0 0) (= ~g1v_old~0 0) (= ~gate3Failed_History_1~0 0) (= ~g1v_new~0 0) (= ~votedValue_History_1~0 0) (= 0 ~gate2Failed_History_2~0) (= ~g3v_old~0 0) (= ~VALUE2~0 0) (= ~gate1Failed~0 0) (= ~gate3Failed_History_0~0 0) (= ~g3v_new~0 0) (= 0 ~gate2Failed_History_0~0) (= ~gate1Failed_History_1~0 0) (= ~gate2Failed~0 0) (= ~VALUE1~0 0) (= ~g2v_old~0 0) (= ~VALUE3~0 0) (= ~votedValue_History_0~0 0) (= ~gate3Failed~0 0) (= ~g2v_new~0 0)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,486 INFO L895 garLoopResultBuilder]: At program point L517(line 517) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,486 INFO L899 garLoopResultBuilder]: For program point L517-1(line 517) no Hoare annotation was computed. [2023-04-01 00:10:25,486 INFO L899 garLoopResultBuilder]: For program point L509(line 509) no Hoare annotation was computed. [2023-04-01 00:10:25,487 INFO L895 garLoopResultBuilder]: At program point L507(line 507) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,487 INFO L895 garLoopResultBuilder]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (and (<= 0 (+ ~VALUE3~0 128)) (= ~g1v_old~0 0) (= ~g1v_new~0 0) (= main_~c1~0 0) (= ~g3v_old~0 0) (= ~g3v_new~0 0) (<= 0 (+ ~votedValue_History_1~0 128)) (<= ~votedValue_History_0~0 127) (<= ~votedValue_History_2~0 127) (<= 0 (+ ~votedValue_History_0~0 128)) (<= ~VALUE2~0 127) (<= 0 (+ ~VALUE2~0 128)) (<= ~VALUE3~0 127) (= ~g2v_old~0 0) (<= ~votedValue_History_1~0 127) (<= 0 (+ ~votedValue_History_2~0 128)) (<= 0 (+ ~VALUE1~0 128)) (<= ~VALUE1~0 127) (= ~g2v_new~0 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,487 INFO L899 garLoopResultBuilder]: For program point L495-1(line 495) no Hoare annotation was computed. [2023-04-01 00:10:25,487 INFO L895 garLoopResultBuilder]: At program point L516(line 516) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (or (not (= |old(~gate2Failed_History_2~0)| 0)) (not (= |old(~gate1Failed_History_1~0)| 0)) (not (= |old(~gate2Failed_History_1~0)| 0)) (not (= |old(~gate1Failed~0)| 0)) (not (= (select .cse0 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (not (= |old(~votedValue_History_0~0)| 0)) (not (= 2 (select |#length| 1))) (not (= |old(~g3v_new~0)| 0)) (not (= |old(~gate2Failed~0)| 0)) (not (= |old(~gate3Failed_History_2~0)| 0)) (not (= |old(~gate3Failed_History_0~0)| 0)) (not (= (select |#valid| 3) 1)) (not (= |old(~gate1Failed_History_2~0)| 0)) (not (= |old(~VALUE3~0)| 0)) (not (= (select |#length| 3) 12)) (not (= (select |#valid| 0) 0)) (not (= (select .cse0 1) 0)) (not (= |old(~VALUE1~0)| 0)) (not (= ~g3v~0 0)) (not (= (select |#valid| 1) 1)) (not (= |old(~votedValue_History_2~0)| 0)) (not (= |old(~VALUE2~0)| 0)) (not (= |old(~g3v_old~0)| 0)) (not (= |old(~g1v_old~0)| 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (not (= |old(~g2v_old~0)| 0)) (not (= |old(~g2v_new~0)| 0)) (not (= |old(~g1v_new~0)| 0)) (not (= (select |#valid| 2) 1)) (not (= |old(~gate3Failed_History_1~0)| 0)) (not (= 51 (select |#length| 2))) (not (= ~g1v~0 0)) (not (= |old(~gate1Failed_History_0~0)| 0)) (<= |#StackHeapBarrier| 0) (not (= |old(~votedValue_History_1~0)| 0)) (not (= |old(~gate3Failed~0)| 0)) (not (= |old(~gate2Failed_History_0~0)| 0)))) [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point L516-1(line 516) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point L186(lines 186 197) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point write_history_boolEXIT(lines 176 200) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point L181(lines 181 197) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 176 200) the Hoare annotation is: true [2023-04-01 00:10:25,488 INFO L902 garLoopResultBuilder]: At program point L196(line 196) the Hoare annotation is: true [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point L196-1(lines 176 200) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 367 397) the Hoare annotation is: true [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point gate2_each_pals_periodEXIT(lines 367 397) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L902 garLoopResultBuilder]: At program point L375(line 375) the Hoare annotation is: true [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point L375-1(lines 373 396) no Hoare annotation was computed. [2023-04-01 00:10:25,488 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 533) no Hoare annotation was computed. [2023-04-01 00:10:25,489 INFO L899 garLoopResultBuilder]: For program point L529-2(lines 524 535) no Hoare annotation was computed. [2023-04-01 00:10:25,489 INFO L899 garLoopResultBuilder]: For program point assertEXIT(lines 524 535) no Hoare annotation was computed. [2023-04-01 00:10:25,489 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 524 535) the Hoare annotation is: true [2023-04-01 00:10:25,489 INFO L899 garLoopResultBuilder]: For program point assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 531) no Hoare annotation was computed. [2023-04-01 00:10:25,489 INFO L899 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2023-04-01 00:10:25,489 INFO L899 garLoopResultBuilder]: For program point gate1_each_pals_periodEXIT(lines 336 366) no Hoare annotation was computed. [2023-04-01 00:10:25,489 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 336 366) the Hoare annotation is: true [2023-04-01 00:10:25,489 INFO L902 garLoopResultBuilder]: At program point L344(line 344) the Hoare annotation is: true [2023-04-01 00:10:25,489 INFO L899 garLoopResultBuilder]: For program point L344-1(lines 342 365) no Hoare annotation was computed. [2023-04-01 00:10:25,489 INFO L895 garLoopResultBuilder]: At program point L221(line 221) the Hoare annotation is: (or (< (+ ~votedValue_History_0~0 128) 0) (not (= ~g3v_old~0 0)) (not (= ~g3v_new~0 0)) (not (= ~g1v_new~0 0)) (< (+ ~votedValue_History_1~0 128) 0) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (< 127 ~VALUE2~0) (< |#StackHeapBarrier| 0) (not (= ~g2v_new~0 0)) (not (= ~g1v_old~0 0)) (< (+ ~VALUE3~0 128) 0) (< (+ ~VALUE1~0 128) 0) (not (= ~g3v~0 0)) (< 127 ~VALUE1~0) (< 127 ~VALUE3~0) (not (= ~g2v_old~0 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (< 127 ~votedValue_History_0~0) (< (+ ~VALUE2~0 128) 0) (< (+ ~votedValue_History_2~0 128) 0) (not (= ~g1v~0 0)) (< 127 ~votedValue_History_2~0) (< 127 ~votedValue_History_1~0)) [2023-04-01 00:10:25,490 INFO L899 garLoopResultBuilder]: For program point L221-1(line 221) no Hoare annotation was computed. [2023-04-01 00:10:25,490 INFO L899 garLoopResultBuilder]: For program point L218(lines 218 220) no Hoare annotation was computed. [2023-04-01 00:10:25,490 INFO L895 garLoopResultBuilder]: At program point L217(line 217) the Hoare annotation is: (or (< (+ ~votedValue_History_0~0 128) 0) (not (= ~g3v_old~0 0)) (not (= ~g3v_new~0 0)) (not (= ~g1v_new~0 0)) (< (+ ~votedValue_History_1~0 128) 0) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (< 127 ~VALUE2~0) (< |#StackHeapBarrier| 0) (not (= ~g2v_new~0 0)) (not (= ~g1v_old~0 0)) (< (+ ~VALUE3~0 128) 0) (< (+ ~VALUE1~0 128) 0) (not (= ~g3v~0 0)) (< 127 ~VALUE1~0) (< 127 ~VALUE3~0) (not (= ~g2v_old~0 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (< 127 ~votedValue_History_0~0) (< (+ ~VALUE2~0 128) 0) (< (+ ~votedValue_History_2~0 128) 0) (not (= ~g1v~0 0)) (< 127 ~votedValue_History_2~0) (< 127 ~votedValue_History_1~0)) [2023-04-01 00:10:25,490 INFO L899 garLoopResultBuilder]: For program point L217-1(line 217) no Hoare annotation was computed. [2023-04-01 00:10:25,490 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 216) no Hoare annotation was computed. [2023-04-01 00:10:25,490 INFO L895 garLoopResultBuilder]: At program point L213(line 213) the Hoare annotation is: (or (< (+ ~votedValue_History_0~0 128) 0) (not (= ~g3v_old~0 0)) (not (= ~g3v_new~0 0)) (not (= ~g1v_new~0 0)) (< (+ ~votedValue_History_1~0 128) 0) (not (= |#NULL.offset| 0)) (not (= ~g2v~0 0)) (< 127 ~VALUE2~0) (< |#StackHeapBarrier| 0) (not (= ~g2v_new~0 0)) (= init_~tmp~1 1) (not (= ~g1v_old~0 0)) (< (+ ~VALUE3~0 128) 0) (< (+ ~VALUE1~0 128) 0) (not (= ~g3v~0 0)) (< 127 ~VALUE1~0) (< 127 ~VALUE3~0) (not (= ~g2v_old~0 0)) (not (= |#NULL.base| 0)) (not (= (+ ~nomsg~0 1) 0)) (< 127 ~votedValue_History_0~0) (< (+ ~VALUE2~0 128) 0) (< (+ ~votedValue_History_2~0 128) 0) (not (= ~g1v~0 0)) (< 127 ~votedValue_History_2~0) (< 127 ~votedValue_History_1~0)) [2023-04-01 00:10:25,490 INFO L899 garLoopResultBuilder]: For program point L213-1(line 213) no Hoare annotation was computed. [2023-04-01 00:10:25,490 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 212) no Hoare annotation was computed. [2023-04-01 00:10:25,490 INFO L902 garLoopResultBuilder]: At program point L209(line 209) the Hoare annotation is: true [2023-04-01 00:10:25,490 INFO L899 garLoopResultBuilder]: For program point L209-1(line 209) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point initEXIT(lines 201 227) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 201 227) the Hoare annotation is: true [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point initFINAL(lines 201 227) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L902 garLoopResultBuilder]: At program point L116(line 116) the Hoare annotation is: true [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point read_history_int8FINAL(lines 101 120) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point L116-1(line 116) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 117) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 101 120) the Hoare annotation is: true [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point read_history_int8EXIT(lines 101 120) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 157) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point read_history_boolFINAL(lines 121 160) no Hoare annotation was computed. [2023-04-01 00:10:25,491 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 121 160) the Hoare annotation is: true [2023-04-01 00:10:25,491 INFO L899 garLoopResultBuilder]: For program point read_history_boolEXIT(lines 121 160) no Hoare annotation was computed. [2023-04-01 00:10:25,492 INFO L895 garLoopResultBuilder]: At program point L156(line 156) the Hoare annotation is: (let ((.cse0 (< (+ ~votedValue_History_0~0 128) 0)) (.cse1 (not (= ~g3v_old~0 0))) (.cse2 (not (= ~g3v_new~0 0))) (.cse3 (not (= ~g1v_new~0 0))) (.cse4 (< (+ ~votedValue_History_1~0 128) 0)) (.cse5 (not (= |#NULL.offset| 0))) (.cse6 (not (= ~g2v~0 0))) (.cse7 (< 127 ~VALUE2~0)) (.cse8 (< |#StackHeapBarrier| 0)) (.cse9 (not (= ~g2v_new~0 0))) (.cse10 (not (= ~g1v_old~0 0))) (.cse11 (< (+ ~VALUE3~0 128) 0)) (.cse12 (< (+ ~VALUE1~0 128) 0)) (.cse13 (not (= ~g3v~0 0))) (.cse14 (< 127 ~VALUE1~0)) (.cse15 (< 127 ~VALUE3~0)) (.cse16 (not (= ~g2v_old~0 0))) (.cse17 (not (= |#NULL.base| 0))) (.cse18 (not (= (+ ~nomsg~0 1) 0))) (.cse19 (< 127 ~votedValue_History_0~0)) (.cse20 (< (+ ~VALUE2~0 128) 0)) (.cse21 (< (+ ~votedValue_History_2~0 128) 0)) (.cse22 (not (= ~g1v~0 0))) (.cse23 (< 127 ~votedValue_History_2~0)) (.cse24 (< 127 ~votedValue_History_1~0)) (.cse25 (not (= |read_history_bool_#in~historyIndex| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (not (= |read_history_bool_#in~history_id| 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= 0 |read_history_bool_#in~history_id|)) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25))) [2023-04-01 00:10:25,492 INFO L899 garLoopResultBuilder]: For program point L156-1(line 156) no Hoare annotation was computed. [2023-04-01 00:10:25,492 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 157) no Hoare annotation was computed. [2023-04-01 00:10:25,492 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 157) no Hoare annotation was computed. [2023-04-01 00:10:25,492 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse0 (< (+ ~votedValue_History_0~0 128) 0)) (.cse1 (not (= ~g3v_old~0 0))) (.cse2 (not (= ~g3v_new~0 0))) (.cse3 (not (= ~g1v_new~0 0))) (.cse4 (< (+ ~votedValue_History_1~0 128) 0)) (.cse5 (not (= |#NULL.offset| 0))) (.cse6 (not (= ~g2v~0 0))) (.cse7 (< 127 ~VALUE2~0)) (.cse8 (< |#StackHeapBarrier| 0)) (.cse9 (not (= ~g2v_new~0 0))) (.cse10 (not (= ~g1v_old~0 0))) (.cse11 (< (+ ~VALUE3~0 128) 0)) (.cse12 (< (+ ~VALUE1~0 128) 0)) (.cse13 (not (= ~g3v~0 0))) (.cse14 (< 127 ~VALUE1~0)) (.cse15 (< 127 ~VALUE3~0)) (.cse16 (not (= ~g2v_old~0 0))) (.cse17 (not (= |#NULL.base| 0))) (.cse18 (not (= (+ ~nomsg~0 1) 0))) (.cse19 (< 127 ~votedValue_History_0~0)) (.cse20 (< (+ ~VALUE2~0 128) 0)) (.cse21 (< (+ ~votedValue_History_2~0 128) 0)) (.cse22 (not (= ~g1v~0 0))) (.cse23 (< 127 ~votedValue_History_2~0)) (.cse24 (< 127 ~votedValue_History_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= |add_history_type_#in~history_id| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |add_history_type_#in~history_id| 1)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2023-04-01 00:10:25,492 INFO L899 garLoopResultBuilder]: For program point L85-1(line 85) no Hoare annotation was computed. [2023-04-01 00:10:25,492 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse1 (not (= |add_history_type_#in~history_id| 0)))) (let ((.cse0 (let ((.cse2 (< (+ ~votedValue_History_0~0 128) 0)) (.cse3 (not (= ~g3v_old~0 0))) (.cse4 (not (= ~g3v_new~0 0))) (.cse5 (not (= ~g1v_new~0 0))) (.cse6 (< (+ ~votedValue_History_1~0 128) 0)) (.cse7 (not (= |#NULL.offset| 0))) (.cse8 (not (= ~g2v~0 0))) (.cse9 (< 127 ~VALUE2~0)) (.cse10 (< |#StackHeapBarrier| 0)) (.cse11 (not (= ~g2v_new~0 0))) (.cse12 (not (= ~g1v_old~0 0))) (.cse13 (< (+ ~VALUE3~0 128) 0)) (.cse14 (< (+ ~VALUE1~0 128) 0)) (.cse15 (not (= ~g3v~0 0))) (.cse16 (< 127 ~VALUE1~0)) (.cse17 (< 127 ~VALUE3~0)) (.cse18 (not (= ~g2v_old~0 0))) (.cse19 (not (= |#NULL.base| 0))) (.cse20 (not (= (+ ~nomsg~0 1) 0))) (.cse21 (< 127 ~votedValue_History_0~0)) (.cse22 (< (+ ~VALUE2~0 128) 0)) (.cse23 (< (+ ~votedValue_History_2~0 128) 0)) (.cse24 (not (= ~g1v~0 0))) (.cse25 (< 127 ~votedValue_History_2~0)) (.cse26 (< 127 ~votedValue_History_1~0))) (and (or .cse2 .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |add_history_type_#in~history_id| 1)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))))) (and (or .cse0 (and (<= 0 add_history_type_~var~0) (= add_history_type_~ini_bool~0 0) (= add_history_type_~history_id 0) (<= add_history_type_~var~0 3) (= (+ 2 add_history_type_~ini_int~0) 0))) (or (< add_history_type_~var~0 3) .cse1 .cse0)))) [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point L73-1(line 73) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 95) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point L90-2(lines 72 95) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 88) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 95) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 76) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L895 garLoopResultBuilder]: At program point L91(line 91) the Hoare annotation is: (let ((.cse0 (< (+ ~votedValue_History_0~0 128) 0)) (.cse1 (not (= ~g3v_old~0 0))) (.cse2 (not (= ~g3v_new~0 0))) (.cse3 (not (= ~g1v_new~0 0))) (.cse4 (< (+ ~votedValue_History_1~0 128) 0)) (.cse5 (not (= |#NULL.offset| 0))) (.cse6 (not (= ~g2v~0 0))) (.cse7 (< 127 ~VALUE2~0)) (.cse8 (< |#StackHeapBarrier| 0)) (.cse9 (not (= ~g2v_new~0 0))) (.cse10 (not (= ~g1v_old~0 0))) (.cse11 (< (+ ~VALUE3~0 128) 0)) (.cse12 (< (+ ~VALUE1~0 128) 0)) (.cse13 (not (= ~g3v~0 0))) (.cse14 (< 127 ~VALUE1~0)) (.cse15 (< 127 ~VALUE3~0)) (.cse16 (not (= ~g2v_old~0 0))) (.cse17 (not (= |#NULL.base| 0))) (.cse18 (not (= (+ ~nomsg~0 1) 0))) (.cse19 (< 127 ~votedValue_History_0~0)) (.cse20 (< (+ ~VALUE2~0 128) 0)) (.cse21 (< (+ ~votedValue_History_2~0 128) 0)) (.cse22 (not (= ~g1v~0 0))) (.cse23 (< 127 ~votedValue_History_2~0)) (.cse24 (< 127 ~votedValue_History_1~0))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= |add_history_type_#in~history_id| 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |add_history_type_#in~history_id| 1)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24))) [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point L91-1(line 91) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L899 garLoopResultBuilder]: For program point add_history_typeEXIT(lines 57 100) no Hoare annotation was computed. [2023-04-01 00:10:25,493 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (not (= |add_history_type_#in~history_id| 0)))) (let ((.cse1 (let ((.cse2 (< (+ ~votedValue_History_0~0 128) 0)) (.cse3 (not (= ~g3v_old~0 0))) (.cse4 (not (= ~g3v_new~0 0))) (.cse5 (not (= ~g1v_new~0 0))) (.cse6 (< (+ ~votedValue_History_1~0 128) 0)) (.cse7 (not (= |#NULL.offset| 0))) (.cse8 (not (= ~g2v~0 0))) (.cse9 (< 127 ~VALUE2~0)) (.cse10 (< |#StackHeapBarrier| 0)) (.cse11 (not (= ~g2v_new~0 0))) (.cse12 (not (= ~g1v_old~0 0))) (.cse13 (< (+ ~VALUE3~0 128) 0)) (.cse14 (< (+ ~VALUE1~0 128) 0)) (.cse15 (not (= ~g3v~0 0))) (.cse16 (< 127 ~VALUE1~0)) (.cse17 (< 127 ~VALUE3~0)) (.cse18 (not (= ~g2v_old~0 0))) (.cse19 (not (= |#NULL.base| 0))) (.cse20 (not (= (+ ~nomsg~0 1) 0))) (.cse21 (< 127 ~votedValue_History_0~0)) (.cse22 (< (+ ~VALUE2~0 128) 0)) (.cse23 (< (+ ~votedValue_History_2~0 128) 0)) (.cse24 (not (= ~g1v~0 0))) (.cse25 (< 127 ~votedValue_History_2~0)) (.cse26 (< 127 ~votedValue_History_1~0))) (and (or .cse2 .cse3 .cse4 .cse5 .cse0 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= |add_history_type_#in~history_id| 1)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26))))) (and (or .cse0 .cse1) (or .cse1 (and (< add_history_type_~var~0 3) (<= 0 add_history_type_~var~0) (= add_history_type_~ini_bool~0 0) (not (= add_history_type_~history_id 0)) (= (+ 2 add_history_type_~ini_int~0) 0) (<= 0 add_history_type_~history_id) (<= add_history_type_~history_id 1)))))) [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L79-1(line 79) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 57 100) the Hoare annotation is: true [2023-04-01 00:10:25,494 INFO L895 garLoopResultBuilder]: At program point L71-2(lines 71 97) the Hoare annotation is: (let ((.cse1 (not (= |add_history_type_#in~history_id| 0)))) (let ((.cse0 (let ((.cse3 (< (+ ~votedValue_History_0~0 128) 0)) (.cse4 (not (= ~g3v_old~0 0))) (.cse5 (not (= ~g3v_new~0 0))) (.cse6 (not (= ~g1v_new~0 0))) (.cse7 (< (+ ~votedValue_History_1~0 128) 0)) (.cse8 (not (= |#NULL.offset| 0))) (.cse9 (not (= ~g2v~0 0))) (.cse10 (< 127 ~VALUE2~0)) (.cse11 (< |#StackHeapBarrier| 0)) (.cse12 (not (= ~g2v_new~0 0))) (.cse13 (not (= ~g1v_old~0 0))) (.cse14 (< (+ ~VALUE3~0 128) 0)) (.cse15 (< (+ ~VALUE1~0 128) 0)) (.cse16 (not (= ~g3v~0 0))) (.cse17 (< 127 ~VALUE1~0)) (.cse18 (< 127 ~VALUE3~0)) (.cse19 (not (= ~g2v_old~0 0))) (.cse20 (not (= |#NULL.base| 0))) (.cse21 (not (= (+ ~nomsg~0 1) 0))) (.cse22 (< 127 ~votedValue_History_0~0)) (.cse23 (< (+ ~VALUE2~0 128) 0)) (.cse24 (< (+ ~votedValue_History_2~0 128) 0)) (.cse25 (not (= ~g1v~0 0))) (.cse26 (< 127 ~votedValue_History_2~0)) (.cse27 (< 127 ~votedValue_History_1~0))) (and (or .cse3 .cse4 .cse5 .cse6 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |add_history_type_#in~history_id| 1)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27))))) (and (or .cse0 (and (<= 0 add_history_type_~var~0) (= add_history_type_~ini_bool~0 0) (= (+ 2 add_history_type_~ini_int~0) 0) (<= 0 add_history_type_~history_id) (<= add_history_type_~history_id 1))) (let ((.cse2 (= add_history_type_~history_id 0))) (or .cse1 (and (= add_history_type_~tmp~0 0) .cse2 (<= add_history_type_~var~0 3)) .cse0 (and (= add_history_type_~var~0 0) .cse2)))))) [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 94) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 95) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 82) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 95) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point add_history_typeFINAL(lines 57 100) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L283(lines 283 285) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L902 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: true [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L308-1(line 308) no Hoare annotation was computed. [2023-04-01 00:10:25,494 INFO L899 garLoopResultBuilder]: For program point L300(line 300) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 330) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L309(lines 309 311) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L276(line 276) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point checkEXIT(lines 228 335) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L301(lines 301 319) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L902 garLoopResultBuilder]: At program point L268(line 268) the Hoare annotation is: true [2023-04-01 00:10:25,495 INFO L902 garLoopResultBuilder]: At program point L301-1(lines 301 319) the Hoare annotation is: true [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L268-1(line 268) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L902 garLoopResultBuilder]: At program point L326(line 326) the Hoare annotation is: true [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L326-1(line 326) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L902 garLoopResultBuilder]: At program point L260-1(line 260) the Hoare annotation is: true [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L277-2(lines 266 297) no Hoare annotation was computed. [2023-04-01 00:10:25,495 INFO L902 garLoopResultBuilder]: At program point L302(line 302) the Hoare annotation is: true [2023-04-01 00:10:25,495 INFO L899 garLoopResultBuilder]: For program point L302-1(line 302) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L902 garLoopResultBuilder]: At program point L269-2(lines 269 271) the Hoare annotation is: true [2023-04-01 00:10:25,496 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 228 335) the Hoare annotation is: true [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L327(lines 327 329) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L261(line 261) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L303(lines 303 318) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L262(lines 262 299) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L902 garLoopResultBuilder]: At program point L262-1(lines 262 299) the Hoare annotation is: true [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L320(line 320) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L902 garLoopResultBuilder]: At program point L304(line 304) the Hoare annotation is: true [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L304-1(line 304) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L902 garLoopResultBuilder]: At program point L263(line 263) the Hoare annotation is: true [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L263-1(line 263) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L321(lines 321 332) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 321 332) no Hoare annotation was computed. [2023-04-01 00:10:25,496 INFO L899 garLoopResultBuilder]: For program point L305(lines 305 317) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L264(lines 264 298) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L902 garLoopResultBuilder]: At program point L322(line 322) the Hoare annotation is: true [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L322-1(line 322) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L281(lines 281 291) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L902 garLoopResultBuilder]: At program point L306(line 306) the Hoare annotation is: true [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L306-1(line 306) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L902 garLoopResultBuilder]: At program point L273-2(lines 273 275) the Hoare annotation is: true [2023-04-01 00:10:25,497 INFO L902 garLoopResultBuilder]: At program point L265(line 265) the Hoare annotation is: true [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L265-1(line 265) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point checkFINAL(lines 228 335) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 331) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L282(lines 282 288) no Hoare annotation was computed. [2023-04-01 00:10:25,497 INFO L899 garLoopResultBuilder]: For program point L307(lines 307 314) no Hoare annotation was computed. [2023-04-01 00:10:25,498 INFO L899 garLoopResultBuilder]: For program point L266(lines 266 297) no Hoare annotation was computed. [2023-04-01 00:10:25,498 INFO L902 garLoopResultBuilder]: At program point $Ultimate##40(lines 294 296) the Hoare annotation is: true [2023-04-01 00:10:25,498 INFO L902 garLoopResultBuilder]: At program point L324(line 324) the Hoare annotation is: true [2023-04-01 00:10:25,498 INFO L899 garLoopResultBuilder]: For program point L324-1(line 324) no Hoare annotation was computed. [2023-04-01 00:10:25,498 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= ~gate1Failed_History_0~0 |old(~gate1Failed_History_0~0)|) (= |old(~VALUE3~0)| ~VALUE3~0) (= |old(~gate3Failed_History_2~0)| ~gate3Failed_History_2~0) (= |old(~votedValue_History_2~0)| ~votedValue_History_2~0) (= ~nomsg~0 |old(~nomsg~0)|) (= |old(~gate2Failed_History_2~0)| ~gate2Failed_History_2~0) (= ~g1v_old~0 |old(~g1v_old~0)|) (= |old(~g1v~0)| ~g1v~0) (= |old(~g2v~0)| ~g2v~0) (= ~gate1Failed_History_2~0 |old(~gate1Failed_History_2~0)|) (= |old(~gate1Failed~0)| ~gate1Failed~0) (= |old(~gate2Failed_History_1~0)| ~gate2Failed_History_1~0) (= ~g3v_new~0 |old(~g3v_new~0)|) (= |old(~gate3Failed_History_1~0)| ~gate3Failed_History_1~0) (= ~g2v_new~0 |old(~g2v_new~0)|) (= |old(~gate3Failed~0)| ~gate3Failed~0) (= |old(~gate3Failed_History_0~0)| ~gate3Failed_History_0~0) (= ~g3v_old~0 |old(~g3v_old~0)|) (= |old(~g3v~0)| ~g3v~0) (= |old(~votedValue_History_1~0)| ~votedValue_History_1~0) (= ~g1v_new~0 |old(~g1v_new~0)|) (= |old(~votedValue_History_0~0)| ~votedValue_History_0~0) (= ~g2v_old~0 |old(~g2v_old~0)|) (= |old(~VALUE2~0)| ~VALUE2~0) (= ~gate1Failed_History_1~0 |old(~gate1Failed_History_1~0)|) (= |old(~gate2Failed_History_0~0)| ~gate2Failed_History_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~VALUE1~0)| ~VALUE1~0) (= |old(~gate2Failed~0)| ~gate2Failed~0) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-01 00:10:25,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 00:10:25,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 00:10:25,498 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~votedValue_History_2~0 0) (= (select |#length| 3) 12) (= ~gate1Failed_History_0~0 0) (= 0 ~gate2Failed_History_1~0) (= ~gate1Failed_History_2~0 0) (= ~gate3Failed_History_2~0 0) (= ~g1v_old~0 0) (= ~gate3Failed_History_1~0 0) (= 51 (select |#length| 2)) (= ~g1v_new~0 0) (= ~votedValue_History_1~0 0) (= 0 ~gate2Failed_History_2~0) (= ~g3v_old~0 0) (= ~VALUE2~0 0) (= 2 (select |#length| 1)) (= ~gate1Failed~0 0) (= ~g2v~0 0) (= (select |#valid| 3) 1) (= ~gate3Failed_History_0~0 0) (= ~g3v_new~0 0) (= 0 ~gate2Failed_History_0~0) (= (select |#valid| 1) 1) (= ~gate1Failed_History_1~0 0) (= (+ ~nomsg~0 1) 0) (= ~gate2Failed~0 0) (= ~VALUE1~0 0) (= (select |#valid| 0) 0) (= ~g3v~0 0) (= ~g2v_old~0 0) (= (select |#valid| 2) 1) (= ~g1v~0 0) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= ~VALUE3~0 0) (= (select .cse0 1) 0) (= ~votedValue_History_0~0 0) (= ~gate3Failed~0 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~g2v_new~0 0))) [2023-04-01 00:10:25,498 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 00:10:25,498 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 00:10:25,499 INFO L899 garLoopResultBuilder]: For program point L448(lines 448 465) no Hoare annotation was computed. [2023-04-01 00:10:25,499 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-04-01 00:10:25,499 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 429 469) the Hoare annotation is: true [2023-04-01 00:10:25,499 INFO L899 garLoopResultBuilder]: For program point voterEXIT(lines 429 469) no Hoare annotation was computed. [2023-04-01 00:10:25,499 INFO L899 garLoopResultBuilder]: For program point L455(lines 455 465) no Hoare annotation was computed. [2023-04-01 00:10:25,499 INFO L899 garLoopResultBuilder]: For program point voterFINAL(lines 429 469) no Hoare annotation was computed. [2023-04-01 00:10:25,499 INFO L899 garLoopResultBuilder]: For program point L441(lines 441 465) no Hoare annotation was computed. [2023-04-01 00:10:25,499 INFO L902 garLoopResultBuilder]: At program point L464(line 464) the Hoare annotation is: true [2023-04-01 00:10:25,499 INFO L902 garLoopResultBuilder]: At program point L464-1(lines 441 465) the Hoare annotation is: true [2023-04-01 00:10:25,499 INFO L899 garLoopResultBuilder]: For program point L458(lines 458 465) no Hoare annotation was computed. [2023-04-01 00:10:25,502 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 00:10:25,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 00:10:25,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 12:10:25 BoogieIcfgContainer [2023-04-01 00:10:25,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 00:10:25,525 INFO L158 Benchmark]: Toolchain (without parser) took 39792.97ms. Allocated memory was 281.0MB in the beginning and 625.0MB in the end (delta: 343.9MB). Free memory was 234.9MB in the beginning and 473.8MB in the end (delta: -238.8MB). Peak memory consumption was 362.0MB. Max. memory is 8.0GB. [2023-04-01 00:10:25,525 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 00:10:25,525 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.76ms. Allocated memory is still 281.0MB. Free memory was 234.4MB in the beginning and 218.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-04-01 00:10:25,525 INFO L158 Benchmark]: Boogie Preprocessor took 85.78ms. Allocated memory is still 281.0MB. Free memory was 218.7MB in the beginning and 215.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-04-01 00:10:25,525 INFO L158 Benchmark]: RCFGBuilder took 1022.67ms. Allocated memory is still 281.0MB. Free memory was 215.6MB in the beginning and 247.6MB in the end (delta: -32.0MB). Peak memory consumption was 61.3MB. Max. memory is 8.0GB. [2023-04-01 00:10:25,529 INFO L158 Benchmark]: TraceAbstraction took 38345.93ms. Allocated memory was 281.0MB in the beginning and 625.0MB in the end (delta: 343.9MB). Free memory was 247.1MB in the beginning and 473.8MB in the end (delta: -226.7MB). Peak memory consumption was 373.1MB. Max. memory is 8.0GB. [2023-04-01 00:10:25,530 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 187.7MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 332.76ms. Allocated memory is still 281.0MB. Free memory was 234.4MB in the beginning and 218.7MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 85.78ms. Allocated memory is still 281.0MB. Free memory was 218.7MB in the beginning and 215.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1022.67ms. Allocated memory is still 281.0MB. Free memory was 215.6MB in the beginning and 247.6MB in the end (delta: -32.0MB). Peak memory consumption was 61.3MB. Max. memory is 8.0GB. * TraceAbstraction took 38345.93ms. Allocated memory was 281.0MB in the beginning and 625.0MB in the end (delta: 343.9MB). Free memory was 247.1MB in the beginning and 473.8MB in the end (delta: -226.7MB). Peak memory consumption was 373.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 531]: 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 16 procedures, 162 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.3s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 604 mSDsluCounter, 3561 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2427 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5289 IncrementalHoareTripleChecker+Invalid, 5463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 1134 mSDtfsCounter, 5289 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 327 SyntacticMatches, 10 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 20.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=7, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 58 LocationsWithAnnotation, 769 PreInvPairs, 780 NumberOfFragments, 4409 HoareAnnotationTreeSize, 769 FomulaSimplifications, 3255 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 58 FomulaSimplificationsInter, 4528 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 521 ConstructedInterpolants, 0 QuantifiedInterpolants, 673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1258 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 79/98 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: OVERALL_TIME: 3.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 18, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 116, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 172, TOOLS_POST_TIME: 1.3s, TOOLS_POST_CALL_APPLICATIONS: 78, TOOLS_POST_CALL_TIME: 1.2s, TOOLS_POST_RETURN_APPLICATIONS: 58, TOOLS_POST_RETURN_TIME: 0.9s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 308, TOOLS_QUANTIFIERELIM_TIME: 3.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 399, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 69, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 6, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 12, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 116, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 0.8s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.8s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 12, CALL_SUMMARIZER_APPLICATIONS: 58, CALL_SUMMARIZER_CACHE_MISSES: 9, CALL_SUMMARIZER_OVERALL_TIME: 0.4s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.4s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1194, DAG_COMPRESSION_RETAINED_NODES: 324, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((votedValue_History_0 + 128 < 0 || !(g3v_\old == 0)) || !(g3v_new == 0)) || !(g1v_new == 0)) || !(\old(history_id) == 0)) || votedValue_History_1 + 128 < 0) || !(#NULL == 0)) || !(g2v == 0)) || 127 < VALUE2) || unknown-#StackHeapBarrier-unknown < 0) || !(g2v_new == 0)) || !(g1v_\old == 0)) || VALUE3 + 128 < 0) || VALUE1 + 128 < 0) || !(g3v == 0)) || 127 < VALUE1) || 127 < VALUE3) || !(g2v_\old == 0)) || !(#NULL == 0)) || !(nomsg + 1 == 0)) || 127 < votedValue_History_0) || VALUE2 + 128 < 0) || votedValue_History_2 + 128 < 0) || !(g1v == 0)) || 127 < votedValue_History_2) || 127 < votedValue_History_1) && (((((((((((((((((((((((((votedValue_History_0 + 128 < 0 || !(g3v_\old == 0)) || !(g3v_new == 0)) || !(g1v_new == 0)) || votedValue_History_1 + 128 < 0) || !(#NULL == 0)) || !(g2v == 0)) || 127 < VALUE2) || unknown-#StackHeapBarrier-unknown < 0) || !(g2v_new == 0)) || !(g1v_\old == 0)) || VALUE3 + 128 < 0) || !(\old(history_id) == 1)) || VALUE1 + 128 < 0) || !(g3v == 0)) || 127 < VALUE1) || 127 < VALUE3) || !(g2v_\old == 0)) || !(#NULL == 0)) || !(nomsg + 1 == 0)) || 127 < votedValue_History_0) || VALUE2 + 128 < 0) || votedValue_History_2 + 128 < 0) || !(g1v == 0)) || 127 < votedValue_History_2) || 127 < votedValue_History_1)) || ((((0 <= var && ini_bool == 0) && 2 + ini_int == 0) && 0 <= history_id) && history_id <= 1)) && (((!(\old(history_id) == 0) || ((tmp == 0 && history_id == 0) && var <= 3)) || ((((((((((((((((((((((((((votedValue_History_0 + 128 < 0 || !(g3v_\old == 0)) || !(g3v_new == 0)) || !(g1v_new == 0)) || !(\old(history_id) == 0)) || votedValue_History_1 + 128 < 0) || !(#NULL == 0)) || !(g2v == 0)) || 127 < VALUE2) || unknown-#StackHeapBarrier-unknown < 0) || !(g2v_new == 0)) || !(g1v_\old == 0)) || VALUE3 + 128 < 0) || VALUE1 + 128 < 0) || !(g3v == 0)) || 127 < VALUE1) || 127 < VALUE3) || !(g2v_\old == 0)) || !(#NULL == 0)) || !(nomsg + 1 == 0)) || 127 < votedValue_History_0) || VALUE2 + 128 < 0) || votedValue_History_2 + 128 < 0) || !(g1v == 0)) || 127 < votedValue_History_2) || 127 < votedValue_History_1) && (((((((((((((((((((((((((votedValue_History_0 + 128 < 0 || !(g3v_\old == 0)) || !(g3v_new == 0)) || !(g1v_new == 0)) || votedValue_History_1 + 128 < 0) || !(#NULL == 0)) || !(g2v == 0)) || 127 < VALUE2) || unknown-#StackHeapBarrier-unknown < 0) || !(g2v_new == 0)) || !(g1v_\old == 0)) || VALUE3 + 128 < 0) || !(\old(history_id) == 1)) || VALUE1 + 128 < 0) || !(g3v == 0)) || 127 < VALUE1) || 127 < VALUE3) || !(g2v_\old == 0)) || !(#NULL == 0)) || !(nomsg + 1 == 0)) || 127 < votedValue_History_0) || VALUE2 + 128 < 0) || votedValue_History_2 + 128 < 0) || !(g1v == 0)) || 127 < votedValue_History_2) || 127 < votedValue_History_1))) || (var == 0 && history_id == 0)) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(\old(gate2Failed_History_2) == 0) || !(\old(gate1Failed_History_1) == 0)) || !(\old(gate2Failed_History_1) == 0)) || !(\old(gate1Failed) == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(g2v == 0)) || !(\old(votedValue_History_0) == 0)) || !(2 == unknown-#length-unknown[1])) || !(\old(g3v_new) == 0)) || !(\old(gate2Failed) == 0)) || !(\old(gate3Failed_History_2) == 0)) || !(\old(gate3Failed_History_0) == 0)) || !(\valid[3] == 1)) || !(\old(gate1Failed_History_2) == 0)) || !(\old(VALUE3) == 0)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(\old(VALUE1) == 0)) || !(g3v == 0)) || !(\valid[1] == 1)) || !(\old(votedValue_History_2) == 0)) || !(\old(VALUE2) == 0)) || !(\old(g3v_\old) == 0)) || !(\old(g1v_\old) == 0)) || !(#NULL == 0)) || !(nomsg + 1 == 0)) || !(\old(g2v_\old) == 0)) || !(\old(g2v_new) == 0)) || !(\old(g1v_new) == 0)) || !(\valid[2] == 1)) || !(\old(gate3Failed_History_1) == 0)) || !(51 == unknown-#length-unknown[2])) || !(g1v == 0)) || !(\old(gate1Failed_History_0) == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(votedValue_History_1) == 0)) || !(\old(gate3Failed) == 0)) || !(\old(gate2Failed_History_0) == 0) RESULT: Ultimate proved your program to be correct! [2023-04-01 00:10:25,553 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...