/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_LAZY.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label49.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:58:19,029 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:58:19,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:58:19,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:58:19,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:58:19,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:58:19,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:58:19,096 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:58:19,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:58:19,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:58:19,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:58:19,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:58:19,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:58:19,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:58:19,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:58:19,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:58:19,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:58:19,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:58:19,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:58:19,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:58:19,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:58:19,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:58:19,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:58:19,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:58:19,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:58:19,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:58:19,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:58:19,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:58:19,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:58:19,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:58:19,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:58:19,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:58:19,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:58:19,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:58:19,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:58:19,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:58:19,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:58:19,130 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:58:19,130 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:58:19,131 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:58:19,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:58:19,133 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:58:19,162 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:58:19,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:58:19,163 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:58:19,163 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:58:19,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:58:19,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:58:19,164 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:58:19,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:58:19,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:58:19,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:58:19,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:58:19,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:58:19,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:58:19,166 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:58:19,166 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:58:19,166 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:58:19,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:58:19,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:58:19,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:58:19,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:58:19,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:58:19,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:58:19,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:58:19,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:58:19,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:58:19,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:58:19,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:58:19,168 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:58:19,169 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:58:19,169 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:58:19,169 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:58:19,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:58:19,170 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:58:19,170 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 15:58:19,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:58:19,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:58:19,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:58:19,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:58:19,393 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:58:19,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label49.c [2022-01-10 15:58:19,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138f09766/c7c11ae47223490d954550c401a3178f/FLAG9150792f5 [2022-01-10 15:58:20,003 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:58:20,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label49.c [2022-01-10 15:58:20,019 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138f09766/c7c11ae47223490d954550c401a3178f/FLAG9150792f5 [2022-01-10 15:58:20,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138f09766/c7c11ae47223490d954550c401a3178f [2022-01-10 15:58:20,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:58:20,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:58:20,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:58:20,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:58:20,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:58:20,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7218d58c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20, skipping insertion in model container [2022-01-10 15:58:20,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:58:20,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:58:20,658 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_label49.c[18854,18867] [2022-01-10 15:58:20,698 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:58:20,722 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:58:20,797 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_label49.c[18854,18867] [2022-01-10 15:58:20,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:58:20,830 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:58:20,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20 WrapperNode [2022-01-10 15:58:20,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:58:20,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:58:20,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:58:20,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:58:20,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,926 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2022-01-10 15:58:20,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:58:20,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:58:20,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:58:20,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:58:20,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,947 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,947 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:20,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:21,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:58:21,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:58:21,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:58:21,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:58:21,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (1/1) ... [2022-01-10 15:58:21,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:58:21,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:58:21,064 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 15:58:21,084 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 15:58:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:58:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:58:21,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:58:21,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:58:21,154 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:58:21,155 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:58:22,145 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:58:22,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:58:22,156 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:58:22,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:58:22 BoogieIcfgContainer [2022-01-10 15:58:22,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:58:22,159 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:58:22,160 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:58:22,161 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:58:22,163 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:58:22" (1/1) ... [2022-01-10 15:58:22,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:58:22 BasicIcfg [2022-01-10 15:58:22,377 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:58:22,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:58:22,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:58:22,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:58:22,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:58:20" (1/4) ... [2022-01-10 15:58:22,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a6c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:58:22, skipping insertion in model container [2022-01-10 15:58:22,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:58:20" (2/4) ... [2022-01-10 15:58:22,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a6c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:58:22, skipping insertion in model container [2022-01-10 15:58:22,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:58:22" (3/4) ... [2022-01-10 15:58:22,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a6c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:58:22, skipping insertion in model container [2022-01-10 15:58:22,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:58:22" (4/4) ... [2022-01-10 15:58:22,383 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem01_label49.cTransformedIcfg [2022-01-10 15:58:22,388 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:58:22,388 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:58:22,428 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:58:22,434 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 15:58:22,434 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:58:22,452 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 15:58:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 15:58:22,465 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:22,466 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] [2022-01-10 15:58:22,466 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash 823103080, now seen corresponding path program 1 times [2022-01-10 15:58:22,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:22,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245351819] [2022-01-10 15:58:22,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:22,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:23,080 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 15:58:23,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:23,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245351819] [2022-01-10 15:58:23,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245351819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:23,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:23,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:58:23,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031249411] [2022-01-10 15:58:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:23,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:23,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:23,126 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 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 15:58:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:23,968 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2022-01-10 15:58:23,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:23,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 107 [2022-01-10 15:58:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:23,981 INFO L225 Difference]: With dead ends: 528 [2022-01-10 15:58:23,981 INFO L226 Difference]: Without dead ends: 266 [2022-01-10 15:58:23,985 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 15:58:23,988 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 65 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 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.8s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:23,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 15:58:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-10 15:58:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-01-10 15:58:24,039 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 15:58:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2022-01-10 15:58:24,041 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 107 [2022-01-10 15:58:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:24,042 INFO L470 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2022-01-10 15:58:24,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 15:58:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2022-01-10 15:58:24,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 15:58:24,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:24,044 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] [2022-01-10 15:58:24,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:58:24,045 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:24,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1664244347, now seen corresponding path program 1 times [2022-01-10 15:58:24,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:24,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503520084] [2022-01-10 15:58:24,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:24,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:24,118 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 15:58:24,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:24,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503520084] [2022-01-10 15:58:24,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503520084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:24,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:24,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:58:24,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36596172] [2022-01-10 15:58:24,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:24,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:24,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:24,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:24,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:24,122 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 15:58:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:24,655 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2022-01-10 15:58:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 113 [2022-01-10 15:58:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:24,659 INFO L225 Difference]: With dead ends: 792 [2022-01-10 15:58:24,659 INFO L226 Difference]: Without dead ends: 528 [2022-01-10 15:58:24,661 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 15:58:24,662 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 143 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 19 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 15:58:24,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 19 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 15:58:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2022-01-10 15:58:24,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2022-01-10 15:58:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.411764705882353) internal successors, (744), 527 states have internal predecessors, (744), 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 15:58:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 744 transitions. [2022-01-10 15:58:24,685 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 744 transitions. Word has length 113 [2022-01-10 15:58:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:24,686 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 744 transitions. [2022-01-10 15:58:24,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 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 15:58:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 744 transitions. [2022-01-10 15:58:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-10 15:58:24,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:24,690 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:24,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:58:24,691 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:24,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1103705292, now seen corresponding path program 1 times [2022-01-10 15:58:24,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:24,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368722441] [2022-01-10 15:58:24,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:24,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 15:58:24,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:24,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368722441] [2022-01-10 15:58:24,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368722441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:24,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:24,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:58:24,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550209237] [2022-01-10 15:58:24,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:24,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:24,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:24,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:24,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:24,796 INFO L87 Difference]: Start difference. First operand 528 states and 744 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 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 15:58:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:25,281 INFO L93 Difference]: Finished difference Result 1447 states and 2048 transitions. [2022-01-10 15:58:25,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:25,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 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 133 [2022-01-10 15:58:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:25,285 INFO L225 Difference]: With dead ends: 1447 [2022-01-10 15:58:25,286 INFO L226 Difference]: Without dead ends: 921 [2022-01-10 15:58:25,287 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 15:58:25,288 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:25,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 55 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 15:58:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2022-01-10 15:58:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2022-01-10 15:58:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3021739130434782) internal successors, (1198), 920 states have internal predecessors, (1198), 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 15:58:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1198 transitions. [2022-01-10 15:58:25,315 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1198 transitions. Word has length 133 [2022-01-10 15:58:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:25,316 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1198 transitions. [2022-01-10 15:58:25,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 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 15:58:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1198 transitions. [2022-01-10 15:58:25,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-01-10 15:58:25,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:25,320 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-01-10 15:58:25,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:58:25,321 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1908244274, now seen corresponding path program 1 times [2022-01-10 15:58:25,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:25,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534782153] [2022-01-10 15:58:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:25,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 15:58:25,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:25,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534782153] [2022-01-10 15:58:25,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534782153] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:25,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:25,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:58:25,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868246999] [2022-01-10 15:58:25,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:25,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:25,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:25,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:25,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:25,397 INFO L87 Difference]: Start difference. First operand 921 states and 1198 transitions. 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 15:58:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:25,890 INFO L93 Difference]: Finished difference Result 2102 states and 2758 transitions. [2022-01-10 15:58:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:25,891 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 139 [2022-01-10 15:58:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:25,895 INFO L225 Difference]: With dead ends: 2102 [2022-01-10 15:58:25,896 INFO L226 Difference]: Without dead ends: 1314 [2022-01-10 15:58:25,897 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 15:58:25,905 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:25,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 60 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 15:58:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-01-10 15:58:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2022-01-10 15:58:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2504230118443316) internal successors, (1478), 1182 states have internal predecessors, (1478), 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 15:58:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1478 transitions. [2022-01-10 15:58:25,932 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1478 transitions. Word has length 139 [2022-01-10 15:58:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:25,934 INFO L470 AbstractCegarLoop]: Abstraction has 1183 states and 1478 transitions. [2022-01-10 15:58:25,934 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 15:58:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1478 transitions. [2022-01-10 15:58:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 15:58:25,939 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:25,939 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:58:25,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:58:25,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:25,943 INFO L85 PathProgramCache]: Analyzing trace with hash -690043857, now seen corresponding path program 1 times [2022-01-10 15:58:25,943 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:25,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561747398] [2022-01-10 15:58:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:25,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-01-10 15:58:26,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:26,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561747398] [2022-01-10 15:58:26,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561747398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:26,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:26,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:58:26,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392973309] [2022-01-10 15:58:26,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:26,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:58:26,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:58:26,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:58:26,078 INFO L87 Difference]: Start difference. First operand 1183 states and 1478 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 15:58:26,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:26,822 INFO L93 Difference]: Finished difference Result 2888 states and 3586 transitions. [2022-01-10 15:58:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:58:26,823 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 158 [2022-01-10 15:58:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:26,828 INFO L225 Difference]: With dead ends: 2888 [2022-01-10 15:58:26,829 INFO L226 Difference]: Without dead ends: 1707 [2022-01-10 15:58:26,830 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 15:58:26,834 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 267 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:26,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 58 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 15:58:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-01-10 15:58:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1576. [2022-01-10 15:58:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.2298412698412697) internal successors, (1937), 1575 states have internal predecessors, (1937), 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 15:58:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1937 transitions. [2022-01-10 15:58:26,867 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1937 transitions. Word has length 158 [2022-01-10 15:58:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:26,868 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 1937 transitions. [2022-01-10 15:58:26,868 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 15:58:26,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1937 transitions. [2022-01-10 15:58:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-10 15:58:26,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:26,872 INFO L514 BasicCegarLoop]: trace histogram [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, 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] [2022-01-10 15:58:26,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:58:26,872 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash -698175488, now seen corresponding path program 1 times [2022-01-10 15:58:26,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:26,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343644330] [2022-01-10 15:58:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:26,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 15:58:26,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:26,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343644330] [2022-01-10 15:58:26,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343644330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:26,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:26,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:58:26,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245157063] [2022-01-10 15:58:26,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:26,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:58:26,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:26,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:58:26,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:58:26,985 INFO L87 Difference]: Start difference. First operand 1576 states and 1937 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 15:58:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:27,791 INFO L93 Difference]: Finished difference Result 3543 states and 4415 transitions. [2022-01-10 15:58:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:58:27,792 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 176 [2022-01-10 15:58:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:27,799 INFO L225 Difference]: With dead ends: 3543 [2022-01-10 15:58:27,799 INFO L226 Difference]: Without dead ends: 1969 [2022-01-10 15:58:27,801 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 15:58:27,802 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 224 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:27,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 58 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 15:58:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-10 15:58:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2022-01-10 15:58:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.2022357723577235) internal successors, (2366), 1968 states have internal predecessors, (2366), 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 15:58:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2366 transitions. [2022-01-10 15:58:27,838 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2366 transitions. Word has length 176 [2022-01-10 15:58:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:27,838 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2366 transitions. [2022-01-10 15:58:27,838 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 15:58:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2366 transitions. [2022-01-10 15:58:27,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-01-10 15:58:27,842 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:27,843 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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, 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] [2022-01-10 15:58:27,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:58:27,843 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash -793211122, now seen corresponding path program 1 times [2022-01-10 15:58:27,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:27,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264902874] [2022-01-10 15:58:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:27,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-10 15:58:27,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:27,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264902874] [2022-01-10 15:58:27,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264902874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:27,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:27,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:58:27,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662839725] [2022-01-10 15:58:27,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:27,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:27,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:27,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:27,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:27,994 INFO L87 Difference]: Start difference. First operand 1969 states and 2366 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 15:58:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:28,472 INFO L93 Difference]: Finished difference Result 4329 states and 5195 transitions. [2022-01-10 15:58:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 189 [2022-01-10 15:58:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:28,480 INFO L225 Difference]: With dead ends: 4329 [2022-01-10 15:58:28,480 INFO L226 Difference]: Without dead ends: 2231 [2022-01-10 15:58:28,483 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 15:58:28,484 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 113 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:28,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 211 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:58:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-01-10 15:58:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2022-01-10 15:58:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1219730941704036) internal successors, (2502), 2230 states have internal predecessors, (2502), 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 15:58:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2502 transitions. [2022-01-10 15:58:28,525 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2502 transitions. Word has length 189 [2022-01-10 15:58:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:28,525 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2502 transitions. [2022-01-10 15:58:28,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 15:58:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2502 transitions. [2022-01-10 15:58:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-01-10 15:58:28,530 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:28,530 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-10 15:58:28,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:58:28,531 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1719123859, now seen corresponding path program 1 times [2022-01-10 15:58:28,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:28,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156973732] [2022-01-10 15:58:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:28,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-01-10 15:58:28,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156973732] [2022-01-10 15:58:28,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156973732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:28,663 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:28,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:58:28,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707356] [2022-01-10 15:58:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:28,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:28,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:28,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:28,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:28,665 INFO L87 Difference]: Start difference. First operand 2231 states and 2502 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 15:58:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:29,105 INFO L93 Difference]: Finished difference Result 4329 states and 4868 transitions. [2022-01-10 15:58:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:29,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 206 [2022-01-10 15:58:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:29,114 INFO L225 Difference]: With dead ends: 4329 [2022-01-10 15:58:29,114 INFO L226 Difference]: Without dead ends: 2231 [2022-01-10 15:58:29,117 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 15:58:29,118 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 114 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:29,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 44 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:58:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-01-10 15:58:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2022-01-10 15:58:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1192825112107623) internal successors, (2496), 2230 states have internal predecessors, (2496), 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 15:58:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2496 transitions. [2022-01-10 15:58:29,162 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2496 transitions. Word has length 206 [2022-01-10 15:58:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:29,165 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2496 transitions. [2022-01-10 15:58:29,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 15:58:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2496 transitions. [2022-01-10 15:58:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-01-10 15:58:29,170 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:29,170 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2022-01-10 15:58:29,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:58:29,171 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash 681538188, now seen corresponding path program 1 times [2022-01-10 15:58:29,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:29,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953916794] [2022-01-10 15:58:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:29,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-01-10 15:58:29,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:29,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953916794] [2022-01-10 15:58:29,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953916794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:29,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:29,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:58:29,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426582769] [2022-01-10 15:58:29,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:29,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 15:58:29,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:29,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 15:58:29,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 15:58:29,316 INFO L87 Difference]: Start difference. First operand 2231 states and 2496 transitions. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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 15:58:30,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:30,001 INFO L93 Difference]: Finished difference Result 4329 states and 4856 transitions. [2022-01-10 15:58:30,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 15:58:30,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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 226 [2022-01-10 15:58:30,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:30,008 INFO L225 Difference]: With dead ends: 4329 [2022-01-10 15:58:30,008 INFO L226 Difference]: Without dead ends: 2231 [2022-01-10 15:58:30,010 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 15:58:30,011 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 223 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:30,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 26 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 15:58:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-01-10 15:58:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2231. [2022-01-10 15:58:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.095067264573991) internal successors, (2442), 2230 states have internal predecessors, (2442), 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 15:58:30,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2442 transitions. [2022-01-10 15:58:30,045 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2442 transitions. Word has length 226 [2022-01-10 15:58:30,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:30,045 INFO L470 AbstractCegarLoop]: Abstraction has 2231 states and 2442 transitions. [2022-01-10 15:58:30,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 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 15:58:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2442 transitions. [2022-01-10 15:58:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-01-10 15:58:30,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:30,050 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 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, 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] [2022-01-10 15:58:30,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:58:30,050 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 545375227, now seen corresponding path program 1 times [2022-01-10 15:58:30,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:30,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203234148] [2022-01-10 15:58:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:30,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-01-10 15:58:30,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:30,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203234148] [2022-01-10 15:58:30,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203234148] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:30,205 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:30,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:58:30,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105528942] [2022-01-10 15:58:30,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:30,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:30,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:30,207 INFO L87 Difference]: Start difference. First operand 2231 states and 2442 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 15:58:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:30,635 INFO L93 Difference]: Finished difference Result 4329 states and 4748 transitions. [2022-01-10 15:58:30,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:30,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 230 [2022-01-10 15:58:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:30,643 INFO L225 Difference]: With dead ends: 4329 [2022-01-10 15:58:30,643 INFO L226 Difference]: Without dead ends: 2231 [2022-01-10 15:58:30,646 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 15:58:30,646 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 79 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:30,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 180 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:58:30,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-01-10 15:58:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2022-01-10 15:58:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.0800381133873274) internal successors, (2267), 2099 states have internal predecessors, (2267), 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 15:58:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2267 transitions. [2022-01-10 15:58:30,684 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2267 transitions. Word has length 230 [2022-01-10 15:58:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:30,685 INFO L470 AbstractCegarLoop]: Abstraction has 2100 states and 2267 transitions. [2022-01-10 15:58:30,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 15:58:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2267 transitions. [2022-01-10 15:58:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-10 15:58:30,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:30,699 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:58:30,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:58:30,700 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash -695363458, now seen corresponding path program 1 times [2022-01-10 15:58:30,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:30,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115348273] [2022-01-10 15:58:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:30,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-01-10 15:58:30,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:30,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115348273] [2022-01-10 15:58:30,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115348273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:30,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:30,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 15:58:30,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666061090] [2022-01-10 15:58:30,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:30,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:30,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:30,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:30,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:30,847 INFO L87 Difference]: Start difference. First operand 2100 states and 2267 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 15:58:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:31,253 INFO L93 Difference]: Finished difference Result 4198 states and 4540 transitions. [2022-01-10 15:58:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 241 [2022-01-10 15:58:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:31,260 INFO L225 Difference]: With dead ends: 4198 [2022-01-10 15:58:31,260 INFO L226 Difference]: Without dead ends: 2231 [2022-01-10 15:58:31,263 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 15:58:31,264 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:31,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 49 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:58:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-01-10 15:58:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2022-01-10 15:58:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.068089430894309) internal successors, (2102), 1968 states have internal predecessors, (2102), 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 15:58:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2102 transitions. [2022-01-10 15:58:31,298 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2102 transitions. Word has length 241 [2022-01-10 15:58:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:31,299 INFO L470 AbstractCegarLoop]: Abstraction has 1969 states and 2102 transitions. [2022-01-10 15:58:31,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 15:58:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2102 transitions. [2022-01-10 15:58:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-01-10 15:58:31,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:31,305 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 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, 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] [2022-01-10 15:58:31,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:58:31,305 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash 282764164, now seen corresponding path program 1 times [2022-01-10 15:58:31,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:31,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675383505] [2022-01-10 15:58:31,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:31,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2022-01-10 15:58:31,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:31,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675383505] [2022-01-10 15:58:31,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675383505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:31,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:31,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:58:31,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115095388] [2022-01-10 15:58:31,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:31,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:58:31,572 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:31,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:58:31,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:58:31,572 INFO L87 Difference]: Start difference. First operand 1969 states and 2102 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 15:58:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:31,993 INFO L93 Difference]: Finished difference Result 4067 states and 4347 transitions. [2022-01-10 15:58:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:58:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 297 [2022-01-10 15:58:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:31,999 INFO L225 Difference]: With dead ends: 4067 [2022-01-10 15:58:31,999 INFO L226 Difference]: Without dead ends: 1969 [2022-01-10 15:58:32,002 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 15:58:32,003 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:32,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 172 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 15:58:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2022-01-10 15:58:32,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2022-01-10 15:58:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.0511703864997277) internal successors, (1931), 1837 states have internal predecessors, (1931), 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 15:58:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1931 transitions. [2022-01-10 15:58:32,034 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1931 transitions. Word has length 297 [2022-01-10 15:58:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:32,034 INFO L470 AbstractCegarLoop]: Abstraction has 1838 states and 1931 transitions. [2022-01-10 15:58:32,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 15:58:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1931 transitions. [2022-01-10 15:58:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-01-10 15:58:32,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:58:32,041 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:32,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 15:58:32,041 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:58:32,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:58:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2097822919, now seen corresponding path program 1 times [2022-01-10 15:58:32,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:58:32,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68043847] [2022-01-10 15:58:32,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:58:32,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:58:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:58:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-01-10 15:58:32,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:58:32,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68043847] [2022-01-10 15:58:32,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68043847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:58:32,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:58:32,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 15:58:32,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877722859] [2022-01-10 15:58:32,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:58:32,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 15:58:32,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:58:32,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 15:58:32,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 15:58:32,365 INFO L87 Difference]: Start difference. First operand 1838 states and 1931 transitions. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 4 states have internal predecessors, (238), 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 15:58:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:58:32,991 INFO L93 Difference]: Finished difference Result 3614 states and 3804 transitions. [2022-01-10 15:58:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 15:58:32,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 4 states have internal predecessors, (238), 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 301 [2022-01-10 15:58:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:58:32,992 INFO L225 Difference]: With dead ends: 3614 [2022-01-10 15:58:32,993 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:58:32,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 15:58:32,995 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 168 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 15:58:32,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 22 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 15:58:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:58:32,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:58:32,996 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 15:58:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:58:32,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 301 [2022-01-10 15:58:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:58:32,997 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:58:32,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 4 states have internal predecessors, (238), 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 15:58:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:58:32,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:58:32,999 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:58:33,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:58:33,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:58:33,676 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:58:33,677 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:58:33,677 INFO L854 garLoopResultBuilder]: At program point L593-2(lines 593 603) the Hoare annotation is: (let ((.cse2 (= ~a20~0Int 1))) (let ((.cse9 (<= ~a16~0Int 4)) (.cse1 (= ~a21~0Int 1)) (.cse8 (<= 15 ~a8~0Int)) (.cse4 (not .cse2)) (.cse0 (<= ~a16~0Int 5)) (.cse7 (<= ~a17~0Int 0)) (.cse5 (= ~a17~0Int 1)) (.cse10 (= ~a8~0Int 13)) (.cse3 (= ~a12~0Int 8)) (.cse6 (= ~a7~0Int 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3 .cse6) (and .cse4 .cse0 .cse7 .cse6) (and .cse1 .cse8 .cse5 .cse3) (and .cse9 .cse1 .cse5 .cse2) (and (= ~a16~0Int 6) .cse1 (<= ~a7~0Int 0) .cse5 .cse2 .cse10 .cse3) (and .cse4 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse9 .cse2 .cse3 .cse6) (and (<= 6 ~a16~0Int) .cse2 .cse3 .cse6) (and .cse1 .cse8 .cse2 .cse3) (and .cse4 .cse0 .cse7 .cse3) (and .cse5 .cse2 .cse10 .cse3 .cse6)))) [2022-01-10 15:58:33,677 INFO L861 garLoopResultBuilder]: At program point L587(lines 587 604) the Hoare annotation is: true [2022-01-10 15:58:33,677 INFO L858 garLoopResultBuilder]: For program point L598(line 598) no Hoare annotation was computed. [2022-01-10 15:58:33,677 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:58:33,677 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L854 garLoopResultBuilder]: At program point L584(lines 40 585) the Hoare annotation is: (let ((.cse2 (= ~a20~0Int 1))) (let ((.cse9 (<= ~a16~0Int 4)) (.cse1 (= ~a21~0Int 1)) (.cse8 (<= 15 ~a8~0Int)) (.cse4 (not .cse2)) (.cse0 (<= ~a16~0Int 5)) (.cse7 (<= ~a17~0Int 0)) (.cse5 (= ~a17~0Int 1)) (.cse10 (= ~a8~0Int 13)) (.cse3 (= ~a12~0Int 8)) (.cse6 (= ~a7~0Int 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3 .cse6) (and .cse4 .cse0 .cse7 .cse6) (and .cse1 .cse8 .cse5 .cse3) (and .cse9 .cse1 .cse5 .cse2) (and (= ~a16~0Int 6) .cse1 (<= ~a7~0Int 0) .cse5 .cse2 .cse10 .cse3) (and .cse4 .cse7 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse9 .cse2 .cse3 .cse6) (and (<= 6 ~a16~0Int) .cse2 .cse3 .cse6) (and .cse1 .cse8 .cse2 .cse3) (and .cse4 .cse0 .cse7 .cse3) (and .cse5 .cse2 .cse10 .cse3 .cse6)))) [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L64(lines 64 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L75(lines 75 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 400) no Hoare annotation was computed. [2022-01-10 15:58:33,678 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L94(lines 94 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L118(lines 118 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L124(lines 124 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L129(lines 129 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L139(lines 139 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L150(lines 150 400) no Hoare annotation was computed. [2022-01-10 15:58:33,679 INFO L858 garLoopResultBuilder]: For program point L154(lines 154 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L183(lines 183 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L196(lines 196 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L199(lines 199 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L207(lines 207 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L213(lines 213 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L218(lines 218 400) no Hoare annotation was computed. [2022-01-10 15:58:33,680 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L228(lines 228 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L233(lines 233 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L248(lines 248 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L266(lines 266 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L271(lines 271 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L275(lines 275 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L278(lines 278 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L283(lines 283 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L288(lines 288 400) no Hoare annotation was computed. [2022-01-10 15:58:33,681 INFO L858 garLoopResultBuilder]: For program point L296(lines 296 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L302(lines 302 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L309(lines 309 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L316(lines 316 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L322(lines 322 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L326(lines 326 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L328(lines 328 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L334(lines 334 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L339(lines 339 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L343(lines 343 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L347(lines 347 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L355(lines 355 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L363(lines 363 400) no Hoare annotation was computed. [2022-01-10 15:58:33,682 INFO L858 garLoopResultBuilder]: For program point L365(lines 365 400) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L371(lines 371 400) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L373(lines 373 400) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L375(lines 375 400) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L382(lines 382 400) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 400) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L392(lines 392 400) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L401(lines 401 403) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L402(line 402) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L401-2(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L405(line 405) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L404-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L408(line 408) no Hoare annotation was computed. [2022-01-10 15:58:33,683 INFO L858 garLoopResultBuilder]: For program point L407-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L411(line 411) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L410-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L414(line 414) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L413-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L417(line 417) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L416-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L420(line 420) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L419-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L423(line 423) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L422-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L426(line 426) no Hoare annotation was computed. [2022-01-10 15:58:33,684 INFO L858 garLoopResultBuilder]: For program point L425-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L429(line 429) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L428-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L432(line 432) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L431-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L435(line 435) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L434-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L438(line 438) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L440-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L444(line 444) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L443-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,685 INFO L858 garLoopResultBuilder]: For program point L447(line 447) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L446-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L450(line 450) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L449-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L453(line 453) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L452-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L456(line 456) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L455-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L459(line 459) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L458-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L461-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L465(line 465) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L464-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,686 INFO L858 garLoopResultBuilder]: For program point L468(line 468) no Hoare annotation was computed. [2022-01-10 15:58:33,687 INFO L858 garLoopResultBuilder]: For program point L467-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,687 INFO L858 garLoopResultBuilder]: For program point L471(line 471) no Hoare annotation was computed. [2022-01-10 15:58:33,687 INFO L858 garLoopResultBuilder]: For program point L470-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,687 INFO L858 garLoopResultBuilder]: For program point L474(line 474) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L473-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L477(line 477) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L476-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L480(line 480) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L479-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L483(line 483) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L482-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L486(line 486) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L485-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,690 INFO L858 garLoopResultBuilder]: For program point L489(line 489) no Hoare annotation was computed. [2022-01-10 15:58:33,692 INFO L858 garLoopResultBuilder]: For program point L488-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,692 INFO L858 garLoopResultBuilder]: For program point L492(line 492) no Hoare annotation was computed. [2022-01-10 15:58:33,692 INFO L858 garLoopResultBuilder]: For program point L491-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,692 INFO L858 garLoopResultBuilder]: For program point L495(line 495) no Hoare annotation was computed. [2022-01-10 15:58:33,692 INFO L858 garLoopResultBuilder]: For program point L494-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L498(line 498) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L497-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L501(line 501) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L500-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L504(line 504) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L503-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L507(line 507) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L506-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 507) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L510(line 510) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L509-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,693 INFO L858 garLoopResultBuilder]: For program point L513(line 513) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L512-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L516(line 516) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L515-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L519(line 519) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L518-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L522(line 522) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L521-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,694 INFO L858 garLoopResultBuilder]: For program point L525(line 525) no Hoare annotation was computed. [2022-01-10 15:58:33,696 INFO L858 garLoopResultBuilder]: For program point L524-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,696 INFO L858 garLoopResultBuilder]: For program point L528(line 528) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L527-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L531(line 531) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L530-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L534(line 534) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L533-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L537(line 537) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L536-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L540(line 540) no Hoare annotation was computed. [2022-01-10 15:58:33,697 INFO L858 garLoopResultBuilder]: For program point L539-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L543(line 543) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L542-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L546(line 546) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L545-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L549(line 549) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L548-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L552(line 552) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L551-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-01-10 15:58:33,698 INFO L858 garLoopResultBuilder]: For program point L554-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L558(line 558) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L557-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L561(line 561) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L560-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L564(line 564) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L563-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L567(line 567) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L566-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L570(line 570) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L569-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L573(line 573) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L572-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-01-10 15:58:33,699 INFO L858 garLoopResultBuilder]: For program point L575-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,700 INFO L858 garLoopResultBuilder]: For program point L579(line 579) no Hoare annotation was computed. [2022-01-10 15:58:33,700 INFO L858 garLoopResultBuilder]: For program point L578-1(lines 40 585) no Hoare annotation was computed. [2022-01-10 15:58:33,700 INFO L858 garLoopResultBuilder]: For program point L582(line 582) no Hoare annotation was computed. [2022-01-10 15:58:33,700 INFO L858 garLoopResultBuilder]: For program point L581-1(lines 581 583) no Hoare annotation was computed. [2022-01-10 15:58:33,704 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:58:33,707 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:58:33,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:58:33 BasicIcfg [2022-01-10 15:58:33,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:58:33,746 INFO L158 Benchmark]: Toolchain (without parser) took 13434.99ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 125.0MB in the beginning and 131.4MB in the end (delta: -6.4MB). Peak memory consumption was 65.0MB. Max. memory is 8.0GB. [2022-01-10 15:58:33,746 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 184.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:58:33,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.70ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 124.9MB in the beginning and 208.9MB in the end (delta: -84.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-01-10 15:58:33,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.56ms. Allocated memory is still 255.9MB. Free memory was 208.9MB in the beginning and 203.1MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 15:58:33,747 INFO L158 Benchmark]: Boogie Preprocessor took 94.69ms. Allocated memory is still 255.9MB. Free memory was 203.1MB in the beginning and 198.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 15:58:33,747 INFO L158 Benchmark]: RCFGBuilder took 1135.73ms. Allocated memory is still 255.9MB. Free memory was 198.4MB in the beginning and 138.1MB in the end (delta: 60.3MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. [2022-01-10 15:58:33,748 INFO L158 Benchmark]: IcfgTransformer took 217.12ms. Allocated memory is still 255.9MB. Free memory was 138.1MB in the beginning and 101.9MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-01-10 15:58:33,748 INFO L158 Benchmark]: TraceAbstraction took 11367.62ms. Allocated memory is still 255.9MB. Free memory was 101.4MB in the beginning and 131.4MB in the end (delta: -30.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:58:33,749 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.09ms. Allocated memory is still 184.5MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 518.70ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 124.9MB in the beginning and 208.9MB in the end (delta: -84.0MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 95.56ms. Allocated memory is still 255.9MB. Free memory was 208.9MB in the beginning and 203.1MB in the end (delta: 5.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 94.69ms. Allocated memory is still 255.9MB. Free memory was 203.1MB in the beginning and 198.4MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1135.73ms. Allocated memory is still 255.9MB. Free memory was 198.4MB in the beginning and 138.1MB in the end (delta: 60.3MB). Peak memory consumption was 59.8MB. Max. memory is 8.0GB. * IcfgTransformer took 217.12ms. Allocated memory is still 255.9MB. Free memory was 138.1MB in the beginning and 101.9MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11367.62ms. Allocated memory is still 255.9MB. Free memory was 101.4MB in the beginning and 131.4MB in the end (delta: -30.0MB). There was no memory consumed. 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: 507]: 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: 11.3s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1752 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1752 mSDsluCounter, 1038 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 779 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5393 IncrementalHoareTripleChecker+Invalid, 6172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 779 mSolverCounterUnsat, 953 mSDtfsCounter, 5393 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=7, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 786 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 41 NumberOfFragments, 379 HoareAnnotationTreeSize, 3 FomulaSimplifications, 436 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 696 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2516 NumberOfCodeBlocks, 2516 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2503 ConstructedInterpolants, 0 QuantifiedInterpolants, 9818 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2179/2179 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: ((((((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && 1bv32 == a21) || (((8bv32 == a12 && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32))) || (((1bv32 == a20 && a7 == 1bv32) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((8bv32 == a12 && !(1bv32 == a20)) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8))) || (((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && ~bvule32(a16, 4bv32))) || (((8bv32 == a12 && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || ((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a7, 0bv32)) && 6bv32 == a16) && 1bv32 == a17) && a8 == 13bv32) && 1bv32 == a21)) || (((1bv32 == a20 && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && 1bv32 == a21)) || ((((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && 1bv32 == a17) && a8 == 13bv32)) || ((((8bv32 == a12 && a7 == 1bv32) && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17)) || (((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && ~bvule32(6bv32, a16))) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (((a7 == 1bv32 && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: ((((((((((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a16, 5bv32)) && 1bv32 == a21) || (((8bv32 == a12 && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32))) || (((1bv32 == a20 && a7 == 1bv32) && ~bvule32(a16, 5bv32)) && 1bv32 == a21)) || (((8bv32 == a12 && !(1bv32 == a20)) && ~bvule32(a17, 0bv32)) && ~bvule32(15bv32, a8))) || (((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && ~bvule32(a16, 4bv32))) || (((8bv32 == a12 && 1bv32 == a17) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || ((((((1bv32 == a20 && 8bv32 == a12) && ~bvule32(a7, 0bv32)) && 6bv32 == a16) && 1bv32 == a17) && a8 == 13bv32) && 1bv32 == a21)) || (((1bv32 == a20 && ~bvule32(a16, 4bv32)) && 1bv32 == a17) && 1bv32 == a21)) || ((((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && 1bv32 == a17) && a8 == 13bv32)) || ((((8bv32 == a12 && a7 == 1bv32) && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && 1bv32 == a17)) || (((1bv32 == a20 && 8bv32 == a12) && a7 == 1bv32) && ~bvule32(6bv32, a16))) || (((1bv32 == a20 && 8bv32 == a12) && ~bvule32(15bv32, a8)) && 1bv32 == a21)) || (((a7 == 1bv32 && !(1bv32 == a20)) && ~bvule32(a16, 5bv32)) && ~bvule32(a17, 0bv32)) RESULT: Ultimate proved your program to be correct! [2022-01-10 15:58:33,804 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...