/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label48.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:48:01,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:48:01,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:48:01,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:48:01,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:48:01,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:48:01,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:48:01,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:48:01,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:48:01,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:48:01,853 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:48:01,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:48:01,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:48:01,860 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:48:01,861 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:48:01,862 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:48:01,863 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:48:01,864 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:48:01,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:48:01,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:48:01,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:48:01,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:48:01,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:48:01,872 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:48:01,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:48:01,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:48:01,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:48:01,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:48:01,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:48:01,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:48:01,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:48:01,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:48:01,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:48:01,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:48:01,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:48:01,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:48:01,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:48:01,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:48:01,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:48:01,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:48:01,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:48:01,888 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:48:01,920 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:48:01,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:48:01,921 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:48:01,921 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:48:01,922 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:48:01,923 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:48:01,923 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:48:01,923 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:48:01,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:48:01,923 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:48:01,924 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:48:01,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:48:01,924 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:48:01,924 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:48:01,924 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:48:01,925 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:48:01,925 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:48:01,925 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:48:01,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:48:01,925 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:48:01,925 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:48:01,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:48:01,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:48:01,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:48:01,927 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:48:01,927 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:48:01,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:48:01,927 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:48:01,927 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:48:01,927 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:48:01,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:48:01,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:48:01,928 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:48:01,929 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 21:48:02,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:48:02,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:48:02,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:48:02,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:48:02,149 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:48:02,150 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label48.c [2022-01-10 21:48:02,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736b76f76/8ecd1e5773934a148112a7f8a464e7ae/FLAG561105712 [2022-01-10 21:48:02,743 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:48:02,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label48.c [2022-01-10 21:48:02,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736b76f76/8ecd1e5773934a148112a7f8a464e7ae/FLAG561105712 [2022-01-10 21:48:03,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736b76f76/8ecd1e5773934a148112a7f8a464e7ae [2022-01-10 21:48:03,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:48:03,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:48:03,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:48:03,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:48:03,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:48:03,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5db2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03, skipping insertion in model container [2022-01-10 21:48:03,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:48:03,117 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:48:03,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label48.c[20593,20606] [2022-01-10 21:48:03,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:48:03,421 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:48:03,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label48.c[20593,20606] [2022-01-10 21:48:03,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:48:03,531 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:48:03,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03 WrapperNode [2022-01-10 21:48:03,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:48:03,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:48:03,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:48:03,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:48:03,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,638 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-10 21:48:03,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:48:03,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:48:03,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:48:03,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:48:03,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,651 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:48:03,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:48:03,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:48:03,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:48:03,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (1/1) ... [2022-01-10 21:48:03,733 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:48:03,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:48:03,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 21:48:03,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 21:48:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:48:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:48:03,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:48:03,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:48:03,880 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:48:03,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:48:04,897 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:48:04,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:48:04,909 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:48:04,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:48:04 BoogieIcfgContainer [2022-01-10 21:48:04,912 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:48:04,912 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:48:04,912 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:48:04,913 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:48:04,916 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:48:04" (1/1) ... [2022-01-10 21:48:05,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:48:05 BasicIcfg [2022-01-10 21:48:05,144 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:48:05,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:48:05,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:48:05,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:48:05,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:48:03" (1/4) ... [2022-01-10 21:48:05,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bdb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:48:05, skipping insertion in model container [2022-01-10 21:48:05,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:48:03" (2/4) ... [2022-01-10 21:48:05,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bdb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:48:05, skipping insertion in model container [2022-01-10 21:48:05,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:48:04" (3/4) ... [2022-01-10 21:48:05,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8bdb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:48:05, skipping insertion in model container [2022-01-10 21:48:05,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:48:05" (4/4) ... [2022-01-10 21:48:05,150 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label48.cTransformedIcfg [2022-01-10 21:48:05,155 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:48:05,155 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:48:05,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:48:05,213 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 21:48:05,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:48:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 21:48:05,246 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:05,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:05,247 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:05,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:05,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1433725059, now seen corresponding path program 1 times [2022-01-10 21:48:05,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:05,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320472143] [2022-01-10 21:48:05,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:05,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:48:05,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:05,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320472143] [2022-01-10 21:48:05,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320472143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:05,820 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:05,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:05,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926591214] [2022-01-10 21:48:05,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:05,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:05,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:05,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:05,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:05,863 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 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) Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:06,633 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-01-10 21:48:06,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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) Word has length 121 [2022-01-10 21:48:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:06,645 INFO L225 Difference]: With dead ends: 528 [2022-01-10 21:48:06,646 INFO L226 Difference]: Without dead ends: 266 [2022-01-10 21:48:06,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:06,652 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 51 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:06,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 21:48:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-10 21:48:06,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-10 21:48:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2022-01-10 21:48:06,714 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 121 [2022-01-10 21:48:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:06,715 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2022-01-10 21:48:06,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2022-01-10 21:48:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-10 21:48:06,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:06,724 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:06,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:48:06,724 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:06,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1775241254, now seen corresponding path program 1 times [2022-01-10 21:48:06,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:06,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988801040] [2022-01-10 21:48:06,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:06,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:48:06,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:06,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988801040] [2022-01-10 21:48:06,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988801040] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:06,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:06,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:06,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836251472] [2022-01-10 21:48:06,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:06,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:06,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:06,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:06,841 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:07,374 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2022-01-10 21:48:07,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 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) Word has length 127 [2022-01-10 21:48:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:07,378 INFO L225 Difference]: With dead ends: 792 [2022-01-10 21:48:07,378 INFO L226 Difference]: Without dead ends: 528 [2022-01-10 21:48:07,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:07,380 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:07,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 17 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:48:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-10 21:48:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-10 21:48:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.413662239089184) internal successors, (745), 527 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 745 transitions. [2022-01-10 21:48:07,399 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 745 transitions. Word has length 127 [2022-01-10 21:48:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:07,399 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 745 transitions. [2022-01-10 21:48:07,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 745 transitions. [2022-01-10 21:48:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 21:48:07,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:07,402 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:07,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:48:07,402 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash -393104271, now seen corresponding path program 1 times [2022-01-10 21:48:07,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:07,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393641361] [2022-01-10 21:48:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:07,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:48:07,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:07,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393641361] [2022-01-10 21:48:07,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393641361] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:07,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:07,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:07,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061625630] [2022-01-10 21:48:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:07,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:48:07,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:48:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:07,659 INFO L87 Difference]: Start difference. First operand 528 states and 745 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:08,423 INFO L93 Difference]: Finished difference Result 1542 states and 2206 transitions. [2022-01-10 21:48:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:48:08,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 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) Word has length 128 [2022-01-10 21:48:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:08,431 INFO L225 Difference]: With dead ends: 1542 [2022-01-10 21:48:08,431 INFO L226 Difference]: Without dead ends: 921 [2022-01-10 21:48:08,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:08,433 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 130 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:08,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 81 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 21:48:08,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-10 21:48:08,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 790. [2022-01-10 21:48:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.1964512040557669) internal successors, (944), 789 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 944 transitions. [2022-01-10 21:48:08,455 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 944 transitions. Word has length 128 [2022-01-10 21:48:08,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:08,455 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 944 transitions. [2022-01-10 21:48:08,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,455 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 944 transitions. [2022-01-10 21:48:08,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-10 21:48:08,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:08,457 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:08,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:48:08,458 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:08,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:08,458 INFO L85 PathProgramCache]: Analyzing trace with hash -951190217, now seen corresponding path program 1 times [2022-01-10 21:48:08,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:08,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405521907] [2022-01-10 21:48:08,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:08,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:08,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 21:48:08,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:08,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405521907] [2022-01-10 21:48:08,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405521907] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:08,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:08,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:48:08,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232210597] [2022-01-10 21:48:08,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:08,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:08,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:08,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:08,529 INFO L87 Difference]: Start difference. First operand 790 states and 944 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:08,940 INFO L93 Difference]: Finished difference Result 1709 states and 2069 transitions. [2022-01-10 21:48:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:08,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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) Word has length 133 [2022-01-10 21:48:08,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:08,945 INFO L225 Difference]: With dead ends: 1709 [2022-01-10 21:48:08,945 INFO L226 Difference]: Without dead ends: 1052 [2022-01-10 21:48:08,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:08,947 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:08,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 46 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-01-10 21:48:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2022-01-10 21:48:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.1693625118934348) internal successors, (1229), 1051 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1229 transitions. [2022-01-10 21:48:08,968 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1229 transitions. Word has length 133 [2022-01-10 21:48:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:08,968 INFO L470 AbstractCegarLoop]: Abstraction has 1052 states and 1229 transitions. [2022-01-10 21:48:08,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1229 transitions. [2022-01-10 21:48:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-10 21:48:08,971 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:08,971 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:08,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:48:08,971 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1414240931, now seen corresponding path program 1 times [2022-01-10 21:48:08,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812224289] [2022-01-10 21:48:08,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:08,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 21:48:09,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812224289] [2022-01-10 21:48:09,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812224289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:09,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:09,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:09,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015462639] [2022-01-10 21:48:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:09,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:09,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:09,078 INFO L87 Difference]: Start difference. First operand 1052 states and 1229 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:09,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:09,545 INFO L93 Difference]: Finished difference Result 2233 states and 2616 transitions. [2022-01-10 21:48:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:09,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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) Word has length 148 [2022-01-10 21:48:09,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:09,549 INFO L225 Difference]: With dead ends: 2233 [2022-01-10 21:48:09,549 INFO L226 Difference]: Without dead ends: 1314 [2022-01-10 21:48:09,550 INFO L932 BasicCegarLoop]: 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 [2022-01-10 21:48:09,551 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 124 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:09,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 191 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-01-10 21:48:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2022-01-10 21:48:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1328257191201354) internal successors, (1339), 1182 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1339 transitions. [2022-01-10 21:48:09,579 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1339 transitions. Word has length 148 [2022-01-10 21:48:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:09,580 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1339 transitions. [2022-01-10 21:48:09,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1339 transitions. [2022-01-10 21:48:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 21:48:09,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:09,591 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:09,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:48:09,591 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:09,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:09,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1354485173, now seen corresponding path program 1 times [2022-01-10 21:48:09,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:09,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408827309] [2022-01-10 21:48:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:09,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 21:48:09,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:09,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408827309] [2022-01-10 21:48:09,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408827309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:09,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:09,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:09,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607698137] [2022-01-10 21:48:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:09,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:09,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:09,706 INFO L87 Difference]: Start difference. First operand 1183 states and 1339 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:10,153 INFO L93 Difference]: Finished difference Result 2626 states and 3011 transitions. [2022-01-10 21:48:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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) Word has length 162 [2022-01-10 21:48:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:10,161 INFO L225 Difference]: With dead ends: 2626 [2022-01-10 21:48:10,161 INFO L226 Difference]: Without dead ends: 1445 [2022-01-10 21:48:10,162 INFO L932 BasicCegarLoop]: 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 [2022-01-10 21:48:10,163 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 124 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:10,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 186 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2022-01-10 21:48:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2022-01-10 21:48:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.1198060941828254) internal successors, (1617), 1444 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1617 transitions. [2022-01-10 21:48:10,186 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1617 transitions. Word has length 162 [2022-01-10 21:48:10,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:10,186 INFO L470 AbstractCegarLoop]: Abstraction has 1445 states and 1617 transitions. [2022-01-10 21:48:10,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1617 transitions. [2022-01-10 21:48:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 21:48:10,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:10,190 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:10,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:48:10,190 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1103275506, now seen corresponding path program 1 times [2022-01-10 21:48:10,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:10,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152772872] [2022-01-10 21:48:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:10,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 21:48:10,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:10,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152772872] [2022-01-10 21:48:10,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152772872] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:10,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:10,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:10,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229311453] [2022-01-10 21:48:10,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:10,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:10,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:10,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:10,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:10,278 INFO L87 Difference]: Start difference. First operand 1445 states and 1617 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:10,710 INFO L93 Difference]: Finished difference Result 3281 states and 3685 transitions. [2022-01-10 21:48:10,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:10,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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) Word has length 165 [2022-01-10 21:48:10,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:10,716 INFO L225 Difference]: With dead ends: 3281 [2022-01-10 21:48:10,716 INFO L226 Difference]: Without dead ends: 1838 [2022-01-10 21:48:10,720 INFO L932 BasicCegarLoop]: 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 [2022-01-10 21:48:10,720 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:10,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 42 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-01-10 21:48:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2022-01-10 21:48:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.1212698412698412) internal successors, (1766), 1575 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1766 transitions. [2022-01-10 21:48:10,747 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1766 transitions. Word has length 165 [2022-01-10 21:48:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:10,748 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1766 transitions. [2022-01-10 21:48:10,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1766 transitions. [2022-01-10 21:48:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-01-10 21:48:10,752 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:10,752 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:10,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:48:10,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:10,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -169444644, now seen corresponding path program 1 times [2022-01-10 21:48:10,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:10,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131912306] [2022-01-10 21:48:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:10,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-01-10 21:48:10,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:10,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131912306] [2022-01-10 21:48:10,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131912306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:10,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:10,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:10,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745942562] [2022-01-10 21:48:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:10,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:48:10,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:48:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:10,900 INFO L87 Difference]: Start difference. First operand 1576 states and 1766 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:11,587 INFO L93 Difference]: Finished difference Result 3543 states and 4009 transitions. [2022-01-10 21:48:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:48:11,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 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) Word has length 211 [2022-01-10 21:48:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:11,593 INFO L225 Difference]: With dead ends: 3543 [2022-01-10 21:48:11,593 INFO L226 Difference]: Without dead ends: 1969 [2022-01-10 21:48:11,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:11,596 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 263 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:11,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 58 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 21:48:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-10 21:48:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2022-01-10 21:48:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1270325203252032) internal successors, (2218), 1968 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2218 transitions. [2022-01-10 21:48:11,638 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2218 transitions. Word has length 211 [2022-01-10 21:48:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:11,639 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2218 transitions. [2022-01-10 21:48:11,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2218 transitions. [2022-01-10 21:48:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-01-10 21:48:11,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:11,643 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:11,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:48:11,644 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1193141430, now seen corresponding path program 1 times [2022-01-10 21:48:11,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:11,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089084932] [2022-01-10 21:48:11,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:11,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:48:11,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:11,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089084932] [2022-01-10 21:48:11,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089084932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:11,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:11,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:48:11,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625587032] [2022-01-10 21:48:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:11,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:48:11,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:48:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:48:11,915 INFO L87 Difference]: Start difference. First operand 1969 states and 2218 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:13,057 INFO L93 Difference]: Finished difference Result 5066 states and 5713 transitions. [2022-01-10 21:48:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 21:48:13,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 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) Word has length 225 [2022-01-10 21:48:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:13,070 INFO L225 Difference]: With dead ends: 5066 [2022-01-10 21:48:13,070 INFO L226 Difference]: Without dead ends: 3017 [2022-01-10 21:48:13,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:48:13,078 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 481 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:13,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 50 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 21:48:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2022-01-10 21:48:13,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2231. [2022-01-10 21:48:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.0959641255605381) internal successors, (2444), 2230 states have internal predecessors, (2444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2444 transitions. [2022-01-10 21:48:13,123 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2444 transitions. Word has length 225 [2022-01-10 21:48:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:13,123 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2444 transitions. [2022-01-10 21:48:13,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:13,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2444 transitions. [2022-01-10 21:48:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-01-10 21:48:13,131 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:13,131 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:13,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:48:13,131 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:13,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2082278355, now seen corresponding path program 1 times [2022-01-10 21:48:13,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:13,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392553036] [2022-01-10 21:48:13,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:13,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:48:13,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:13,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392553036] [2022-01-10 21:48:13,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392553036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:13,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:13,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 21:48:13,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194043335] [2022-01-10 21:48:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:13,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 21:48:13,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 21:48:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 21:48:13,393 INFO L87 Difference]: Start difference. First operand 2231 states and 2444 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 5 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:14,434 INFO L93 Difference]: Finished difference Result 5431 states and 5910 transitions. [2022-01-10 21:48:14,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 21:48:14,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 5 states have internal predecessors, (244), 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) Word has length 244 [2022-01-10 21:48:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:14,445 INFO L225 Difference]: With dead ends: 5431 [2022-01-10 21:48:14,445 INFO L226 Difference]: Without dead ends: 3202 [2022-01-10 21:48:14,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-10 21:48:14,448 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 383 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:14,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 69 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 21:48:14,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2022-01-10 21:48:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 2362. [2022-01-10 21:48:14,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.0923337568826768) internal successors, (2579), 2361 states have internal predecessors, (2579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2579 transitions. [2022-01-10 21:48:14,510 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2579 transitions. Word has length 244 [2022-01-10 21:48:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:14,511 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2579 transitions. [2022-01-10 21:48:14,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 5 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2579 transitions. [2022-01-10 21:48:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-01-10 21:48:14,516 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:14,516 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:14,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:48:14,517 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:14,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:14,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1795318050, now seen corresponding path program 1 times [2022-01-10 21:48:14,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:14,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582864395] [2022-01-10 21:48:14,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:14,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-01-10 21:48:14,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:14,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582864395] [2022-01-10 21:48:14,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582864395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:14,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:14,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:14,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802651579] [2022-01-10 21:48:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:14,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:48:14,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:48:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:14,759 INFO L87 Difference]: Start difference. First operand 2362 states and 2579 transitions. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:15,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:15,165 INFO L93 Difference]: Finished difference Result 4800 states and 5237 transitions. [2022-01-10 21:48:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:48:15,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 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) Word has length 244 [2022-01-10 21:48:15,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:15,174 INFO L225 Difference]: With dead ends: 4800 [2022-01-10 21:48:15,174 INFO L226 Difference]: Without dead ends: 2362 [2022-01-10 21:48:15,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:15,177 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 118 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:15,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 16 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-01-10 21:48:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-01-10 21:48:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.0910631088521814) internal successors, (2576), 2361 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2576 transitions. [2022-01-10 21:48:15,260 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2576 transitions. Word has length 244 [2022-01-10 21:48:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:15,261 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2576 transitions. [2022-01-10 21:48:15,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2576 transitions. [2022-01-10 21:48:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-01-10 21:48:15,266 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:15,266 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:15,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:48:15,266 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1304436179, now seen corresponding path program 1 times [2022-01-10 21:48:15,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:15,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367269259] [2022-01-10 21:48:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:15,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:15,462 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-01-10 21:48:15,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:15,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367269259] [2022-01-10 21:48:15,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367269259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:15,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:15,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:15,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079302878] [2022-01-10 21:48:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:15,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:48:15,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:15,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:48:15,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:48:15,464 INFO L87 Difference]: Start difference. First operand 2362 states and 2576 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:15,871 INFO L93 Difference]: Finished difference Result 4984 states and 5420 transitions. [2022-01-10 21:48:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:48:15,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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) Word has length 247 [2022-01-10 21:48:15,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:15,878 INFO L225 Difference]: With dead ends: 4984 [2022-01-10 21:48:15,878 INFO L226 Difference]: Without dead ends: 2362 [2022-01-10 21:48:15,881 INFO L932 BasicCegarLoop]: 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 [2022-01-10 21:48:15,881 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 20 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:15,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-01-10 21:48:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-01-10 21:48:15,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.0660736975857688) internal successors, (2517), 2361 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2517 transitions. [2022-01-10 21:48:15,920 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2517 transitions. Word has length 247 [2022-01-10 21:48:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:15,920 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2517 transitions. [2022-01-10 21:48:15,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2517 transitions. [2022-01-10 21:48:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-01-10 21:48:15,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:15,928 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:15,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:48:15,928 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash 761036564, now seen corresponding path program 1 times [2022-01-10 21:48:15,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:15,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198038598] [2022-01-10 21:48:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:15,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-01-10 21:48:16,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:16,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198038598] [2022-01-10 21:48:16,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198038598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:16,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:16,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:16,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163689999] [2022-01-10 21:48:16,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:16,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:48:16,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:16,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:48:16,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:16,213 INFO L87 Difference]: Start difference. First operand 2362 states and 2517 transitions. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:16,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:16,615 INFO L93 Difference]: Finished difference Result 4670 states and 4993 transitions. [2022-01-10 21:48:16,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:48:16,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 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) Word has length 266 [2022-01-10 21:48:16,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:16,624 INFO L225 Difference]: With dead ends: 4670 [2022-01-10 21:48:16,624 INFO L226 Difference]: Without dead ends: 2362 [2022-01-10 21:48:16,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:16,627 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 115 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:16,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 16 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2022-01-10 21:48:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2362. [2022-01-10 21:48:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.0648030495552732) internal successors, (2514), 2361 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2514 transitions. [2022-01-10 21:48:16,664 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2514 transitions. Word has length 266 [2022-01-10 21:48:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:16,665 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2514 transitions. [2022-01-10 21:48:16,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2514 transitions. [2022-01-10 21:48:16,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2022-01-10 21:48:16,669 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:16,669 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:16,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:48:16,670 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:16,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1613484850, now seen corresponding path program 1 times [2022-01-10 21:48:16,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:16,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064393125] [2022-01-10 21:48:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:16,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-01-10 21:48:16,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:16,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064393125] [2022-01-10 21:48:16,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064393125] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:16,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:16,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 21:48:16,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824923927] [2022-01-10 21:48:16,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:16,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 21:48:16,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 21:48:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:48:16,973 INFO L87 Difference]: Start difference. First operand 2362 states and 2514 transitions. Second operand has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:17,520 INFO L93 Difference]: Finished difference Result 4793 states and 5118 transitions. [2022-01-10 21:48:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 21:48:17,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 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) Word has length 287 [2022-01-10 21:48:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:17,525 INFO L225 Difference]: With dead ends: 4793 [2022-01-10 21:48:17,526 INFO L226 Difference]: Without dead ends: 2493 [2022-01-10 21:48:17,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 21:48:17,529 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 200 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:17,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 22 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 21:48:17,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2022-01-10 21:48:17,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2362. [2022-01-10 21:48:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.0618382041507837) internal successors, (2507), 2361 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2507 transitions. [2022-01-10 21:48:17,591 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2507 transitions. Word has length 287 [2022-01-10 21:48:17,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:17,592 INFO L470 AbstractCegarLoop]: Abstraction has 2362 states and 2507 transitions. [2022-01-10 21:48:17,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.8) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2507 transitions. [2022-01-10 21:48:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-01-10 21:48:17,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:48:17,597 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:17,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:48:17,597 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:48:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:48:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2099529325, now seen corresponding path program 1 times [2022-01-10 21:48:17,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:48:17,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927657652] [2022-01-10 21:48:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:48:17,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:48:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:48:17,867 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-01-10 21:48:17,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:48:17,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927657652] [2022-01-10 21:48:17,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927657652] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:48:17,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:48:17,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:48:17,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900641571] [2022-01-10 21:48:17,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:48:17,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:48:17,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:48:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:48:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:17,870 INFO L87 Difference]: Start difference. First operand 2362 states and 2507 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:48:18,243 INFO L93 Difference]: Finished difference Result 4539 states and 4826 transitions. [2022-01-10 21:48:18,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:48:18,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 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) Word has length 305 [2022-01-10 21:48:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:48:18,244 INFO L225 Difference]: With dead ends: 4539 [2022-01-10 21:48:18,244 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 21:48:18,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:48:18,246 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 101 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 21:48:18,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 14 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 21:48:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 21:48:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 21:48:18,247 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) [2022-01-10 21:48:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 21:48:18,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2022-01-10 21:48:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:48:18,247 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 21:48:18,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:48:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 21:48:18,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 21:48:18,250 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 21:48:18,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:48:18,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 21:48:19,650 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 21:48:19,651 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 21:48:19,651 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse14 (= ~a7~0Int 1))) (let ((.cse8 (<= 5 ~a16~0Int)) (.cse9 (<= ~a16~0Int 5)) (.cse13 (= 5 ~a16~0Int)) (.cse0 (<= ~a16~0Int 4)) (.cse1 (<= ~a17~0Int 0)) (.cse10 (<= ~a8~0Int 13)) (.cse5 (<= 6 ~a16~0Int)) (.cse7 (not .cse14)) (.cse11 (= ~a8~0Int 15)) (.cse2 (= ~a21~0Int 1)) (.cse6 (= ~a17~0Int 1)) (.cse12 (= ~a8~0Int 14)) (.cse4 (= ~a20~0Int 1)) (.cse3 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (and .cse2 (<= 15 ~a8~0Int) .cse4) (and .cse5 .cse2 .cse6 .cse4)) .cse7 .cse8 .cse6 .cse3) (and .cse9 .cse2 .cse7 .cse10 .cse3) (and .cse1 .cse2 .cse7 .cse11 .cse3) (and .cse9 .cse2 .cse8 .cse11 .cse3) (and (not .cse4) .cse9 .cse1 .cse2 .cse7 .cse3) (and .cse9 .cse6 .cse10 .cse3) (and .cse2 (<= ~a20~0Int 0) .cse12 .cse13 .cse3 (= ~a17~0Int 0)) (and .cse1 .cse2 .cse12 .cse4 .cse13 .cse3 .cse14) (and .cse2 .cse7 .cse11 .cse6 .cse3) (and .cse5 .cse10 .cse4 .cse3) (and .cse0 .cse1 .cse10 .cse4 .cse3) (and .cse5 .cse2 .cse7 .cse11 .cse4 .cse3) (and .cse2 (= ~a7~0Int 0) .cse6 .cse12 (= ~a16~0Int 4) .cse4 .cse3)))) [2022-01-10 21:48:19,651 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-10 21:48:19,651 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-10 21:48:19,651 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 21:48:19,651 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-10 21:48:19,651 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse14 (= ~a7~0Int 1))) (let ((.cse8 (<= 5 ~a16~0Int)) (.cse9 (<= ~a16~0Int 5)) (.cse13 (= 5 ~a16~0Int)) (.cse0 (<= ~a16~0Int 4)) (.cse1 (<= ~a17~0Int 0)) (.cse10 (<= ~a8~0Int 13)) (.cse5 (<= 6 ~a16~0Int)) (.cse7 (not .cse14)) (.cse11 (= ~a8~0Int 15)) (.cse2 (= ~a21~0Int 1)) (.cse6 (= ~a17~0Int 1)) (.cse12 (= ~a8~0Int 14)) (.cse4 (= ~a20~0Int 1)) (.cse3 (= ~a12~0Int 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (and .cse2 (<= 15 ~a8~0Int) .cse4) (and .cse5 .cse2 .cse6 .cse4)) .cse7 .cse8 .cse6 .cse3) (and .cse9 .cse2 .cse7 .cse10 .cse3) (and .cse1 .cse2 .cse7 .cse11 .cse3) (and .cse9 .cse2 .cse8 .cse11 .cse3) (and (not .cse4) .cse9 .cse1 .cse2 .cse7 .cse3) (and .cse9 .cse6 .cse10 .cse3) (and .cse2 (<= ~a20~0Int 0) .cse12 .cse13 .cse3 (= ~a17~0Int 0)) (and .cse1 .cse2 .cse12 .cse4 .cse13 .cse3 .cse14) (and .cse2 .cse7 .cse11 .cse6 .cse3) (and .cse5 .cse10 .cse4 .cse3) (and .cse0 .cse1 .cse10 .cse4 .cse3) (and .cse5 .cse2 .cse7 .cse11 .cse4 .cse3) (and .cse2 (= ~a7~0Int 0) .cse6 .cse12 (= ~a16~0Int 4) .cse4 .cse3)))) [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-10 21:48:19,652 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-10 21:48:19,653 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-10 21:48:19,653 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-10 21:48:19,653 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-10 21:48:19,653 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-10 21:48:19,653 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-10 21:48:19,653 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-10 21:48:19,654 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-10 21:48:19,655 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-10 21:48:19,656 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-10 21:48:19,657 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-10 21:48:19,658 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,659 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,660 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-10 21:48:19,661 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-10 21:48:19,662 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,663 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-10 21:48:19,664 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 549) no Hoare annotation was computed. [2022-01-10 21:48:19,665 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-10 21:48:19,666 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-10 21:48:19,667 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-10 21:48:19,670 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:48:19,671 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 21:48:19,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:48:19 BasicIcfg [2022-01-10 21:48:19,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 21:48:19,695 INFO L158 Benchmark]: Toolchain (without parser) took 16632.63ms. Allocated memory was 195.0MB in the beginning and 354.4MB in the end (delta: 159.4MB). Free memory was 145.1MB in the beginning and 131.2MB in the end (delta: 13.9MB). Peak memory consumption was 190.0MB. Max. memory is 8.0GB. [2022-01-10 21:48:19,695 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 21:48:19,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.41ms. Allocated memory is still 195.0MB. Free memory was 144.9MB in the beginning and 156.0MB in the end (delta: -11.1MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-01-10 21:48:19,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.78ms. Allocated memory is still 195.0MB. Free memory was 156.0MB in the beginning and 150.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 21:48:19,696 INFO L158 Benchmark]: Boogie Preprocessor took 63.75ms. Allocated memory is still 195.0MB. Free memory was 150.2MB in the beginning and 146.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 21:48:19,696 INFO L158 Benchmark]: RCFGBuilder took 1204.49ms. Allocated memory is still 195.0MB. Free memory was 145.9MB in the beginning and 144.4MB in the end (delta: 1.5MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. [2022-01-10 21:48:19,696 INFO L158 Benchmark]: IcfgTransformer took 231.53ms. Allocated memory is still 195.0MB. Free memory was 144.4MB in the beginning and 107.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-01-10 21:48:19,696 INFO L158 Benchmark]: TraceAbstraction took 14548.93ms. Allocated memory was 195.0MB in the beginning and 354.4MB in the end (delta: 159.4MB). Free memory was 107.7MB in the beginning and 131.2MB in the end (delta: -23.5MB). Peak memory consumption was 153.7MB. Max. memory is 8.0GB. [2022-01-10 21:48:19,698 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory was 164.0MB in the beginning and 163.9MB in the end (delta: 79.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.41ms. Allocated memory is still 195.0MB. Free memory was 144.9MB in the beginning and 156.0MB in the end (delta: -11.1MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 105.78ms. Allocated memory is still 195.0MB. Free memory was 156.0MB in the beginning and 150.2MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.75ms. Allocated memory is still 195.0MB. Free memory was 150.2MB in the beginning and 146.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1204.49ms. Allocated memory is still 195.0MB. Free memory was 145.9MB in the beginning and 144.4MB in the end (delta: 1.5MB). Peak memory consumption was 39.2MB. Max. memory is 8.0GB. * IcfgTransformer took 231.53ms. Allocated memory is still 195.0MB. Free memory was 144.4MB in the beginning and 107.7MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 14548.93ms. Allocated memory was 195.0MB in the beginning and 354.4MB in the end (delta: 159.4MB). Free memory was 107.7MB in the beginning and 131.2MB in the end (delta: -23.5MB). Peak memory consumption was 153.7MB. 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: 549]: 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 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2517 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2517 mSDsluCounter, 1064 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 874 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7350 IncrementalHoareTripleChecker+Invalid, 8224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 874 mSolverCounterUnsat, 920 mSDtfsCounter, 7350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2362occurred in iteration=10, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 2281 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 55 NumberOfFragments, 531 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2470 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6608 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3013 NumberOfCodeBlocks, 3013 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2998 ConstructedInterpolants, 0 QuantifiedInterpolants, 26890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 2097/2097 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: ((((((((((((((((8bv32 == a12 && !(a7 == 1bv32)) && a8 == 15bv32) && ~bvule32(a17, 0bv32)) && 1bv32 == a21) || ((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 4bv32)) && ~bvule32(a17, 0bv32))) || ((((8bv32 == a12 && !(a7 == 1bv32)) && a8 == 15bv32) && 1bv32 == a17) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && (((1bv32 == a20 && ~bvule32(15bv32, a8)) && 1bv32 == a21) || (((1bv32 == a20 && ~bvule32(6bv32, a16)) && 1bv32 == a17) && 1bv32 == a21))) && 1bv32 == a17) && ~bvule32(5bv32, a16))) || (((((8bv32 == a12 && 0bv32 == a17) && 14bv32 == a8) && ~bvule32(a20, 0bv32)) && 5bv32 == a16) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((((1bv32 == a20 && 8bv32 == a12) && !(a7 == 1bv32)) && a8 == 15bv32) && ~bvule32(6bv32, a16)) && 1bv32 == a21)) || (((((8bv32 == a12 && !(a7 == 1bv32)) && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && ~bvule32(6bv32, a16))) || (((8bv32 == a12 && ~bvule32(a16, 4bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && a8 == 15bv32) && ~bvule32(a16, 5bv32)) && ~bvule32(5bv32, a16)) && 1bv32 == a21)) || ((((((1bv32 == a20 && 8bv32 == a12) && 4bv32 == a16) && a7 == 0bv32) && 14bv32 == a8) && 1bv32 == a17) && 1bv32 == a21)) || (((8bv32 == a12 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17)) || ((((((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && 14bv32 == a8) && ~bvule32(a17, 0bv32)) && 5bv32 == a16) && 1bv32 == a21) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((((((((8bv32 == a12 && !(a7 == 1bv32)) && a8 == 15bv32) && ~bvule32(a17, 0bv32)) && 1bv32 == a21) || ((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 4bv32)) && ~bvule32(a17, 0bv32))) || ((((8bv32 == a12 && !(a7 == 1bv32)) && a8 == 15bv32) && 1bv32 == a17) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && (((1bv32 == a20 && ~bvule32(15bv32, a8)) && 1bv32 == a21) || (((1bv32 == a20 && ~bvule32(6bv32, a16)) && 1bv32 == a17) && 1bv32 == a21))) && 1bv32 == a17) && ~bvule32(5bv32, a16))) || (((((8bv32 == a12 && 0bv32 == a17) && 14bv32 == a8) && ~bvule32(a20, 0bv32)) && 5bv32 == a16) && 1bv32 == a21)) || ((((8bv32 == a12 && !(a7 == 1bv32)) && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((((1bv32 == a20 && 8bv32 == a12) && !(a7 == 1bv32)) && a8 == 15bv32) && ~bvule32(6bv32, a16)) && 1bv32 == a21)) || (((((8bv32 == a12 && !(a7 == 1bv32)) && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a8, 13bv32)) && ~bvule32(6bv32, a16))) || (((8bv32 == a12 && ~bvule32(a16, 4bv32)) && ~bvule32(a17, 0bv32)) && 1bv32 == a21)) || ((((8bv32 == a12 && a8 == 15bv32) && ~bvule32(a16, 5bv32)) && ~bvule32(5bv32, a16)) && 1bv32 == a21)) || ((((((1bv32 == a20 && 8bv32 == a12) && 4bv32 == a16) && a7 == 0bv32) && 14bv32 == a8) && 1bv32 == a17) && 1bv32 == a21)) || (((8bv32 == a12 && ~bvule32(a8, 13bv32)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17)) || ((((((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && 14bv32 == a8) && ~bvule32(a17, 0bv32)) && 5bv32 == a16) && 1bv32 == a21) RESULT: Ultimate proved your program to be correct! [2022-01-10 21:48:19,742 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...