/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/list-simple/sll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:50:36,959 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:50:36,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:50:37,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:50:37,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:50:37,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:50:37,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:50:37,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:50:37,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:50:37,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:50:37,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:50:37,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:50:37,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:50:37,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:50:37,037 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:50:37,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:50:37,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:50:37,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:50:37,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:50:37,046 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:50:37,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:50:37,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:50:37,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:50:37,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:50:37,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:50:37,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:50:37,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:50:37,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:50:37,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:50:37,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:50:37,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:50:37,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:50:37,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:50:37,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:50:37,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:50:37,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:50:37,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:50:37,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:50:37,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:50:37,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:50:37,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:50:37,069 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 17:50:37,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:50:37,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:50:37,099 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:50:37,099 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:50:37,100 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:50:37,100 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:50:37,100 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:50:37,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:50:37,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:50:37,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:50:37,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:50:37,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:50:37,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:50:37,101 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:50:37,101 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:50:37,102 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:50:37,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:50:37,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:50:37,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:50:37,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:50:37,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:50:37,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:50:37,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:50:37,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:50:37,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:50:37,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:50:37,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:50:37,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:50:37,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:50:37,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:50:37,104 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:50:37,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:50:37,105 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:50:37,105 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 17:50:37,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:50:37,309 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:50:37,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:50:37,312 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:50:37,312 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:50:37,313 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_remove_all.i [2022-01-10 17:50:37,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c1f9eae/f39b332fa3674d06a5a8857b8a5e774a/FLAG745b313e7 [2022-01-10 17:50:37,776 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:50:37,776 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i [2022-01-10 17:50:37,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c1f9eae/f39b332fa3674d06a5a8857b8a5e774a/FLAG745b313e7 [2022-01-10 17:50:37,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0c1f9eae/f39b332fa3674d06a5a8857b8a5e774a [2022-01-10 17:50:37,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:50:37,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:50:37,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:50:37,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:50:37,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:50:37,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:50:37" (1/1) ... [2022-01-10 17:50:37,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb6a902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:37, skipping insertion in model container [2022-01-10 17:50:37,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:50:37" (1/1) ... [2022-01-10 17:50:37,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:50:37,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:50:38,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i[23806,23819] [2022-01-10 17:50:38,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:50:38,071 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:50:38,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i[23806,23819] [2022-01-10 17:50:38,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:50:38,119 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:50:38,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38 WrapperNode [2022-01-10 17:50:38,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:50:38,120 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:50:38,120 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:50:38,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:50:38,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,161 INFO L137 Inliner]: procedures = 129, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2022-01-10 17:50:38,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:50:38,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:50:38,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:50:38,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:50:38,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:50:38,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:50:38,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:50:38,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:50:38,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:50:38,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:38,213 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 17:50:38,214 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 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 17:50:38,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:50:38,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:50:38,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:50:38,390 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:50:38,391 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:50:38,588 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:50:38,592 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:50:38,592 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 17:50:38,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:50:38 BoogieIcfgContainer [2022-01-10 17:50:38,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:50:38,594 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:50:38,594 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:50:38,595 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:50:38,597 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:50:38" (1/1) ... [2022-01-10 17:50:38,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:50:38 BasicIcfg [2022-01-10 17:50:38,654 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:50:38,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:50:38,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:50:38,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:50:38,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:50:37" (1/4) ... [2022-01-10 17:50:38,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dc54ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:50:38, skipping insertion in model container [2022-01-10 17:50:38,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:50:38" (2/4) ... [2022-01-10 17:50:38,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dc54ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:50:38, skipping insertion in model container [2022-01-10 17:50:38,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:50:38" (3/4) ... [2022-01-10 17:50:38,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dc54ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:50:38, skipping insertion in model container [2022-01-10 17:50:38,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:50:38" (4/4) ... [2022-01-10 17:50:38,658 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.iTransformedIcfg [2022-01-10 17:50:38,661 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:50:38,669 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:50:38,697 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:50:38,703 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 17:50:38,703 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:50:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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 17:50:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 17:50:38,718 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:38,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:38,719 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash 521824771, now seen corresponding path program 1 times [2022-01-10 17:50:38,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:38,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756942790] [2022-01-10 17:50:38,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:38,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:38,897 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 17:50:38,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:38,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756942790] [2022-01-10 17:50:38,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756942790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:38,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:50:38,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:50:38,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080989503] [2022-01-10 17:50:38,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:38,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:50:38,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:38,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:50:38,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:50:38,928 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 17:50:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:38,940 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-01-10 17:50:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:50:38,942 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-01-10 17:50:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:38,948 INFO L225 Difference]: With dead ends: 32 [2022-01-10 17:50:38,948 INFO L226 Difference]: Without dead ends: 16 [2022-01-10 17:50:38,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:50:38,952 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:38,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-10 17:50:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-01-10 17:50:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 17:50:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-01-10 17:50:38,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2022-01-10 17:50:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:38,975 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-01-10 17:50:38,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 17:50:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-01-10 17:50:38,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 17:50:38,976 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:38,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:38,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:50:38,976 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:38,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1409358243, now seen corresponding path program 1 times [2022-01-10 17:50:38,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:38,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017972120] [2022-01-10 17:50:38,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:38,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:39,105 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 17:50:39,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:39,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017972120] [2022-01-10 17:50:39,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017972120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:39,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:50:39,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:50:39,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148155658] [2022-01-10 17:50:39,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:39,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:50:39,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:39,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:50:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:50:39,109 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 17:50:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:39,200 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-01-10 17:50:39,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:50:39,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-01-10 17:50:39,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:39,201 INFO L225 Difference]: With dead ends: 34 [2022-01-10 17:50:39,202 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 17:50:39,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:50:39,207 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:39,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 17:50:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2022-01-10 17:50:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 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 17:50:39,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-01-10 17:50:39,219 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2022-01-10 17:50:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:39,222 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-01-10 17:50:39,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 17:50:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-01-10 17:50:39,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 17:50:39,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:39,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:39,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:50:39,224 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:39,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash -491085133, now seen corresponding path program 1 times [2022-01-10 17:50:39,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:39,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468304274] [2022-01-10 17:50:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:39,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:50:39,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:39,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468304274] [2022-01-10 17:50:39,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468304274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:39,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:50:39,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:50:39,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98222245] [2022-01-10 17:50:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:39,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:50:39,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:39,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:50:39,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:50:39,298 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17:50:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:39,310 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-01-10 17:50:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:50:39,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-01-10 17:50:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:39,311 INFO L225 Difference]: With dead ends: 31 [2022-01-10 17:50:39,311 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 17:50:39,312 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 17:50:39,312 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:39,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 17:50:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-01-10 17:50:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 17:50:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-01-10 17:50:39,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2022-01-10 17:50:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:39,318 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-01-10 17:50:39,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17:50:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-01-10 17:50:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 17:50:39,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:39,318 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:39,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:50:39,319 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1523645596, now seen corresponding path program 1 times [2022-01-10 17:50:39,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913654307] [2022-01-10 17:50:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:39,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:50:39,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:39,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913654307] [2022-01-10 17:50:39,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913654307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:50:39,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:50:39,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:50:39,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320614216] [2022-01-10 17:50:39,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:50:39,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:50:39,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:50:39,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:50:39,473 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17:50:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:39,497 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-01-10 17:50:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:50:39,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-01-10 17:50:39,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:39,498 INFO L225 Difference]: With dead ends: 24 [2022-01-10 17:50:39,498 INFO L226 Difference]: Without dead ends: 20 [2022-01-10 17:50:39,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:50:39,499 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:39,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-10 17:50:39,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-01-10 17:50:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 17:50:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-01-10 17:50:39,502 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-01-10 17:50:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:39,503 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-01-10 17:50:39,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17:50:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-01-10 17:50:39,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 17:50:39,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:39,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:39,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:50:39,504 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:39,504 INFO L85 PathProgramCache]: Analyzing trace with hash -793782958, now seen corresponding path program 1 times [2022-01-10 17:50:39,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:39,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99723127] [2022-01-10 17:50:39,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:39,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:39,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:50:39,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:39,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99723127] [2022-01-10 17:50:39,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99723127] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:39,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819713744] [2022-01-10 17:50:39,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:39,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:39,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:39,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:39,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:50:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:39,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-10 17:50:39,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:39,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:50:39,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:50:40,112 INFO L353 Elim1Store]: treesize reduction 69, result has 17.9 percent of original size [2022-01-10 17:50:40,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 82 [2022-01-10 17:50:40,132 INFO L353 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2022-01-10 17:50:40,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 63 [2022-01-10 17:50:40,529 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 17:50:40,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-01-10 17:50:40,538 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 17:50:40,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 13 [2022-01-10 17:50:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:40,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:40,907 INFO L353 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2022-01-10 17:50:40,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 598 treesize of output 574 [2022-01-10 17:50:41,000 INFO L353 Elim1Store]: treesize reduction 80, result has 53.2 percent of original size [2022-01-10 17:50:41,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 935 treesize of output 909 [2022-01-10 17:50:41,130 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:50:42,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:42,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-01-10 17:50:42,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:42,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2022-01-10 17:50:42,587 INFO L353 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-01-10 17:50:42,587 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 142 [2022-01-10 17:50:43,044 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:43,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 45 [2022-01-10 17:50:43,053 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:43,054 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-01-10 17:50:43,120 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:50:43,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2022-01-10 17:50:43,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:43,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 45 [2022-01-10 17:50:43,141 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:43,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2022-01-10 17:50:43,235 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:43,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-01-10 17:50:43,244 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:43,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-01-10 17:50:43,261 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:50:43,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2022-01-10 17:50:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:43,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819713744] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:50:43,319 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:50:43,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 8] total 16 [2022-01-10 17:50:43,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340883229] [2022-01-10 17:50:43,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:43,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 17:50:43,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:43,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 17:50:43,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-01-10 17:50:43,320 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 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 17:50:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:43,469 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-01-10 17:50:43,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:50:43,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 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 17 [2022-01-10 17:50:43,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:43,472 INFO L225 Difference]: With dead ends: 35 [2022-01-10 17:50:43,472 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 17:50:43,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-01-10 17:50:43,473 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:43,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 109 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-01-10 17:50:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 17:50:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-01-10 17:50:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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 17:50:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-01-10 17:50:43,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2022-01-10 17:50:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:43,477 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-01-10 17:50:43,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 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 17:50:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-01-10 17:50:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 17:50:43,477 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:43,477 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:43,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:50:43,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:43,696 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:43,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1250136557, now seen corresponding path program 2 times [2022-01-10 17:50:43,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:43,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725556417] [2022-01-10 17:50:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:43,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:43,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:43,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725556417] [2022-01-10 17:50:43,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725556417] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:43,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835958239] [2022-01-10 17:50:43,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:50:43,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:43,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:43,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:43,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:50:45,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:50:45,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:50:45,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 17:50:45,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:45,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:50:45,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835958239] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:50:45,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:50:45,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 17:50:45,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513524258] [2022-01-10 17:50:45,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:45,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 17:50:45,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 17:50:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-10 17:50:45,966 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 17:50:46,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:50:46,035 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-01-10 17:50:46,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:50:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 22 [2022-01-10 17:50:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:50:46,036 INFO L225 Difference]: With dead ends: 32 [2022-01-10 17:50:46,036 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 17:50:46,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-10 17:50:46,036 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:50:46,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:50:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 17:50:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-01-10 17:50:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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 17:50:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-01-10 17:50:46,040 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-01-10 17:50:46,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:50:46,040 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-01-10 17:50:46,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 17:50:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-01-10 17:50:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 17:50:46,040 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:50:46,040 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:50:46,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:50:46,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 17:50:46,241 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:50:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:50:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash -238962621, now seen corresponding path program 3 times [2022-01-10 17:50:46,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:50:46,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485698973] [2022-01-10 17:50:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:50:46,242 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:50:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:50:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:46,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:50:46,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485698973] [2022-01-10 17:50:46,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485698973] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:50:46,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527977412] [2022-01-10 17:50:46,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 17:50:46,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:50:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:50:46,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:50:46,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:50:48,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 17:50:48,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:50:48,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 116 conjunts are in the unsatisfiable core [2022-01-10 17:50:48,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:50:48,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:50:48,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:50:48,385 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:50:48,468 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:50:48,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2022-01-10 17:50:48,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 17:50:48,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-01-10 17:50:48,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-10 17:50:48,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 37 [2022-01-10 17:50:49,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,081 INFO L353 Elim1Store]: treesize reduction 57, result has 10.9 percent of original size [2022-01-10 17:50:49,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 166 [2022-01-10 17:50:49,115 INFO L353 Elim1Store]: treesize reduction 84, result has 15.2 percent of original size [2022-01-10 17:50:49,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 225 treesize of output 124 [2022-01-10 17:50:49,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,362 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:50:49,363 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 116 [2022-01-10 17:50:49,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:49,373 INFO L353 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-01-10 17:50:49,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 180 treesize of output 139 [2022-01-10 17:50:49,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:50:49,691 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:50:49,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 83 [2022-01-10 17:50:49,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:50:49,699 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:49,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 26 [2022-01-10 17:50:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:50:49,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:50:50,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:50,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 782 treesize of output 624 [2022-01-10 17:50:50,422 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:50,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 639 treesize of output 467 [2022-01-10 17:50:52,453 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:52,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1022 treesize of output 746 [2022-01-10 17:50:52,460 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:52,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 827 treesize of output 503 [2022-01-10 17:50:52,645 INFO L353 Elim1Store]: treesize reduction 8, result has 95.9 percent of original size [2022-01-10 17:50:52,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 5286 treesize of output 4723 [2022-01-10 17:50:53,607 INFO L353 Elim1Store]: treesize reduction 102, result has 83.4 percent of original size [2022-01-10 17:50:53,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 45 case distinctions, treesize of input 19762 treesize of output 18032 [2022-01-10 17:50:56,266 INFO L353 Elim1Store]: treesize reduction 14, result has 98.5 percent of original size [2022-01-10 17:50:56,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 18767 treesize of output 16335 [2022-01-10 17:50:58,308 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:50:58,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 17907 treesize of output 14853 [2022-01-10 17:50:59,524 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 17:50:59,524 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:50:59,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-01-10 17:50:59,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798608684] [2022-01-10 17:50:59,524 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 17:50:59,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 17:50:59,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:50:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 17:50:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1027, Unknown=9, NotChecked=0, Total=1122 [2022-01-10 17:50:59,526 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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 17:51:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:00,433 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-01-10 17:51:00,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 17:51:00,433 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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 25 [2022-01-10 17:51:00,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:00,434 INFO L225 Difference]: With dead ends: 46 [2022-01-10 17:51:00,434 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 17:51:00,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=136, Invalid=1659, Unknown=11, NotChecked=0, Total=1806 [2022-01-10 17:51:00,435 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:00,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 145 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 17:51:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 17:51:00,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-01-10 17:51:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 17:51:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-01-10 17:51:00,440 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2022-01-10 17:51:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:00,440 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-01-10 17:51:00,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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 17:51:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-01-10 17:51:00,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 17:51:00,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:00,441 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:00,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:00,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:00,646 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:00,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1256849389, now seen corresponding path program 4 times [2022-01-10 17:51:00,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:00,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504535521] [2022-01-10 17:51:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:00,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:51:00,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:00,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504535521] [2022-01-10 17:51:00,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504535521] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:00,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517261574] [2022-01-10 17:51:00,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 17:51:00,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:00,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:00,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:00,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:51:01,009 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 17:51:01,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:51:01,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 17:51:01,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:51:01,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:51:06,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517261574] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:06,123 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:06,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 14 [2022-01-10 17:51:06,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030239439] [2022-01-10 17:51:06,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:06,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 17:51:06,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:06,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 17:51:06,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=132, Unknown=2, NotChecked=0, Total=182 [2022-01-10 17:51:06,124 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 17:51:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:06,174 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-01-10 17:51:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:51:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 28 [2022-01-10 17:51:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:06,175 INFO L225 Difference]: With dead ends: 47 [2022-01-10 17:51:06,175 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 17:51:06,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=55, Invalid=153, Unknown=2, NotChecked=0, Total=210 [2022-01-10 17:51:06,176 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:06,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 67 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-01-10 17:51:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 17:51:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 17:51:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 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 17:51:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-01-10 17:51:06,179 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2022-01-10 17:51:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:06,180 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-01-10 17:51:06,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 17:51:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-01-10 17:51:06,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 17:51:06,180 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:06,180 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:06,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:06,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:06,389 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:06,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1274150908, now seen corresponding path program 5 times [2022-01-10 17:51:06,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:06,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966330828] [2022-01-10 17:51:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:06,390 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 17:51:06,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:06,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966330828] [2022-01-10 17:51:06,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966330828] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:06,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944310463] [2022-01-10 17:51:06,479 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 17:51:06,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:06,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:06,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:51:07,586 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-10 17:51:07,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:51:07,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 17:51:07,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 17:51:07,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 17:51:08,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944310463] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:08,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:08,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-01-10 17:51:08,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316918962] [2022-01-10 17:51:08,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:08,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 17:51:08,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 17:51:08,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 17:51:08,105 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 17:51:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:08,137 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-01-10 17:51:08,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:51:08,138 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 30 [2022-01-10 17:51:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:08,138 INFO L225 Difference]: With dead ends: 31 [2022-01-10 17:51:08,138 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 17:51:08,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 17:51:08,140 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:08,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-01-10 17:51:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 17:51:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 17:51:08,140 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 17:51:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 17:51:08,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-01-10 17:51:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:08,142 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 17:51:08,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 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 17:51:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 17:51:08,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 17:51:08,144 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 17:51:08,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:08,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:08,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 17:51:08,962 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 17:51:08,963 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 17:51:08,963 INFO L854 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse11 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 1)) (.cse7 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse0 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (.cse8 (= |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse10 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (let ((.cse1 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse2 (mod (+ (mod .cse11 4294967296) 1) 4294967296))) (and (< |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 4294967296) (or .cse0 (<= .cse1 0)) (<= 2 .cse2) (or (not (= .cse1 0)) (let ((.cse3 (select .cse7 4))) (let ((.cse4 (select .cse6 4)) (.cse5 (+ .cse3 4))) (and (<= .cse3 0) (not (= .cse4 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) (<= (select (select |#memory_$Pointer$.baseInt| .cse4) .cse5) 0) (<= (select (select |#memory_$Pointer$.offsetInt| .cse4) .cse5) 0))))) .cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse9 (<= .cse2 2) .cse10)) (let ((.cse14 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4))) (let ((.cse16 (mod .cse14 18446744073709551616))) (let ((.cse13 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2147483648)) (.cse15 (select .cse7 .cse16)) (.cse12 (div .cse11 4294967296))) (and .cse0 (<= .cse12 .cse13) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (<= (select .cse6 .cse14) 0) (<= .cse15 0) (<= (+ (* .cse13 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse8 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 0)) .cse9 (<= 0 .cse15) (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| (+ (* .cse12 4294967296) 1)) (<= (select .cse7 .cse14) 0) (= (select .cse6 .cse16) 0) .cse10 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)))))) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) .cse0 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| 0) (<= 2 |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse8 .cse9 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) .cse10))) [2022-01-10 17:51:08,963 INFO L858 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2022-01-10 17:51:08,963 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-01-10 17:51:08,963 INFO L854 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (let ((.cse0 (<= .cse8 0)) (.cse1 (not (= .cse8 0)))) (and (or (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0) .cse0) (or .cse1 (let ((.cse2 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 4))) (let ((.cse3 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 4)) (.cse4 (+ .cse2 4))) (and (<= .cse2 0) (not (= .cse3 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) (<= (select (select |#memory_$Pointer$.baseInt| .cse3) .cse4) 0) (<= (select (select |#memory_$Pointer$.offsetInt| .cse3) .cse4) 0))))) (= |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| 0) (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (or (<= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 0) .cse0) (or (let ((.cse6 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) 4))) (let ((.cse5 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) 4)) (.cse7 (+ .cse6 4))) (and (not (= .cse5 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) (<= .cse6 0) (<= (select (select |#memory_$Pointer$.offsetInt| .cse5) .cse7) 0) (<= (select (select |#memory_$Pointer$.baseInt| .cse5) .cse7) 0)))) .cse1) (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)))) [2022-01-10 17:51:08,963 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-01-10 17:51:08,963 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-01-10 17:51:08,963 INFO L854 garLoopResultBuilder]: At program point L602-3(lines 602 604) the Hoare annotation is: (let ((.cse27 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|))) (let ((.cse34 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) 4)) (.cse5 (select .cse27 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse31 (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 4))) (let ((.cse30 (+ .cse31 4)) (.cse29 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 4)) (.cse12 (= .cse5 0)) (.cse33 (+ .cse34 4)) (.cse32 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) 4))) (let ((.cse1 (not (= .cse32 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|))) (.cse6 (<= .cse34 0)) (.cse9 (<= (select (select |#memory_$Pointer$.offsetInt| .cse32) .cse33) 0)) (.cse16 (<= (select (select |#memory_$Pointer$.baseInt| .cse32) .cse33) 0)) (.cse28 (not .cse12)) (.cse0 (<= .cse31 0)) (.cse2 (not (= .cse29 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|))) (.cse14 (<= (select (select |#memory_$Pointer$.baseInt| .cse29) .cse30) 0)) (.cse17 (<= (select (select |#memory_$Pointer$.offsetInt| .cse29) .cse30) 0)) (.cse26 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|))) (let ((.cse18 (select .cse26 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse20 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) (.cse21 (or .cse28 (and .cse0 .cse2 .cse14 .cse17))) (.cse13 (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))) (.cse7 (= |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| 0)) (.cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse22 (or (and .cse1 .cse6 .cse9 .cse16) .cse28)) (.cse15 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (let ((.cse11 (select (select |#memory_$Pointer$.offsetInt| .cse18) 4))) (let ((.cse4 (+ .cse11 4)) (.cse3 (select (select |#memory_$Pointer$.baseInt| .cse18) 4))) (and .cse0 .cse1 .cse2 (<= (select (select |#memory_$Pointer$.offsetInt| .cse3) .cse4) .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 0) (<= (select (select |#memory_$Pointer$.baseInt| .cse3) .cse4) 0) (not (= .cse3 |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) .cse12 (<= (+ .cse13 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (<= (div (+ (- 4294967297) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967297) 4294967296)) .cse14 .cse15 .cse16 .cse17))) (and (let ((.cse19 (mod (+ .cse20 1) 4294967296))) (<= (div (+ (- 4294967297) .cse19) (- 4294967296)) (div (+ (* (- 1) .cse19) 4294967297) 4294967296))) .cse21 .cse7 .cse8 .cse10 (<= .cse5 0) .cse22 (<= .cse18 0) .cse15) (let ((.cse25 (select .cse27 0))) (let ((.cse23 (select .cse26 0)) (.cse24 (+ .cse25 4))) (and (<= (div (+ (- 4294967297) .cse20) (- 4294967296)) (div (+ (* (- 1) .cse20) 4294967297) 4294967296)) .cse21 (<= .cse13 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse7 .cse8 .cse10 (<= (select (select |#memory_$Pointer$.baseInt| .cse23) .cse24) 0) (<= (select (select |#memory_$Pointer$.offsetInt| .cse23) .cse24) 0) .cse22 (<= .cse25 0) .cse15))))))))) [2022-01-10 17:51:08,964 INFO L854 garLoopResultBuilder]: At program point L581(lines 574 582) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (.cse2 (= |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse5 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (let ((.cse1 (+ |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 4))) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) .cse0 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse1)) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| 0) (<= 2 |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (not (= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) (not (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) .cse2 .cse3 .cse4 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse1) 0) .cse5)) (let ((.cse8 (div (+ |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse11 (* 18446744073709551616 .cse8))) (let ((.cse7 (div |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2147483648)) (.cse10 (+ |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| (* 18446744073709551616 (div (+ |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 18446744073709551615 .cse11) 18446744073709551616)))) (.cse6 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 1) 4294967296)) (.cse9 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4))) (and .cse0 (<= .cse6 .cse7) (not (<= (+ .cse8 1) 0)) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (<= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse9) 0) (or (< .cse10 .cse11) (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))) (<= (+ (* .cse7 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse2 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 0)) (<= .cse10 .cse11) (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| (* 18446744073709551616 (div (+ |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 18446744073709551615) 18446744073709551616))) .cse3 .cse4 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| (+ (* .cse6 4294967296) 1)) (not (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (<= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse9) 0) .cse5 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|)))))))) [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point L602-4(lines 602 604) no Hoare annotation was computed. [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 596) no Hoare annotation was computed. [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point L605(lines 605 607) no Hoare annotation was computed. [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point L602-2(lines 602 604) no Hoare annotation was computed. [2022-01-10 17:51:08,964 INFO L854 garLoopResultBuilder]: At program point L606(lines 597 611) the Hoare annotation is: false [2022-01-10 17:51:08,964 INFO L861 garLoopResultBuilder]: At program point L610(lines 597 611) the Hoare annotation is: true [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 17:51:08,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 17:51:08,966 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2022-01-10 17:51:08,967 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 17:51:08,984 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Cannot access array with 64bit indices via 3bit term. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation.IcfgTransformationObserver.lambda$0(IcfgTransformationObserver.java:355) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:113) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 17:51:08,989 INFO L158 Benchmark]: Toolchain (without parser) took 31190.24ms. Allocated memory was 192.9MB in the beginning and 280.0MB in the end (delta: 87.0MB). Free memory was 138.2MB in the beginning and 210.9MB in the end (delta: -72.6MB). Peak memory consumption was 144.4MB. Max. memory is 8.0GB. [2022-01-10 17:51:08,989 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 17:51:08,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.26ms. Allocated memory is still 192.9MB. Free memory was 138.1MB in the beginning and 159.3MB in the end (delta: -21.2MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-01-10 17:51:08,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.17ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 157.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 17:51:08,991 INFO L158 Benchmark]: Boogie Preprocessor took 20.51ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 155.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 17:51:08,991 INFO L158 Benchmark]: RCFGBuilder took 410.63ms. Allocated memory is still 192.9MB. Free memory was 155.7MB in the beginning and 142.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 17:51:08,991 INFO L158 Benchmark]: IcfgTransformer took 59.72ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 138.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 17:51:08,991 INFO L158 Benchmark]: TraceAbstraction took 30334.34ms. Allocated memory was 192.9MB in the beginning and 280.0MB in the end (delta: 87.0MB). Free memory was 137.9MB in the beginning and 210.9MB in the end (delta: -73.0MB). Peak memory consumption was 144.0MB. Max. memory is 8.0GB. [2022-01-10 17:51:08,997 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory was 155.8MB in the beginning and 155.7MB in the end (delta: 122.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.26ms. Allocated memory is still 192.9MB. Free memory was 138.1MB in the beginning and 159.3MB in the end (delta: -21.2MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.17ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 157.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.51ms. Allocated memory is still 192.9MB. Free memory was 157.3MB in the beginning and 155.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 410.63ms. Allocated memory is still 192.9MB. Free memory was 155.7MB in the beginning and 142.6MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 59.72ms. Allocated memory is still 192.9MB. Free memory was 142.6MB in the beginning and 138.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 30334.34ms. Allocated memory was 192.9MB in the beginning and 280.0MB in the end (delta: 87.0MB). Free memory was 137.9MB in the beginning and 210.9MB in the end (delta: -73.0MB). Peak memory consumption was 144.0MB. 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: 609]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 144 mSDsluCounter, 522 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 45 IncrementalHoareTripleChecker+Unchecked, 395 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 127 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 190 SyntacticMatches, 8 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 17 NumberOfFragments, 1224 HoareAnnotationTreeSize, 7 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 151 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 343 ConstructedInterpolants, 29 QuantifiedInterpolants, 6116 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2009 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 117/170 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: 597]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: AssertionError: Cannot access array with 64bit indices via 3bit term. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Cannot access array with 64bit indices via 3bit term.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 17:51:09,036 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...