/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_BITWISE.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:00:35,904 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:00:35,905 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:00:35,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:00:35,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:00:35,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:00:35,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:00:35,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:00:35,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:00:35,975 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:00:35,976 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:00:35,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:00:35,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:00:35,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:00:35,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:00:35,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:00:35,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:00:35,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:00:35,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:00:35,982 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:00:35,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:00:35,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:00:35,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:00:35,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:00:35,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:00:35,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:00:35,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:00:35,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:00:35,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:00:35,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:00:35,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:00:35,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:00:35,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:00:35,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:00:35,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:00:35,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:00:35,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:00:35,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:00:35,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:00:35,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:00:35,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:00:35,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:00:36,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:00:36,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:00:36,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:00:36,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:00:36,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:00:36,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:00:36,014 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:00:36,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:00:36,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:00:36,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:00:36,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:00:36,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:00:36,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:00:36,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:00:36,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:00:36,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:00:36,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:00:36,017 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:00:36,017 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 12:00:36,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:00:36,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:00:36,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:00:36,244 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:00:36,247 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:00:36,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2022-01-10 12:00:36,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620a69f5c/98343b8554bd49588dbd1716204181c1/FLAG2abfb14a5 [2022-01-10 12:00:36,769 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:00:36,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse.i [2022-01-10 12:00:36,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620a69f5c/98343b8554bd49588dbd1716204181c1/FLAG2abfb14a5 [2022-01-10 12:00:37,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620a69f5c/98343b8554bd49588dbd1716204181c1 [2022-01-10 12:00:37,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:00:37,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:00:37,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:00:37,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:00:37,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:00:37,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4373c5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37, skipping insertion in model container [2022-01-10 12:00:37,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:00:37,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:00:37,400 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_update_all_reverse.i[24236,24249] [2022-01-10 12:00:37,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:00:37,409 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:00:37,444 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_update_all_reverse.i[24236,24249] [2022-01-10 12:00:37,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:00:37,468 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:00:37,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37 WrapperNode [2022-01-10 12:00:37,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:00:37,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:00:37,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:00:37,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:00:37,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,522 INFO L137 Inliner]: procedures = 129, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-01-10 12:00:37,523 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:00:37,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:00:37,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:00:37,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:00:37,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:00:37,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:00:37,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:00:37,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:00:37,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:37,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:00:37,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:00:37,574 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 12:00:37,585 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 12:00:37,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:00:37,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:00:37,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:00:37,775 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:00:37,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:00:37,991 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:00:37,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:00:37,996 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 12:00:37,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:00:37 BoogieIcfgContainer [2022-01-10 12:00:37,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:00:37,998 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:00:37,999 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:00:38,001 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:00:38,003 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:00:37" (1/1) ... [2022-01-10 12:00:38,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:00:38 BasicIcfg [2022-01-10 12:00:38,101 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:00:38,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:00:38,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:00:38,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:00:38,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:00:37" (1/4) ... [2022-01-10 12:00:38,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:00:38, skipping insertion in model container [2022-01-10 12:00:38,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:00:37" (2/4) ... [2022-01-10 12:00:38,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:00:38, skipping insertion in model container [2022-01-10 12:00:38,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:00:37" (3/4) ... [2022-01-10 12:00:38,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5b967e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:00:38, skipping insertion in model container [2022-01-10 12:00:38,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:00:38" (4/4) ... [2022-01-10 12:00:38,107 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.iTransformedIcfg [2022-01-10 12:00:38,110 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:00:38,110 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 12:00:38,138 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:00:38,143 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 12:00:38,143 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 12:00:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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 12:00:38,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 12:00:38,164 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:38,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:38,165 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 670470688, now seen corresponding path program 1 times [2022-01-10 12:00:38,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:38,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211546524] [2022-01-10 12:00:38,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:38,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:38,331 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 12:00:38,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:38,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211546524] [2022-01-10 12:00:38,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211546524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:00:38,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:00:38,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 12:00:38,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926698087] [2022-01-10 12:00:38,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:00:38,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 12:00:38,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 12:00:38,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 12:00:38,374 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 12:00:38,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:38,389 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-01-10 12:00:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 12:00:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-01-10 12:00:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:38,397 INFO L225 Difference]: With dead ends: 52 [2022-01-10 12:00:38,397 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 12:00:38,399 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 12:00:38,403 INFO L933 BasicCegarLoop]: 36 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, 36 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 12:00:38,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:00:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 12:00:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 12:00:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 12:00:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-10 12:00:38,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-01-10 12:00:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:38,430 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-10 12:00:38,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 12:00:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-10 12:00:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 12:00:38,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:38,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:38,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:00:38,433 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:38,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash 617253185, now seen corresponding path program 1 times [2022-01-10 12:00:38,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:38,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315934170] [2022-01-10 12:00:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:38,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:38,553 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 12:00:38,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:38,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315934170] [2022-01-10 12:00:38,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315934170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:00:38,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:00:38,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:00:38,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834105130] [2022-01-10 12:00:38,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:00:38,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:00:38,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:38,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:00:38,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:00:38,557 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 12:00:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:38,577 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-01-10 12:00:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:00:38,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-01-10 12:00:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:38,578 INFO L225 Difference]: With dead ends: 44 [2022-01-10 12:00:38,579 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 12:00:38,579 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 12:00:38,580 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 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 12:00:38,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:00:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 12:00:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-01-10 12:00:38,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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 12:00:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 12:00:38,586 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2022-01-10 12:00:38,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:38,586 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 12:00:38,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 12:00:38,586 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 12:00:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 12:00:38,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:38,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:38,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:00:38,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:38,588 INFO L85 PathProgramCache]: Analyzing trace with hash -539620311, now seen corresponding path program 1 times [2022-01-10 12:00:38,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:38,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636897030] [2022-01-10 12:00:38,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:38,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:38,766 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 12:00:38,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:38,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636897030] [2022-01-10 12:00:38,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636897030] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:00:38,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:00:38,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 12:00:38,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95682943] [2022-01-10 12:00:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:00:38,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:00:38,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:00:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:00:38,769 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 12:00:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:38,864 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-01-10 12:00:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:00:38,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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) Word has length 18 [2022-01-10 12:00:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:38,867 INFO L225 Difference]: With dead ends: 46 [2022-01-10 12:00:38,867 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 12:00:38,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:00:38,872 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:00:38,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 80 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:00:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 12:00:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-01-10 12:00:38,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 12:00:38,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-10 12:00:38,883 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2022-01-10 12:00:38,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:38,883 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-10 12:00:38,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 12:00:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-10 12:00:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 12:00:38,884 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:38,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:38,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:00:38,885 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1842051929, now seen corresponding path program 1 times [2022-01-10 12:00:38,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:38,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505467962] [2022-01-10 12:00:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:38,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 12:00:39,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505467962] [2022-01-10 12:00:39,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505467962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:00:39,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:00:39,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:00:39,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173596677] [2022-01-10 12:00:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:00:39,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:00:39,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:39,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:00:39,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:00:39,075 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 12:00:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:39,177 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-01-10 12:00:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:00:39,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2022-01-10 12:00:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:39,178 INFO L225 Difference]: With dead ends: 52 [2022-01-10 12:00:39,178 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 12:00:39,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:00:39,184 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:00:39,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:00:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 12:00:39,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-01-10 12:00:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 12:00:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-10 12:00:39,190 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2022-01-10 12:00:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:39,191 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-10 12:00:39,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 12:00:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-10 12:00:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 12:00:39,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:39,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:39,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:00:39,192 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash -694483847, now seen corresponding path program 1 times [2022-01-10 12:00:39,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726244117] [2022-01-10 12:00:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:39,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 12:00:39,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:39,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726244117] [2022-01-10 12:00:39,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726244117] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:00:39,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260565825] [2022-01-10 12:00:39,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:39,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:00:39,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:00:39,339 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 12:00:39,340 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 12:00:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:39,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 12:00:39,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:00:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 12:00:39,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:00:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 12:00:40,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260565825] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 12:00:40,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 12:00:40,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2022-01-10 12:00:40,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450229465] [2022-01-10 12:00:40,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:00:40,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 12:00:40,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 12:00:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-10 12:00:40,065 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 12:00:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:40,174 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-01-10 12:00:40,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:00:40,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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) Word has length 24 [2022-01-10 12:00:40,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:40,178 INFO L225 Difference]: With dead ends: 47 [2022-01-10 12:00:40,178 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 12:00:40,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-10 12:00:40,179 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 114 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:00:40,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 60 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:00:40,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 12:00:40,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2022-01-10 12:00:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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 12:00:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-10 12:00:40,186 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2022-01-10 12:00:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:40,186 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-10 12:00:40,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 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 12:00:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-10 12:00:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 12:00:40,187 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:40,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:40,210 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 12:00:40,399 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 12:00:40,399 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash -31165988, now seen corresponding path program 1 times [2022-01-10 12:00:40,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:40,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768112169] [2022-01-10 12:00:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:40,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:00:40,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768112169] [2022-01-10 12:00:40,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768112169] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:00:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619569459] [2022-01-10 12:00:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:40,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:00:40,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:00:40,510 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 12:00:40,534 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 12:00:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:41,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-10 12:00:41,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:00:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 12:00:41,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:00:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 12:00:41,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619569459] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 12:00:41,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 12:00:41,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 6] total 11 [2022-01-10 12:00:41,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17683630] [2022-01-10 12:00:41,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:00:41,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:00:41,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:00:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-10 12:00:41,599 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 12:00:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:41,719 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-01-10 12:00:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:00:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 12:00:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:41,720 INFO L225 Difference]: With dead ends: 44 [2022-01-10 12:00:41,720 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 12:00:41,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:00:41,720 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:00:41,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 65 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:00:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 12:00:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-01-10 12:00:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.1875) internal successors, (38), 32 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 12:00:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-01-10 12:00:41,727 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 25 [2022-01-10 12:00:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:41,727 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-01-10 12:00:41,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 12:00:41,727 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-01-10 12:00:41,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 12:00:41,728 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:41,728 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:41,747 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 12:00:41,939 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 12:00:41,939 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:41,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:41,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1306504372, now seen corresponding path program 2 times [2022-01-10 12:00:41,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:41,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091689406] [2022-01-10 12:00:41,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:41,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 12:00:42,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:42,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091689406] [2022-01-10 12:00:42,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091689406] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:00:42,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631121978] [2022-01-10 12:00:42,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 12:00:42,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:00:42,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:00:42,007 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 12:00:42,051 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 12:00:42,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 12:00:42,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:00:42,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 12:00:42,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:00:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 12:00:42,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:00:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 12:00:42,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631121978] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:00:42,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:00:42,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 12:00:42,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637924590] [2022-01-10 12:00:42,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:00:42,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 12:00:42,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 12:00:42,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:00:42,599 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 12:00:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:42,636 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-01-10 12:00:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:00:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 12:00:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:42,637 INFO L225 Difference]: With dead ends: 67 [2022-01-10 12:00:42,637 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 12:00:42,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-10 12:00:42,638 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:00:42,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:00:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 12:00:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2022-01-10 12:00:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 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 12:00:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-01-10 12:00:42,644 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 30 [2022-01-10 12:00:42,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:42,644 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-01-10 12:00:42,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 12:00:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-01-10 12:00:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 12:00:42,645 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:42,645 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:42,663 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 12:00:42,859 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 12:00:42,859 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:42,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:42,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1199439204, now seen corresponding path program 3 times [2022-01-10 12:00:42,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:42,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190168458] [2022-01-10 12:00:42,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:42,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:00:45,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190168458] [2022-01-10 12:00:45,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190168458] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:00:45,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862060700] [2022-01-10 12:00:45,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 12:00:45,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:00:45,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:00:45,058 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 12:00:45,059 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 12:00:45,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 12:00:45,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:00:45,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 100 conjunts are in the unsatisfiable core [2022-01-10 12:00:45,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:00:45,701 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 12:00:45,825 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 12:00:45,826 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 18 treesize of output 16 [2022-01-10 12:00:46,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 12:00:46,013 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 12:00:46,433 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 12:00:46,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 84 treesize of output 81 [2022-01-10 12:00:46,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2022-01-10 12:00:46,441 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 46 treesize of output 48 [2022-01-10 12:00:46,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 12:00:46,662 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 55 treesize of output 46 [2022-01-10 12:00:46,668 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 38 treesize of output 40 [2022-01-10 12:00:46,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 12:00:46,674 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 43 treesize of output 42 [2022-01-10 12:00:46,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 23 [2022-01-10 12:00:46,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 11 [2022-01-10 12:00:46,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 12:00:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:00:47,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:00:47,376 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_308 Int) (v_ArrVal_304 Int)) (<= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_306) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| v_ArrVal_308)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| v_ArrVal_304)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0))))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_308 Int) (v_ArrVal_304 Int)) (<= (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_306) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| v_ArrVal_308)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| v_ArrVal_304)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296)))) is different from false [2022-01-10 12:00:47,447 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_308 Int) (v_ArrVal_304 Int)) (<= (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_306) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) .cse0)) (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) .cse0))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_308 Int) (v_ArrVal_304 Int)) (<= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_306) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) .cse1)) (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) .cse1)))))) is different from false [2022-01-10 12:00:47,473 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 12:00:47,473 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 54 treesize of output 55 [2022-01-10 12:00:47,482 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 12:00:47,483 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 116 treesize of output 119 [2022-01-10 12:00:47,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2022-01-10 12:00:47,590 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 12:00:47,590 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 54 treesize of output 55 [2022-01-10 12:00:47,601 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 12:00:47,601 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 116 treesize of output 119 [2022-01-10 12:00:47,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2022-01-10 12:00:47,674 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (<= |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int| .cse0) (<= .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|)) (forall ((v_ArrVal_304 Int) (v_ArrVal_301 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_301) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|)) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))))))) is different from false [2022-01-10 12:00:47,713 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))))) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int| .cse0) (<= .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 4) 18446744073709551616)))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse1 v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))))) (forall ((v_ArrVal_304 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 4) 18446744073709551616))) (= (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) .cse2) (select (store (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) .cse2) v_ArrVal_301) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))))))) is different from false [2022-01-10 12:00:47,736 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) .cse1) .cse0)))) (<= .cse2 .cse3) (forall ((v_ArrVal_304 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (= (select (store (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse4) v_ArrVal_301) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) .cse4) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse4)))) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (not (= (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse5) v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) .cse5)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (<= .cse3 .cse2))) is different from false [2022-01-10 12:00:47,755 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse1))) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| v_ArrVal_308) .cse1) .cse0)))) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (not (= (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 4) 18446744073709551616))) (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse2) v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| v_ArrVal_308) .cse2)) |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|))) (forall ((v_ArrVal_304 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 4) 18446744073709551616))) (= (select (store (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse3) v_ArrVal_301) |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| v_ArrVal_304) .cse3) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse3))))) is different from false [2022-01-10 12:00:47,771 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse1))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| v_ArrVal_308) .cse1))))) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (not (= (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4) 18446744073709551616))) (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse2) v_ArrVal_303) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| v_ArrVal_308) .cse2)) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (forall ((v_ArrVal_304 Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4) 18446744073709551616))) (= (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse3) (select (store (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse3) v_ArrVal_301) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| v_ArrVal_304) .cse3))))) is different from false [2022-01-10 12:00:47,809 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 12:00:47,810 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 29 treesize of output 30 [2022-01-10 12:00:47,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-01-10 12:00:47,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 12:00:47,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-01-10 12:00:47,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-01-10 12:00:47,830 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 12:00:47,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 1 [2022-01-10 12:00:47,835 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 12:00:47,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 1 [2022-01-10 12:00:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-01-10 12:00:48,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862060700] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:00:48,139 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:00:48,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2022-01-10 12:00:48,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407414788] [2022-01-10 12:00:48,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:00:48,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-01-10 12:00:48,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-01-10 12:00:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2308, Unknown=7, NotChecked=714, Total=3192 [2022-01-10 12:00:48,143 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 57 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 57 states have internal predecessors, (95), 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 12:00:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:00:53,315 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2022-01-10 12:00:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 12:00:53,318 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 57 states have internal predecessors, (95), 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 35 [2022-01-10 12:00:53,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:00:53,320 INFO L225 Difference]: With dead ends: 80 [2022-01-10 12:00:53,320 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 12:00:53,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=590, Invalid=4833, Unknown=7, NotChecked=1050, Total=6480 [2022-01-10 12:00:53,322 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 194 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 12:00:53,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 444 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 825 Invalid, 0 Unknown, 321 Unchecked, 0.8s Time] [2022-01-10 12:00:53,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 12:00:53,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 55. [2022-01-10 12:00:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 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 12:00:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2022-01-10 12:00:53,340 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 35 [2022-01-10 12:00:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:00:53,341 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2022-01-10 12:00:53,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 57 states have internal predecessors, (95), 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 12:00:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2022-01-10 12:00:53,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 12:00:53,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:00:53,346 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:00:53,365 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 12:00:53,565 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 12:00:53,565 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:00:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:00:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1449093551, now seen corresponding path program 4 times [2022-01-10 12:00:53,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:00:53,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466326381] [2022-01-10 12:00:53,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:00:53,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:00:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:00:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 12:00:53,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:00:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466326381] [2022-01-10 12:00:53,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466326381] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:00:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036091303] [2022-01-10 12:00:53,672 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 12:00:53,672 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:00:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:00:53,674 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 12:00:53,696 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 12:00:54,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 12:00:54,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:00:54,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 12:00:54,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:00:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 12:00:56,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:00:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 12:00:59,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036091303] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:00:59,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:00:59,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 12] total 26 [2022-01-10 12:00:59,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322880967] [2022-01-10 12:00:59,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:00:59,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 12:00:59,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:00:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 12:00:59,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2022-01-10 12:00:59,044 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 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 12:01:01,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:01:01,795 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2022-01-10 12:01:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 12:01:01,796 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 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 36 [2022-01-10 12:01:01,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:01:01,796 INFO L225 Difference]: With dead ends: 96 [2022-01-10 12:01:01,796 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 12:01:01,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=284, Invalid=906, Unknown=0, NotChecked=0, Total=1190 [2022-01-10 12:01:01,799 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 141 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 12:01:01,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 224 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 12:01:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 12:01:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-01-10 12:01:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 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 12:01:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2022-01-10 12:01:01,812 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 36 [2022-01-10 12:01:01,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:01:01,812 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2022-01-10 12:01:01,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 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 12:01:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-01-10 12:01:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 12:01:01,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:01:01,813 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:01:01,847 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 12:01:02,031 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 12:01:02,032 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:01:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:01:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash 636608276, now seen corresponding path program 5 times [2022-01-10 12:01:02,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:01:02,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698499110] [2022-01-10 12:01:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:01:02,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:01:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:01:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 12:01:02,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:01:02,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698499110] [2022-01-10 12:01:02,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698499110] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:01:02,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187106683] [2022-01-10 12:01:02,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 12:01:02,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:01:02,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:01:02,168 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:01:02,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 12:01:04,452 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-10 12:01:04,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 12:01:04,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 12:01:04,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:01:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 12:01:05,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:01:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 12:01:05,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187106683] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:01:05,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:01:05,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2022-01-10 12:01:05,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708365546] [2022-01-10 12:01:05,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:01:05,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 12:01:05,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:01:05,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 12:01:05,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-10 12:01:05,530 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 12:01:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:01:06,162 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-01-10 12:01:06,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 12:01:06,162 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 36 [2022-01-10 12:01:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:01:06,163 INFO L225 Difference]: With dead ends: 67 [2022-01-10 12:01:06,163 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 12:01:06,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-01-10 12:01:06,164 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:01:06,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 182 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 12:01:06,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 12:01:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-01-10 12:01:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 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 12:01:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-01-10 12:01:06,176 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2022-01-10 12:01:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:01:06,176 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-01-10 12:01:06,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 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 12:01:06,176 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-01-10 12:01:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 12:01:06,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:01:06,177 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:01:06,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 12:01:06,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:01:06,380 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 12:01:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:01:06,381 INFO L85 PathProgramCache]: Analyzing trace with hash -428948369, now seen corresponding path program 1 times [2022-01-10 12:01:06,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:01:06,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654611054] [2022-01-10 12:01:06,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:01:06,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:01:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:01:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:01:07,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:01:07,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654611054] [2022-01-10 12:01:07,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654611054] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:01:07,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445075747] [2022-01-10 12:01:07,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:01:07,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:01:07,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:01:07,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:01:07,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 12:01:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:01:07,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 114 conjunts are in the unsatisfiable core [2022-01-10 12:01:07,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:01:08,110 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 27 treesize of output 23 [2022-01-10 12:01:14,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 12:01:14,106 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 12:01:14,106 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 136 treesize of output 111 [2022-01-10 12:01:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 12:01:16,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:01:17,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-01-10 12:01:17,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 12:01:17,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 12:01:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 12:01:19,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445075747] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:01:19,496 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:01:19,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 19] total 48 [2022-01-10 12:01:19,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467465972] [2022-01-10 12:01:19,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:01:19,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-10 12:01:19,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:01:19,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-10 12:01:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2022, Unknown=1, NotChecked=0, Total=2256 [2022-01-10 12:01:19,499 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 48 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 48 states have internal predecessors, (110), 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 12:01:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:01:25,267 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-01-10 12:01:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 12:01:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 48 states have internal predecessors, (110), 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 41 [2022-01-10 12:01:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:01:25,268 INFO L225 Difference]: With dead ends: 42 [2022-01-10 12:01:25,268 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 12:01:25,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=496, Invalid=2924, Unknown=2, NotChecked=0, Total=3422 [2022-01-10 12:01:25,269 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 121 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 12:01:25,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 163 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 227 Invalid, 0 Unknown, 43 Unchecked, 0.3s Time] [2022-01-10 12:01:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 12:01:25,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 12:01:25,270 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 12:01:25,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 12:01:25,270 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-01-10 12:01:25,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:01:25,270 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 12:01:25,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 48 states have internal predecessors, (110), 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 12:01:25,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 12:01:25,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 12:01:25,273 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 12:01:25,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 12:01:25,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:01:25,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 12:01:36,716 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 12:01:36,717 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 12:01:36,717 INFO L854 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse6 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse7 (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse8 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse9 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse10 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse11 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| |ULTIMATE.start_ULTIMATE.start_node_create_~data#1Int|))) (or (let ((.cse4 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 1))) (let ((.cse5 (mod .cse4 4294967296))) (and .cse0 .cse1 .cse2 .cse3 (< (div |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2147483648) (+ (div .cse4 4294967296) 1)) (<= 2 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse5 2)))) (and .cse1 (<= 2 |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse10 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |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|) (+ (* (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) 0)))) [2022-01-10 12:01:36,717 INFO L858 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2022-01-10 12:01:36,717 INFO L858 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-01-10 12:01:36,717 INFO L854 garLoopResultBuilder]: At program point L590(lines 583 591) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 18446744073709551616)) 4))) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 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$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse0) 0) (<= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (= (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|) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| |ULTIMATE.start_ULTIMATE.start_node_create_~data#1Int|) (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse0))) (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |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|) (+ (* (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) 0))) [2022-01-10 12:01:36,717 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-01-10 12:01:36,717 INFO L858 garLoopResultBuilder]: For program point L576-1(lines 576 578) no Hoare annotation was computed. [2022-01-10 12:01:36,717 INFO L854 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse13 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse25 (div .cse13 4294967296)) (.cse2 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2)) (.cse1 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse23 (* .cse25 4294967296))) (let ((.cse14 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (.cse15 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse16 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 0)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse5 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse19 (+ .cse23 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse7 (= (select .cse1 (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4 (* (- 18446744073709551616) (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 18446744073709551616)))) 0)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse21 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| |ULTIMATE.start_ULTIMATE.start_node_create_~data#1Int|)) (.cse22 (not (= .cse0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse6 (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1))) (or (let ((.cse3 (mod .cse13 4294967296))) (and (= (select (select |#memory_intInt| .cse0) (select .cse1 .cse2)) (mod (+ .cse3 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) (< |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4294967296) .cse4 .cse5 (= .cse3 (mod (+ (mod .cse6 4294967296) 1) 4294967296)) .cse7 (exists ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203| Int) (|ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| Int)) (let ((.cse10 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|))) (let ((.cse12 (+ (* 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse10)) (.cse11 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 2147483648)) (.cse9 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 4294967296)) (.cse8 (+ (* 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse10))) (and (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) (< .cse8 (+ 4294967297 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) .cse9)) (<= 0 .cse10) (<= .cse11 .cse12) (< .cse12 (+ .cse11 2147483648)) (<= (+ 1 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) (< .cse10 4294967296) (<= (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) .cse9) .cse8))))))) (let ((.cse17 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 18446744073709551616)) 4))) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) .cse14 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt|) .cse15 .cse16 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse17) 0) .cse18 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (<= .cse19 4294967297) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|) .cse4 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|) .cse5 .cse7 .cse20 .cse21 (<= 4294967297 .cse19) (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse17))) (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) .cse22 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) 0))) (let ((.cse26 (div .cse6 4294967296))) (and .cse14 .cse15 .cse16 .cse18 (<= (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967297) (or (let ((.cse24 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 1) 4294967296))) (and (<= (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| .cse23) (+ (* 4294967296 .cse24) 4294967296)) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|) (<= (+ 1 .cse24) .cse25))) (<= 4294967296 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|)) (< (+ (* 2 .cse26) 1) (+ (* .cse25 2) (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_308 Int) (v_ArrVal_304 Int)) (<= (mod (+ (mod (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296) (let ((.cse27 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_306) (select (store (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) .cse27)) (select (store (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) .cse27))))) .cse4 .cse5 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (<= .cse19 (+ 4294967296 (* .cse26 4294967296))) .cse7 .cse20 .cse21 (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_308 Int) (v_ArrVal_304 Int)) (<= (let ((.cse28 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_306) (select (store (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) .cse28)) (select (store (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) .cse28))) (mod (+ (mod (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) .cse22))))))) [2022-01-10 12:01:36,718 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)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse3 (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse4 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse5 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse6 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse7 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse8 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| |ULTIMATE.start_ULTIMATE.start_node_create_~data#1Int|))) (or (and .cse0 .cse1 (<= 2 |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2) .cse7 .cse8) (let ((.cse10 (div (+ |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 1) 4294967296)) (.cse9 (+ |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 4 (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 18446744073709551616))))) (and (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse9) 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) .cse0 .cse1 (<= (+ (* .cse10 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int|) (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (not (<= (+ .cse10 1) (div |ULTIMATE.start_ULTIMATE.start_sll_create_~len#1Int| 2147483648))) (<= 1 |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse2 .cse3 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) .cse4 .cse5 .cse6 .cse7 .cse8 (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse9) 0) (not (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (< 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))))) [2022-01-10 12:01:36,718 INFO L858 garLoopResultBuilder]: For program point L618-4(lines 618 621) no Hoare annotation was computed. [2022-01-10 12:01:36,718 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse32 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse27 (* (div .cse32 4294967296) 4294967296)) (.cse31 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse29 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse31)) (.cse30 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse34 (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4 (* (- 18446744073709551616) (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 18446744073709551616)))) (.cse20 (+ .cse27 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse35 (+ |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 18446744073709551616)) 4))) (let ((.cse0 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt|)) (.cse4 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse6 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| (select |#validInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse7 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse35) 0)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (.cse10 (= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0)) (.cse11 (<= .cse20 4294967297)) (.cse12 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse13 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse14 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int|)) (.cse15 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|)) (.cse17 (= (select .cse30 .cse34) 0)) (.cse21 (not (= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.baseInt|) .cse35)))) (.cse22 (not (= (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (- 18446744073709551616) (div |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (.cse25 (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (+ (* (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 18446744073709551616) (- 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 4)) 0)) (.cse1 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (.cse3 (<= |ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 0)) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_sll_create_#res#1.offsetInt| 0)) (.cse16 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse18 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| 1)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_sll_create_~data#1Int| |ULTIMATE.start_ULTIMATE.start_node_create_~data#1Int|)) (.cse23 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|)) (.cse24 (not (= .cse29 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse26 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (or (let ((.cse5 (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| .cse27))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 4294967297) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 4294967297 .cse5) (<= 4294967297 .cse20) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int|) (forall ((v_ArrVal_303 (Array Int Int)) (v_ArrVal_308 Int)) (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| (select (store (select (store |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_303) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_308) (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)))) .cse21 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 1) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (let ((.cse28 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (<= (div (+ .cse28 4294967296) 4294967296) (div (+ .cse28 (* (mod (+ 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 2147483648) 2) 1) 4294967296))) .cse22 .cse25 (forall ((v_ArrVal_304 Int) (v_ArrVal_301 (Array Int Int))) (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| (select (store (select (store |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt| v_ArrVal_301) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| v_ArrVal_304) (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))))) (let ((.cse33 (* 2 (mod |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| 2147483648)))) (and .cse1 (= (select (select |#memory_intInt| .cse29) (select .cse30 .cse31)) (mod (+ (mod .cse32 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) .cse3 (= 2 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))) (not (< |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| .cse33)) .cse8 (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~index#1Int| .cse33) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (= (select (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.baseInt|) .cse34) 0) (<= |ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 0) .cse16 (<= .cse20 (+ 4294967296 (* (div (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296) 4294967296))) .cse18 .cse19 (= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| 0) .cse23 .cse24 .cse26))))))) [2022-01-10 12:01:36,718 INFO L858 garLoopResultBuilder]: For program point L585-2(lines 585 589) no Hoare annotation was computed. [2022-01-10 12:01:36,718 INFO L854 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse6 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse4 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse5 (exists ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203| Int) (|ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| Int)) (let ((.cse14 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|))) (let ((.cse16 (+ (* 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse14)) (.cse15 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 2147483648)) (.cse13 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 4294967296)) (.cse12 (+ (* 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse14))) (and (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) (< .cse12 (+ 4294967297 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) .cse13)) (<= 0 .cse14) (<= .cse15 .cse16) (< .cse16 (+ .cse15 2147483648)) (<= (+ 1 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) (< .cse14 4294967296) (<= (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) .cse13) .cse12)))))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2)) (.cse2 (mod .cse6 4294967296)) (.cse10 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|)) (.cse11 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (or (let ((.cse1 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse3 (+ (* (div .cse6 4294967296) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (and (= (let ((.cse0 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select |#memory_intInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0)) (select .cse1 .cse0))) (mod (+ .cse2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) (<= .cse3 4294967297) .cse4 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= (select .cse1 (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4 (* (- 18446744073709551616) (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 18446744073709551616)))) 0) (<= 4294967297 .cse3) .cse5)) (let ((.cse7 (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)))) (and (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| .cse7) .cse8 .cse9 .cse4 (<= .cse7 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse5 .cse10 .cse11)) (and (< |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4294967296) .cse8 .cse9 (= .cse2 (mod (+ (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296) 1) 4294967296)) .cse10 .cse11)))) [2022-01-10 12:01:36,718 INFO L858 garLoopResultBuilder]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2022-01-10 12:01:36,718 INFO L858 garLoopResultBuilder]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2022-01-10 12:01:36,718 INFO L854 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse33 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse30 (+ (* (div .cse33 4294967296) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse31 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (let ((.cse0 (= (let ((.cse32 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select |#memory_intInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse32)) (select .cse31 .cse32))) (mod (+ (mod .cse33 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296))) (.cse1 (= 3 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse3 (<= .cse30 4294967297)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse5 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse6 (= (select .cse31 (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4 (* (- 18446744073709551616) (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 18446744073709551616)))) 0)) (.cse7 (<= 4294967297 .cse30)) (.cse8 (exists ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203| Int) (|ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| Int)) (let ((.cse27 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|))) (let ((.cse29 (+ (* 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse27)) (.cse28 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 2147483648)) (.cse26 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 4294967296)) (.cse25 (+ (* 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse27))) (and (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) (< .cse25 (+ 4294967297 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) .cse26)) (<= 0 .cse27) (<= .cse28 .cse29) (< .cse29 (+ .cse28 2147483648)) (<= (+ 1 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) (< .cse27 4294967296) (<= (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) .cse26) .cse25)))))) (.cse2 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 0)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt| 0)) (.cse9 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 3 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|)) .cse8 .cse9) (let ((.cse11 (+ |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt| 4))) (let ((.cse13 (mod .cse11 18446744073709551616))) (let ((.cse12 (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) .cse13)) (.cse10 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|))) (and .cse0 .cse1 (= (select .cse10 (+ (* (- 18446744073709551616) (div .cse11 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt| 4)) 0) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|) (not (= .cse12 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|)) (= (select (select |#memory_intInt| .cse12) (select .cse10 .cse13)) 3) .cse3 (= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse14)))) (let ((.cse15 (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)))) (and (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296) (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| .cse15) (exists ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203| Int) (|ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| Int)) (let ((.cse19 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|))) (let ((.cse24 (+ 2 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|)) (.cse23 (+ (* |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129| 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse22 (+ (* 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (* |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129| 9223372032559808512) .cse19)) (.cse20 (* 2147483647 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|)) (.cse21 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 2147483648)) (.cse17 (* 4294967295 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|)) (.cse18 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 4294967296)) (.cse16 (+ .cse19 (* 18446744069414584320 |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129|) (* 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)))) (and (< .cse16 (+ 4294967297 .cse17 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) .cse18)) (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|) (< .cse19 4294967296) (<= (+ .cse20 .cse21) .cse22) (<= 0 .cse19) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) (<= .cse23 .cse24) (<= .cse24 .cse23) (< .cse22 (+ .cse20 .cse21 2147483648)) (<= (+ 1 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) (<= (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) .cse17 .cse18) .cse16))))) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse2 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (<= .cse15 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse14 .cse9 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))))))) [2022-01-10 12:01:36,718 INFO L858 garLoopResultBuilder]: For program point L606(lines 606 612) no Hoare annotation was computed. [2022-01-10 12:01:36,718 INFO L861 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-01-10 12:01:36,718 INFO L858 garLoopResultBuilder]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2022-01-10 12:01:36,719 INFO L858 garLoopResultBuilder]: For program point L618-2(lines 618 621) no Hoare annotation was computed. [2022-01-10 12:01:36,719 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 598) no Hoare annotation was computed. [2022-01-10 12:01:36,719 INFO L854 garLoopResultBuilder]: At program point L604(lines 599 605) the Hoare annotation is: (let ((.cse1 (<= |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int| 0)) (.cse16 (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int|))) (or (let ((.cse0 (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)))) (and (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296) (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| .cse0) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (< |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int| 4294967296) .cse1 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|) (<= .cse0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (exists ((|aux_mod_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129| Int) (|aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179| Int)) (let ((.cse13 (* |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179| 4294967296)) (.cse14 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| 2147483648))) (let ((.cse5 (* 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse6 (* |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129| 9223372032559808512)) (.cse4 (+ (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 2147483648) (* 2147483647 |aux_mod_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114|) (* |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179| 9223372032559808512) (* 4611686016279904256 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114|))) (.cse9 (* |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179| 18446744069414584320)) (.cse10 (* |aux_mod_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| 4294967295)) (.cse11 (* |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| 9223372034707292160)) (.cse12 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 4294967296)) (.cse7 (* 18446744069414584320 |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129|)) (.cse8 (* 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse3 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| .cse14)) (.cse2 (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| .cse13 .cse14)) (.cse15 (+ (* |aux_div_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int_129| 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 2147483646))) (and (<= (+ (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76| 2147483648) 2147483648) .cse2) (<= 2147483647 .cse3) (<= .cse2 (+ (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76| 4294967296) 2147483648)) (<= .cse4 (+ .cse5 4611686016279904256 .cse6 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|)) (< (+ .cse5 .cse6 4611686014132420608 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|) .cse4) (< (+ 9223372030412324863 .cse7 .cse8 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|) (+ .cse9 .cse10 .cse11 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) .cse12)) (<= (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) .cse9 .cse10 .cse11 .cse12) (+ 9223372034707292160 .cse7 .cse8 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|)) (< |aux_mod_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| 2147483648) (< .cse3 6442450943) (<= (+ .cse13 .cse14) (+ |aux_mod_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~index#1Int_76_179_114| 2147483648)) (<= (+ 1 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) (<= .cse15 .cse2) (<= .cse2 .cse15))))) .cse16 (<= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse19 (+ 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|))) (let ((.cse18 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse20 (+ (* (div .cse19 4294967296) 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (and (= (let ((.cse17 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (select (select |#memory_intInt| (select (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse17)) (select .cse18 .cse17))) (mod (+ (mod .cse19 4294967296) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296)) (= 3 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse1 (<= .cse20 4294967297) (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= 3 |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_#res#1Int|) (= (select .cse18 (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4 (* (- 18446744073709551616) (div (+ 18446744073709551615 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 18446744073709551616)))) 0) (<= 4294967297 .cse20) (= 3 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_get_data_at_~head#1.offsetInt|)) (exists ((|aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203| Int) (|ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| Int) (|aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270| Int) (|aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| Int)) (let ((.cse23 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|))) (let ((.cse25 (+ (* 2147483647 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse23)) (.cse24 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 2147483648)) (.cse22 (* |aux_div_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141| 4294967296)) (.cse21 (+ (* 4294967295 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) .cse23))) (and (<= |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_sll_update_at_~head#1.offsetInt|) (< .cse21 (+ 4294967297 (* 4294967296 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) .cse22)) (<= 0 .cse23) (<= .cse24 .cse25) (< .cse25 (+ .cse24 2147483648)) (<= (+ 1 |aux_div_aux_mod_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270_203|) |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) (< .cse23 4294967296) (<= (+ (* 4294967296 |aux_div_aux_mod_ULTIMATE.start_ULTIMATE.start_sll_update_at_~data#1Int_141_270|) .cse22) .cse21))))) .cse16))))) [2022-01-10 12:01:36,719 INFO L861 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-01-10 12:01:36,719 INFO L858 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-01-10 12:01:36,719 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 12:01:36,719 INFO L854 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-01-10 12:01:36,719 INFO L858 garLoopResultBuilder]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2022-01-10 12:01:36,719 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 12:01:36,719 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-01-10 12:01:36,722 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-01-10 12:01:36,722 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 12:01:36,731 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 131bit 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 12:01:36,735 INFO L158 Benchmark]: Toolchain (without parser) took 59604.01ms. Allocated memory was 189.8MB in the beginning and 330.3MB in the end (delta: 140.5MB). Free memory was 137.2MB in the beginning and 226.7MB in the end (delta: -89.5MB). Peak memory consumption was 170.3MB. Max. memory is 8.0GB. [2022-01-10 12:01:36,735 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 12:01:36,735 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.87ms. Allocated memory is still 189.8MB. Free memory was 136.9MB in the beginning and 157.7MB in the end (delta: -20.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-01-10 12:01:36,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.72ms. Allocated memory is still 189.8MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 12:01:36,736 INFO L158 Benchmark]: Boogie Preprocessor took 23.52ms. Allocated memory is still 189.8MB. Free memory was 155.6MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 12:01:36,736 INFO L158 Benchmark]: RCFGBuilder took 450.52ms. Allocated memory is still 189.8MB. Free memory was 153.5MB in the beginning and 139.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 12:01:36,736 INFO L158 Benchmark]: IcfgTransformer took 102.92ms. Allocated memory is still 189.8MB. Free memory was 139.9MB in the beginning and 134.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-10 12:01:36,736 INFO L158 Benchmark]: TraceAbstraction took 58631.83ms. Allocated memory was 189.8MB in the beginning and 330.3MB in the end (delta: 140.5MB). Free memory was 134.1MB in the beginning and 226.7MB in the end (delta: -92.6MB). Peak memory consumption was 167.5MB. Max. memory is 8.0GB. [2022-01-10 12:01:36,737 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.11ms. Allocated memory is still 189.8MB. Free memory is still 154.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 336.87ms. Allocated memory is still 189.8MB. Free memory was 136.9MB in the beginning and 157.7MB in the end (delta: -20.8MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.72ms. Allocated memory is still 189.8MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.52ms. Allocated memory is still 189.8MB. Free memory was 155.6MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 450.52ms. Allocated memory is still 189.8MB. Free memory was 153.5MB in the beginning and 139.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 102.92ms. Allocated memory is still 189.8MB. Free memory was 139.9MB in the beginning and 134.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 58631.83ms. Allocated memory was 189.8MB in the beginning and 330.3MB in the end (delta: 140.5MB). Free memory was 134.1MB in the beginning and 226.7MB in the end (delta: -92.6MB). Peak memory consumption was 167.5MB. 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: 630]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 759 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 759 mSDsluCounter, 1477 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 364 IncrementalHoareTripleChecker+Unchecked, 1234 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1433 IncrementalHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 243 mSDtfsCounter, 1433 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 343 SyntacticMatches, 14 SemanticMatches, 233 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 1969 ImplicationChecksByTransitivity, 24.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=9, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 68 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 32 NumberOfFragments, 2826 HoareAnnotationTreeSize, 12 FomulaSimplifications, 539 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 6661 FormulaSimplificationTreeSizeReductionInter, 11.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 24.8s InterpolantComputationTime, 521 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 723 ConstructedInterpolants, 29 QuantifiedInterpolants, 17276 SizeOfPredicates, 109 NumberOfNonLiveVariables, 3701 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 160/294 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: AssertionError: Cannot access array with 64bit indices via 131bit term. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Cannot access array with 64bit indices via 131bit 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 12:01:36,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...