/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:48:48,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:48:48,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:48:48,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:48:48,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:48:48,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:48:48,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:48:48,631 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:48:48,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:48:48,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:48:48,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:48:48,634 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:48:48,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:48:48,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:48:48,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:48:48,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:48:48,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:48:48,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:48:48,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:48:48,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:48:48,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:48:48,653 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:48:48,653 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:48:48,654 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:48:48,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:48:48,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:48:48,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:48:48,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:48:48,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:48:48,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:48:48,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:48:48,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:48:48,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:48:48,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:48:48,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:48:48,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:48:48,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:48:48,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:48:48,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:48:48,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:48:48,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:48:48,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:48:48,683 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:48:48,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:48:48,683 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:48:48,683 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:48:48,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:48:48,684 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:48:48,684 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:48:48,684 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:48:48,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:48:48,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:48:48,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:48:48,686 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:48:48,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:48:48,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:48:48,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:48:48,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:48:48,690 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:48:48,690 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:48:48,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:48:48,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:48:48,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:48:48,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:48:48,864 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:48:48,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_update_all.i [2022-01-10 17:48:48,918 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a7fd801/524536cc2685455a99c44496a23c6696/FLAG3fa394540 [2022-01-10 17:48:49,306 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:48:49,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_update_all.i [2022-01-10 17:48:49,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a7fd801/524536cc2685455a99c44496a23c6696/FLAG3fa394540 [2022-01-10 17:48:49,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a7fd801/524536cc2685455a99c44496a23c6696 [2022-01-10 17:48:49,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:48:49,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:48:49,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:48:49,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:48:49,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:48:49,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55239b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49, skipping insertion in model container [2022-01-10 17:48:49,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:48:49,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:48:49,568 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/dll2n_update_all.i[24455,24468] [2022-01-10 17:48:49,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:48:49,578 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:48:49,613 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/dll2n_update_all.i[24455,24468] [2022-01-10 17:48:49,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:48:49,631 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:48:49,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49 WrapperNode [2022-01-10 17:48:49,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:48:49,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:48:49,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:48:49,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:48:49,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,665 INFO L137 Inliner]: procedures = 129, calls = 27, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 114 [2022-01-10 17:48:49,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:48:49,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:48:49,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:48:49,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:48:49,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:48:49,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:48:49,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:48:49,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:48:49,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (1/1) ... [2022-01-10 17:48:49,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:48:49,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:48:49,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:48:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:48:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:48:49,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:48:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:48:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:48:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:48:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:48:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:48:49,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:48:49,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:48:49,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:48:49,832 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:48:49,833 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:48:50,038 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:48:50,043 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:48:50,043 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-10 17:48:50,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:48:50 BoogieIcfgContainer [2022-01-10 17:48:50,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:48:50,045 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:48:50,045 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:48:50,046 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:48:50,047 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:48:50" (1/1) ... [2022-01-10 17:48:50,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:48:50 BasicIcfg [2022-01-10 17:48:50,103 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:48:50,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:48:50,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:48:50,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:48:50,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:48:49" (1/4) ... [2022-01-10 17:48:50,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efede89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:48:50, skipping insertion in model container [2022-01-10 17:48:50,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:48:49" (2/4) ... [2022-01-10 17:48:50,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efede89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:48:50, skipping insertion in model container [2022-01-10 17:48:50,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:48:50" (3/4) ... [2022-01-10 17:48:50,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2efede89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:48:50, skipping insertion in model container [2022-01-10 17:48:50,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:48:50" (4/4) ... [2022-01-10 17:48:50,107 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.iTransformedIcfg [2022-01-10 17:48:50,111 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:48:50,111 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:48:50,140 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:48:50,145 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:48:50,145 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:48:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 17:48:50,157 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:50,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:48:50,158 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1891000412, now seen corresponding path program 1 times [2022-01-10 17:48:50,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:50,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363330600] [2022-01-10 17:48:50,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:50,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:48:50,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:50,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363330600] [2022-01-10 17:48:50,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363330600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:48:50,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:48:50,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:48:50,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850104233] [2022-01-10 17:48:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:48:50,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:48:50,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:50,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:48:50,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:48:50,360 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5714285714285714) internal successors, (44), 29 states have internal predecessors, (44), 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 17:48:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:50,375 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2022-01-10 17:48:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:48:50,378 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 17:48:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:50,383 INFO L225 Difference]: With dead ends: 52 [2022-01-10 17:48:50,383 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 17:48:50,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:48:50,389 INFO L933 BasicCegarLoop]: 37 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, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:50,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:48:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 17:48:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 17:48:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 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 17:48:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-01-10 17:48:50,416 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2022-01-10 17:48:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:50,416 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-01-10 17:48:50,417 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 17:48:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-01-10 17:48:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 17:48:50,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:50,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:48:50,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:48:50,419 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 607939046, now seen corresponding path program 1 times [2022-01-10 17:48:50,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:50,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626748725] [2022-01-10 17:48:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:50,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:48:50,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:50,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626748725] [2022-01-10 17:48:50,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626748725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:48:50,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:48:50,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:48:50,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93545827] [2022-01-10 17:48:50,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:48:50,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:48:50,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:50,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:48:50,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:48:50,563 INFO L87 Difference]: Start difference. First operand 23 states and 28 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 17:48:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:50,599 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-01-10 17:48:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:48:50,600 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 17:48:50,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:50,600 INFO L225 Difference]: With dead ends: 44 [2022-01-10 17:48:50,600 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 17:48:50,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:48:50,601 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:50,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:48:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 17:48:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-01-10 17:48:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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 17:48:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-01-10 17:48:50,605 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2022-01-10 17:48:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:50,606 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-01-10 17:48:50,606 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 17:48:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-01-10 17:48:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:48:50,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:50,606 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 17:48:50,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:48:50,607 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:50,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1324033623, now seen corresponding path program 1 times [2022-01-10 17:48:50,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:50,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631394359] [2022-01-10 17:48:50,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:50,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:48:50,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:50,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631394359] [2022-01-10 17:48:50,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631394359] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:48:50,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:48:50,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:48:50,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600642848] [2022-01-10 17:48:50,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:48:50,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:48:50,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:48:50,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:48:50,690 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:50,710 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-01-10 17:48:50,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:48:50,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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 17:48:50,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:50,711 INFO L225 Difference]: With dead ends: 49 [2022-01-10 17:48:50,711 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 17:48:50,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:48:50,712 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:50,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:48:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 17:48:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-01-10 17:48:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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 17:48:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-01-10 17:48:50,716 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2022-01-10 17:48:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:50,716 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-01-10 17:48:50,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-01-10 17:48:50,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:48:50,717 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:50,717 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 17:48:50,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:48:50,717 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:50,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1617436630, now seen corresponding path program 1 times [2022-01-10 17:48:50,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:50,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721435750] [2022-01-10 17:48:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:50,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:48:50,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:50,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721435750] [2022-01-10 17:48:50,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721435750] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:48:50,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408678371] [2022-01-10 17:48:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:50,812 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:50,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:48:50,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:48:50,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:48:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:50,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 17:48:50,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:48:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:48:51,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:48:51,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408678371] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:48:51,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:48:51,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-01-10 17:48:51,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506031725] [2022-01-10 17:48:51,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:48:51,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 17:48:51,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 17:48:51,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:48:51,028 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:51,079 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-01-10 17:48:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:48:51,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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 17:48:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:51,082 INFO L225 Difference]: With dead ends: 50 [2022-01-10 17:48:51,082 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 17:48:51,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 17:48:51,083 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:51,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:48:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 17:48:51,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2022-01-10 17:48:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 17:48:51,088 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-01-10 17:48:51,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:51,088 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 17:48:51,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 17:48:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 17:48:51,089 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:51,089 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 17:48:51,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:48:51,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:51,303 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1138056738, now seen corresponding path program 1 times [2022-01-10 17:48:51,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:51,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498045565] [2022-01-10 17:48:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:51,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:48:51,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:51,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498045565] [2022-01-10 17:48:51,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498045565] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:48:51,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687340046] [2022-01-10 17:48:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:51,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:51,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:48:51,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:48:51,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:48:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:51,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 48 conjunts are in the unsatisfiable core [2022-01-10 17:48:51,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:48:51,707 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 13 treesize of output 9 [2022-01-10 17:48:51,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:48:51,936 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:48:51,936 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 15 treesize of output 10 [2022-01-10 17:48:51,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:48:51,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:48:52,072 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 32 treesize of output 28 [2022-01-10 17:48:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:48:52,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687340046] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:48:52,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:48:52,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 12] total 25 [2022-01-10 17:48:52,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931467015] [2022-01-10 17:48:52,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:48:52,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 17:48:52,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 17:48:52,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-01-10 17:48:52,212 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:52,515 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-01-10 17:48:52,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 17:48:52,516 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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 17:48:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:52,517 INFO L225 Difference]: With dead ends: 64 [2022-01-10 17:48:52,517 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 17:48:52,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2022-01-10 17:48:52,518 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:52,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 147 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 174 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-01-10 17:48:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 17:48:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-01-10 17:48:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-01-10 17:48:52,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 23 [2022-01-10 17:48:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:52,523 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-01-10 17:48:52,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-01-10 17:48:52,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:48:52,524 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:52,524 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:48:52,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:48:52,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:52,744 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1477236375, now seen corresponding path program 1 times [2022-01-10 17:48:52,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513960467] [2022-01-10 17:48:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:52,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:48:52,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:52,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513960467] [2022-01-10 17:48:52,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513960467] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:48:52,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886996150] [2022-01-10 17:48:52,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:52,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:52,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:48:52,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:48:52,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:48:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:52,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 17:48:52,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:48:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:48:53,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:48:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:48:53,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886996150] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 17:48:53,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 17:48:53,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-01-10 17:48:53,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980430719] [2022-01-10 17:48:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:48:53,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:48:53,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:53,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:48:53,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-01-10 17:48:53,105 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:53,145 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-01-10 17:48:53,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:48:53,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 29 [2022-01-10 17:48:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:53,148 INFO L225 Difference]: With dead ends: 61 [2022-01-10 17:48:53,148 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 17:48:53,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-01-10 17:48:53,149 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:53,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 61 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:48:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 17:48:53,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-01-10 17:48:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-01-10 17:48:53,154 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 29 [2022-01-10 17:48:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:53,154 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-01-10 17:48:53,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:53,154 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-01-10 17:48:53,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:48:53,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:53,155 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:48:53,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-10 17:48:53,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:53,371 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 235423286, now seen corresponding path program 1 times [2022-01-10 17:48:53,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:53,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323773072] [2022-01-10 17:48:53,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:53,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:48:53,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323773072] [2022-01-10 17:48:53,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323773072] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:48:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008181913] [2022-01-10 17:48:53,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:53,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:53,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:48:53,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:48:53,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:48:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:53,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 17:48:53,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:48:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:48:53,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 17:48:53,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008181913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:48:53,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 17:48:53,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-01-10 17:48:53,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257017077] [2022-01-10 17:48:53,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:48:53,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:48:53,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:53,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:48:53,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 17:48:53,662 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:53,693 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2022-01-10 17:48:53,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:48:53,693 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 29 [2022-01-10 17:48:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:53,694 INFO L225 Difference]: With dead ends: 74 [2022-01-10 17:48:53,694 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 17:48:53,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:48:53,695 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 35 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:53,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:48:53,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 17:48:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-01-10 17:48:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-01-10 17:48:53,700 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 29 [2022-01-10 17:48:53,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:53,700 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-01-10 17:48:53,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-01-10 17:48:53,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 17:48:53,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:53,701 INFO L514 BasicCegarLoop]: trace histogram [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 17:48:53,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 17:48:53,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:53,920 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:53,921 INFO L85 PathProgramCache]: Analyzing trace with hash 359133349, now seen corresponding path program 1 times [2022-01-10 17:48:53,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:53,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427864911] [2022-01-10 17:48:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:53,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:48:53,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:53,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427864911] [2022-01-10 17:48:53,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427864911] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:48:53,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499807434] [2022-01-10 17:48:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:53,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:48:53,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:48:53,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:48:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:54,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 17:48:54,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:48:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:48:54,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:48:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:48:54,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499807434] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:48:54,668 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:48:54,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-01-10 17:48:54,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795357460] [2022-01-10 17:48:54,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:48:54,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 17:48:54,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 17:48:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 17:48:54,670 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:54,845 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2022-01-10 17:48:54,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 17:48:54,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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 33 [2022-01-10 17:48:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:54,846 INFO L225 Difference]: With dead ends: 82 [2022-01-10 17:48:54,846 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 17:48:54,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-10 17:48:54,847 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 55 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:54,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 153 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:48:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 17:48:54,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2022-01-10 17:48:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-01-10 17:48:54,853 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 33 [2022-01-10 17:48:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:54,853 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-01-10 17:48:54,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:54,853 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-01-10 17:48:54,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 17:48:54,854 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:54,854 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:48:54,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 17:48:55,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:55,055 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:55,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash 157716142, now seen corresponding path program 1 times [2022-01-10 17:48:55,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:55,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436160238] [2022-01-10 17:48:55,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:55,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:48:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:48:55,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:48:55,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436160238] [2022-01-10 17:48:55,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436160238] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:48:55,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642798225] [2022-01-10 17:48:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:55,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:55,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:48:55,144 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 17:48:55,145 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 17:48:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:48:55,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 17:48:55,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:48:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:48:55,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:48:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:48:59,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642798225] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:48:59,470 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:48:59,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 14 [2022-01-10 17:48:59,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433358804] [2022-01-10 17:48:59,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:48:59,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 17:48:59,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:48:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 17:48:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=137, Unknown=1, NotChecked=0, Total=182 [2022-01-10 17:48:59,471 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:48:59,615 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2022-01-10 17:48:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 17:48:59,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 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 34 [2022-01-10 17:48:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:48:59,616 INFO L225 Difference]: With dead ends: 74 [2022-01-10 17:48:59,616 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 17:48:59,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=50, Invalid=159, Unknown=1, NotChecked=0, Total=210 [2022-01-10 17:48:59,617 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:48:59,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 253 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-01-10 17:48:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 17:48:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 44. [2022-01-10 17:48:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-01-10 17:48:59,635 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 34 [2022-01-10 17:48:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:48:59,635 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-01-10 17:48:59,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:48:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-01-10 17:48:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 17:48:59,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:48:59,635 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:48:59,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 17:48:59,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:48:59,854 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:48:59,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:48:59,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1324382932, now seen corresponding path program 2 times [2022-01-10 17:48:59,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:48:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100986453] [2022-01-10 17:48:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:48:59,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:00,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100986453] [2022-01-10 17:49:00,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100986453] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971963481] [2022-01-10 17:49:00,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:49:00,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:00,731 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 17:49:00,732 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 17:49:01,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:49:01,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:49:01,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-10 17:49:01,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:01,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:49:01,377 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:49:01,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 17:49:01,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:01,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-01-10 17:49:01,527 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:49:01,527 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-01-10 17:49:01,932 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 13 treesize of output 9 [2022-01-10 17:49:01,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:01,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:01,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:01,947 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-10 17:49:02,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:02,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 11 [2022-01-10 17:49:02,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 17:49:02,428 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 15 treesize of output 7 [2022-01-10 17:49:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:02,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:02,698 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_599 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| v_ArrVal_599) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_599 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| v_ArrVal_599) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) is different from false [2022-01-10 17:49:02,720 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_599 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|) 18446744073709551616)) v_ArrVal_599) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (forall ((v_ArrVal_599 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|) 18446744073709551616)) v_ArrVal_599) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) is different from false [2022-01-10 17:49:02,732 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_599 (Array Int Int))) (<= (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296) (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_599) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_599 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) v_ArrVal_599) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)))) is different from false [2022-01-10 17:49:02,758 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:49:02,758 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 36 treesize of output 37 [2022-01-10 17:49:02,766 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:49:02,766 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 66 treesize of output 69 [2022-01-10 17:49:02,775 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 27 treesize of output 25 [2022-01-10 17:49:02,821 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:49:02,821 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 36 treesize of output 37 [2022-01-10 17:49:02,825 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-01-10 17:49:02,829 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 27 treesize of output 25 [2022-01-10 17:49:03,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 Int) (v_ArrVal_594 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_594) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| v_ArrVal_595) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616))))) is different from false [2022-01-10 17:49:03,252 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-10 17:49:03,253 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 2 case distinctions, treesize of input 37 treesize of output 43 [2022-01-10 17:49:03,255 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 63 treesize of output 57 [2022-01-10 17:49:03,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:03,260 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 33 treesize of output 27 [2022-01-10 17:49:03,266 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 17:49:03,267 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 67 treesize of output 49 [2022-01-10 17:49:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-10 17:49:03,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971963481] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:49:03,443 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:49:03,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 19] total 55 [2022-01-10 17:49:03,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678890044] [2022-01-10 17:49:03,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:49:03,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-01-10 17:49:03,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-01-10 17:49:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2364, Unknown=4, NotChecked=404, Total=2970 [2022-01-10 17:49:03,446 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 55 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 55 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:06,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:06,189 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2022-01-10 17:49:06,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 17:49:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 55 states have internal predecessors, (97), 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 34 [2022-01-10 17:49:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:06,192 INFO L225 Difference]: With dead ends: 70 [2022-01-10 17:49:06,192 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 17:49:06,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=554, Invalid=4014, Unknown=4, NotChecked=540, Total=5112 [2022-01-10 17:49:06,197 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 179 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:06,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 384 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 526 Invalid, 0 Unknown, 294 Unchecked, 0.6s Time] [2022-01-10 17:49:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 17:49:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2022-01-10 17:49:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 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 17:49:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-01-10 17:49:06,209 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 34 [2022-01-10 17:49:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:06,210 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-01-10 17:49:06,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 55 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:06,211 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-01-10 17:49:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 17:49:06,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:06,213 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 17:49:06,230 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 17:49:06,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:06,430 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:06,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1182348933, now seen corresponding path program 3 times [2022-01-10 17:49:06,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:06,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626878456] [2022-01-10 17:49:06,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:06,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:49:06,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:06,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626878456] [2022-01-10 17:49:06,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626878456] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:06,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82909240] [2022-01-10 17:49:06,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 17:49:06,541 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:06,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:06,542 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:49:06,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 17:49:07,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 17:49:07,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:49:07,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 17:49:07,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:49:07,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:49:08,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82909240] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:49:08,246 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:49:08,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2022-01-10 17:49:08,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896859689] [2022-01-10 17:49:08,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:49:08,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 17:49:08,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:08,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 17:49:08,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-10 17:49:08,247 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:08,463 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2022-01-10 17:49:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 17:49:08,464 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 17:49:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:08,464 INFO L225 Difference]: With dead ends: 88 [2022-01-10 17:49:08,464 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 17:49:08,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-01-10 17:49:08,465 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 82 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:08,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 144 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:49:08,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 17:49:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-01-10 17:49:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 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 17:49:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-01-10 17:49:08,477 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 35 [2022-01-10 17:49:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:08,477 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-01-10 17:49:08,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-01-10 17:49:08,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 17:49:08,481 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:08,481 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:08,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 17:49:08,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 17:49:08,692 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:08,693 INFO L85 PathProgramCache]: Analyzing trace with hash -295410715, now seen corresponding path program 4 times [2022-01-10 17:49:08,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:08,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510018951] [2022-01-10 17:49:08,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:08,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:49:08,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:08,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510018951] [2022-01-10 17:49:08,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510018951] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:08,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205183371] [2022-01-10 17:49:08,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 17:49:08,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:08,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:08,861 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:49:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 17:49:09,097 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 17:49:09,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:49:09,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 17:49:09,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 17:49:09,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 17:49:10,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205183371] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:49:10,050 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:49:10,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2022-01-10 17:49:10,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710644475] [2022-01-10 17:49:10,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:49:10,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 17:49:10,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:10,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 17:49:10,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-01-10 17:49:10,051 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:10,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:10,381 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-01-10 17:49:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 17:49:10,381 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 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 40 [2022-01-10 17:49:10,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:10,382 INFO L225 Difference]: With dead ends: 67 [2022-01-10 17:49:10,382 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 17:49:10,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2022-01-10 17:49:10,382 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 129 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:10,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 133 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:49:10,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 17:49:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-01-10 17:49:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-01-10 17:49:10,396 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2022-01-10 17:49:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:10,396 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-01-10 17:49:10,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.555555555555555) internal successors, (82), 18 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-01-10 17:49:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 17:49:10,397 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:10,397 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:10,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 17:49:10,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:10,615 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:10,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:10,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1943234395, now seen corresponding path program 1 times [2022-01-10 17:49:10,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:10,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690533219] [2022-01-10 17:49:10,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:10,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:11,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:11,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690533219] [2022-01-10 17:49:11,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690533219] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:11,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43754088] [2022-01-10 17:49:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:11,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:11,805 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:49:11,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 17:49:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:12,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 110 conjunts are in the unsatisfiable core [2022-01-10 17:49:12,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:12,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:49:12,283 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:49:12,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 17:49:12,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:12,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-01-10 17:49:12,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:12,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:12,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-01-10 17:49:12,492 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:49:12,492 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-01-10 17:49:12,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-01-10 17:49:13,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:13,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:13,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:13,113 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2022-01-10 17:49:13,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:13,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:13,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-01-10 17:49:13,604 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:49:13,604 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 86 [2022-01-10 17:49:13,610 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 39 treesize of output 27 [2022-01-10 17:49:13,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2022-01-10 17:49:14,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:14,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-01-10 17:49:14,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:49:14,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 22 [2022-01-10 17:49:14,620 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 17 treesize of output 9 [2022-01-10 17:49:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:49:14,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:15,144 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 102 treesize of output 76 [2022-01-10 17:49:15,167 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 102 treesize of output 76 [2022-01-10 17:49:15,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_939 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int| .cse0) (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|)) (<= .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int|))) is different from false [2022-01-10 17:49:15,212 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_940 (Array Int Int))) (let ((.cse0 (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|) 18446744073709551616))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) .cse0) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) .cse0)))) (<= |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int| .cse1) (<= .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int|) (forall ((v_ArrVal_939 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|) 18446744073709551616)))) (= .cse2 (select (select (store |c_#memory_$Pointer$.baseInt| .cse2 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))))))) is different from false [2022-01-10 17:49:15,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_940 (Array Int Int))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2)))) (<= .cse1 .cse0) (forall ((v_ArrVal_939 (Array Int Int))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse4))) (= (select (select (store |c_#memory_$Pointer$.baseInt| .cse3 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse4) .cse3)))))) is different from false [2022-01-10 17:49:15,245 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_940 (Array Int Int))) (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0)))) (<= .cse1 .cse2) (<= .cse2 .cse1) (forall ((v_ArrVal_939 (Array Int Int))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse4))) (= (select (select (store |c_#memory_$Pointer$.baseInt| .cse3 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse4) .cse3)))))) is different from false [2022-01-10 17:49:15,274 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (forall ((v_ArrVal_937 Int) (v_ArrVal_935 Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| v_ArrVal_937))) (.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (= (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1) (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| v_ArrVal_935)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse1)))) (<= .cse2 .cse3) (<= .cse3 .cse2) (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| v_ArrVal_935))) (.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse6))) (= (select (select (store .cse4 .cse5 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse6) .cse5)))))) is different from false [2022-01-10 17:49:15,303 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296)) 4294967296)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse2 (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_935)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse3 (select .cse2 .cse4))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| .cse2) .cse3 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse4) .cse3)))) (forall ((v_ArrVal_937 Int) (v_ArrVal_935 Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse5 (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_937)) (.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (= (select .cse5 .cse6) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| .cse5) (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_935) .cse6) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse6)))))) is different from false [2022-01-10 17:49:15,314 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse0 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| v_ArrVal_935)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 4) 18446744073709551616))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt| .cse0) .cse1 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|) .cse2) .cse1)))) (forall ((v_ArrVal_937 Int) (v_ArrVal_935 Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| v_ArrVal_937)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 4) 18446744073709551616))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt| .cse3) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| v_ArrVal_935) .cse4) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|) .cse4) (select .cse3 .cse4))))) is different from false [2022-01-10 17:49:15,323 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_937 Int) (v_ArrVal_935 Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| v_ArrVal_937)) (.cse1 (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616))) (= (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| .cse0) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| v_ArrVal_935) .cse1) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse1)))) (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse2 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| v_ArrVal_935)) (.cse4 (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse3 (select .cse2 .cse4))) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| .cse2) .cse3 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse4) .cse3))))) is different from false [2022-01-10 17:49:15,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_939 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| v_ArrVal_935)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| .cse1) .cse0 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) .cse2))))) (forall ((v_ArrVal_937 Int) (v_ArrVal_935 Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| v_ArrVal_937)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616))) (= (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| .cse3) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| v_ArrVal_935) .cse4) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) .cse4) (select .cse3 .cse4))))) is different from false [2022-01-10 17:49:15,352 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_939 (Array Int Int)) (v_ArrVal_935 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_933))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| v_ArrVal_935)) (.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (select .cse1 .cse3))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| .cse1) .cse2 v_ArrVal_939) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) .cse3) .cse2))))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_933 (Array Int Int)) (v_ArrVal_937 Int) (v_ArrVal_935 Int) (v_ArrVal_940 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_931))) (let ((.cse4 (store (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| v_ArrVal_937)) (.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616))) (= (select .cse4 .cse5) (select (select (store (store .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| .cse4) (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_933) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| v_ArrVal_935) .cse5) v_ArrVal_940) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) .cse5)))))) is different from false [2022-01-10 17:49:15,370 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-10 17:49:15,371 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 2 case distinctions, treesize of input 132 treesize of output 100 [2022-01-10 17:49:15,379 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 222 treesize of output 216 [2022-01-10 17:49:15,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:15,391 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:49:15,391 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 2 case distinctions, treesize of input 122 treesize of output 108 [2022-01-10 17:49:15,394 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 148 treesize of output 140 [2022-01-10 17:49:15,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:15,406 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 114 treesize of output 102 [2022-01-10 17:49:15,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:15,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:15,412 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 92 [2022-01-10 17:49:15,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:49:15,421 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 15 treesize of output 9 [2022-01-10 17:49:15,426 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 17:49:15,427 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 21 treesize of output 9 [2022-01-10 17:49:15,434 INFO L353 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2022-01-10 17:49:15,435 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 2 case distinctions, treesize of input 132 treesize of output 1 [2022-01-10 17:49:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-10 17:49:15,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43754088] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:49:15,609 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:49:15,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 59 [2022-01-10 17:49:15,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669081637] [2022-01-10 17:49:15,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:49:15,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-10 17:49:15,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:15,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-10 17:49:15,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2186, Unknown=10, NotChecked=1030, Total=3422 [2022-01-10 17:49:15,611 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 59 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 59 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:20,406 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-01-10 17:49:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 17:49:20,407 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 59 states have internal predecessors, (116), 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 17:49:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:20,407 INFO L225 Difference]: With dead ends: 83 [2022-01-10 17:49:20,407 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 17:49:20,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1346 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=641, Invalid=4501, Unknown=10, NotChecked=1490, Total=6642 [2022-01-10 17:49:20,409 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 302 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 594 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:20,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 324 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 704 Invalid, 0 Unknown, 594 Unchecked, 1.0s Time] [2022-01-10 17:49:20,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 17:49:20,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2022-01-10 17:49:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-01-10 17:49:20,428 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 41 [2022-01-10 17:49:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:20,428 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-01-10 17:49:20,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 59 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-01-10 17:49:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 17:49:20,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:20,429 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 17:49:20,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 17:49:20,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 17:49:20,647 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:20,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:20,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2000932964, now seen corresponding path program 1 times [2022-01-10 17:49:20,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:20,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663857634] [2022-01-10 17:49:20,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:20,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:49:20,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663857634] [2022-01-10 17:49:20,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663857634] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232735259] [2022-01-10 17:49:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:20,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:20,684 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:49:20,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 17:49:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:20,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 17:49:20,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:49:20,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:49:20,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232735259] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:49:20,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:49:20,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-01-10 17:49:20,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934457547] [2022-01-10 17:49:20,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:49:20,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:49:20,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:49:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:49:20,933 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 17:49:20,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:20,968 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-01-10 17:49:20,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 17:49:20,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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) Word has length 41 [2022-01-10 17:49:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:20,968 INFO L225 Difference]: With dead ends: 102 [2022-01-10 17:49:20,968 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 17:49:20,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:49:20,969 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:20,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 27 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:49:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 17:49:20,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 17:49:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-01-10 17:49:20,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2022-01-10 17:49:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:20,979 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-01-10 17:49:20,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 17:49:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-01-10 17:49:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 17:49:20,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:49:20,979 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, 1] [2022-01-10 17:49:20,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-10 17:49:21,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-10 17:49:21,191 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:49:21,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:49:21,192 INFO L85 PathProgramCache]: Analyzing trace with hash 133720895, now seen corresponding path program 2 times [2022-01-10 17:49:21,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:49:21,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733440800] [2022-01-10 17:49:21,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:49:21,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:49:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:49:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:49:21,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:49:21,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733440800] [2022-01-10 17:49:21,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733440800] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:49:21,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127079982] [2022-01-10 17:49:21,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:49:21,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:49:21,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:49:21,293 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:49:21,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-10 17:49:21,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:49:21,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:49:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 17:49:21,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:49:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:49:22,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:49:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 17:49:22,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127079982] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:49:22,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:49:22,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-01-10 17:49:22,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740906019] [2022-01-10 17:49:22,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:49:22,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 17:49:22,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:49:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 17:49:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-10 17:49:22,195 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:49:22,352 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-01-10 17:49:22,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:49:22,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-01-10 17:49:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:49:22,353 INFO L225 Difference]: With dead ends: 43 [2022-01-10 17:49:22,353 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 17:49:22,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-01-10 17:49:22,353 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:49:22,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 179 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 17:49:22,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 17:49:22,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 17:49:22,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 17:49:22,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-01-10 17:49:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:49:22,354 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 17:49:22,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:49:22,354 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 17:49:22,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 17:49:22,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 17:49:22,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-10 17:49:22,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 17:49:22,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 17:49:29,147 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 17:49:29,147 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 17:49:29,147 INFO L854 garLoopResultBuilder]: At program point L587-2(lines 587 600) the Hoare annotation is: (let ((.cse20 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 4) 18446744073709551616)) (.cse22 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse7 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 12) 18446744073709551616)) (.cse12 (mod (+ 12 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616)) (.cse23 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse19 (mod (+ 4 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse2 (< 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|)) (.cse4 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 0)) (.cse5 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| (select .cse23 .cse19)))) (.cse8 (= (select .cse23 .cse12) 0)) (.cse9 (= (select .cse22 .cse7) 0)) (.cse14 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) 1)) (.cse15 (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse16 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (select .cse22 .cse20)))) (.cse18 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) 1)) (.cse1 (= (select |#validInt| 1) 1)) (.cse10 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse13 (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 0))) (or (let ((.cse11 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse6 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|))) (let ((.cse0 (select .cse6 .cse20)) (.cse17 (select .cse11 .cse19))) (and (<= 0 .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 (= (select .cse6 .cse7) 0) .cse8 .cse9 .cse10 (= (select .cse11 .cse12) 0) (<= .cse0 0) .cse13 .cse14 .cse15 .cse16 (<= 0 .cse17) (<= .cse17 0) .cse18))) (let ((.cse21 (div (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~len#1Int| 1) 4294967296))) (and .cse1 .cse2 (<= (+ (* .cse21 4294967296) 1) |ULTIMATE.start_ULTIMATE.start_dll_create_~len#1Int|) .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 (< (div |ULTIMATE.start_ULTIMATE.start_dll_create_~len#1Int| 2147483648) (+ .cse21 1)) .cse13 .cse14 .cse15 .cse16 .cse18)) (and .cse1 (<= 2 |ULTIMATE.start_ULTIMATE.start_dll_create_~len#1Int|) (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| 0) .cse10 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~len#1Int| 2) .cse13)))) [2022-01-10 17:49:29,147 INFO L858 garLoopResultBuilder]: For program point L587-3(lines 587 600) no Hoare annotation was computed. [2022-01-10 17:49:29,147 INFO L858 garLoopResultBuilder]: For program point L589(lines 589 591) no Hoare annotation was computed. [2022-01-10 17:49:29,147 INFO L854 garLoopResultBuilder]: At program point L601(lines 585 602) the Hoare annotation is: (let ((.cse12 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse5 (mod (+ 4 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616)) (.cse7 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse13 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 4) 18446744073709551616)) (.cse10 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|)) (.cse2 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 4) 18446744073709551616))) (let ((.cse1 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|)) (.cse6 (select .cse10 .cse2)) (.cse4 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse3 (mod (+ 12 |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt|) 18446744073709551616)) (.cse8 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 12) 18446744073709551616)) (.cse9 (mod (+ 12 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616)) (.cse0 (select .cse7 .cse13)) (.cse11 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse14 (select .cse12 .cse5))) (and (<= 0 .cse0) (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt|) (= (select |#validInt| 1) 1) (< 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) (not (= (select .cse1 .cse2) |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|)) (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 0) (<= |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 0) (= (select .cse1 .cse3) 0) (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| (select .cse4 .cse5))) (<= 0 .cse6) (= (select .cse7 .cse8) 0) (<= .cse6 0) (= (select .cse4 .cse9) 0) (= (select .cse10 .cse3) 0) (= (select .cse11 .cse8) 0) (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) (= (select .cse12 .cse9) 0) (<= .cse0 0) (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt| 0)) (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) 1) (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (select .cse11 .cse13))) (<= 0 .cse14) (<= .cse14 0) (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) 1)))) [2022-01-10 17:49:29,148 INFO L861 garLoopResultBuilder]: At program point L573(line 573) the Hoare annotation is: true [2022-01-10 17:49:29,148 INFO L858 garLoopResultBuilder]: For program point L589-1(lines 589 591) no Hoare annotation was computed. [2022-01-10 17:49:29,148 INFO L854 garLoopResultBuilder]: At program point L629-3(lines 629 632) the Hoare annotation is: (let ((.cse54 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse43 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 4) 18446744073709551616)) (.cse50 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|)) (.cse57 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 4) 18446744073709551616)) (.cse58 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse47 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse59 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) (.cse45 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse55 (mod (+ 4 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse41 (select .cse45 .cse55)) (.cse39 (select .cse47 .cse59)) (.cse42 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse46 (mod (+ 12 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616)) (.cse40 (select .cse58 .cse59)) (.cse49 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 12) 18446744073709551616)) (.cse53 (select .cse50 .cse57)) (.cse52 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse51 (mod (+ 12 |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt|) 18446744073709551616)) (.cse56 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|)) (.cse44 (select .cse54 .cse43)) (.cse48 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 12) 18446744073709551616)) (.cse26 (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) (let ((.cse21 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse20 (+ (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse24 (= (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) .cse26)) (.cse0 (= (select .cse58 .cse48) 0)) (.cse1 (<= 0 .cse44)) (.cse37 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt|)) (.cse3 (= (select |#validInt| 1) 1)) (.cse4 (< 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse5 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|)) (.cse6 (not (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| 0))) (.cse7 (not (= (select .cse56 .cse57) |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|))) (.cse8 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 0)) (.cse10 (= (select .cse56 .cse51) 0)) (.cse11 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| (select .cse52 .cse55)))) (.cse12 (<= 0 .cse53)) (.cse13 (= (select .cse54 .cse49) 0)) (.cse14 (<= .cse53 0)) (.cse15 (<= 0 .cse40)) (.cse16 (= (select .cse52 .cse46) 0)) (.cse17 (= (select .cse50 .cse51) 0)) (.cse18 (= (select .cse42 .cse49) 0)) (.cse19 (= (select .cse47 .cse48) 0)) (.cse38 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse22 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse23 (= (select .cse45 .cse46) 0)) (.cse25 (<= .cse44 0)) (.cse27 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt| 0))) (.cse28 (<= .cse40 0)) (.cse29 (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 0)) (.cse30 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) 1)) (.cse31 (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse32 (not (= .cse39 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse33 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (select .cse42 .cse43)))) (.cse34 (<= 0 .cse41)) (.cse35 (<= .cse41 0)) (.cse36 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))) (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 0) .cse19 (<= (div .cse20 (- 4294967296)) (div (+ .cse21 1) 4294967296)) .cse22 .cse23 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) .cse24 .cse25 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int| .cse26) (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (+ |ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int| (* (div (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296) 4294967296))) .cse27 .cse28 .cse29 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse0 .cse37 .cse4 .cse5 .cse6 .cse8 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse15 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int|) .cse19 .cse38 (< (+ (div (+ .cse21 2147483648) (- 2147483648)) (div (+ .cse21 (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648)) (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (- 4294967296))) (+ (div (+ (- 2) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296) (div .cse20 2147483648) 1)) .cse22 (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) .cse24 .cse28 .cse29 .cse30 .cse31 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| .cse39) .cse40)) .cse36) (and .cse0 .cse1 .cse37 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse38 .cse22 .cse23 .cse25 .cse27 .cse28 .cse29 .cse30 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36))))) [2022-01-10 17:49:29,148 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-01-10 17:49:29,148 INFO L858 garLoopResultBuilder]: For program point L629-4(lines 629 632) no Hoare annotation was computed. [2022-01-10 17:49:29,148 INFO L854 garLoopResultBuilder]: At program point L618-2(lines 618 621) the Hoare annotation is: (let ((.cse51 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse58 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse46 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 4) 18446744073709551616)) (.cse54 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|)) (.cse61 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 4) 18446744073709551616)) (.cse62 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse63 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) (.cse49 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse59 (mod (+ 4 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616))) (let ((.cse44 (select .cse49 .cse59)) (.cse29 (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse45 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse50 (mod (+ 12 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|) 18446744073709551616)) (.cse47 (select .cse62 .cse63)) (.cse53 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 12) 18446744073709551616)) (.cse57 (select .cse54 .cse61)) (.cse56 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse55 (mod (+ 12 |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt|) 18446744073709551616)) (.cse60 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|)) (.cse48 (select .cse58 .cse46)) (.cse52 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 12) 18446744073709551616)) (.cse43 (select .cse51 .cse63))) (let ((.cse27 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse28 (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|)) (.cse30 (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)) (.cse35 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse38 (not (= .cse43 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse0 (= (select .cse62 .cse52) 0)) (.cse1 (<= 0 .cse48)) (.cse2 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt|)) (.cse4 (= (select |#validInt| 1) 1)) (.cse5 (< 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse6 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|)) (.cse7 (not (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| 0))) (.cse8 (not (= (select .cse60 .cse61) |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt|))) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 0)) (.cse10 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.offsetInt| 0)) (.cse11 (= (select .cse60 .cse55) 0)) (.cse12 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| (select .cse56 .cse59)))) (.cse13 (<= 0 .cse57)) (.cse14 (= (select .cse58 .cse53) 0)) (.cse15 (<= .cse57 0)) (.cse16 (<= 0 .cse47)) (.cse17 (= (select .cse56 .cse50) 0)) (.cse18 (= (select .cse54 .cse55) 0)) (.cse19 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int|)) (.cse20 (= (select .cse45 .cse53) 0)) (.cse21 (= (select .cse51 .cse52) 0)) (.cse22 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse23 (<= |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (+ (select .cse29 0) (* (div (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 4294967296) 4294967296)))) (.cse24 (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 1) 4294967296))) (.cse25 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse26 (= (select .cse49 .cse50) 0)) (.cse31 (<= .cse48 0)) (.cse32 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_#res#1.baseInt| 0))) (.cse33 (<= .cse47 0)) (.cse34 (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 0)) (.cse36 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) 1)) (.cse37 (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse39 (not (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (select .cse45 .cse46)))) (.cse40 (<= 0 .cse44)) (.cse41 (<= .cse44 0)) (.cse42 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (< |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (* 2 (mod |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (= (select .cse29 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) .cse30) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse0 .cse1 .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse25 .cse26 .cse27 .cse28 .cse31 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~data#1Int| .cse30) .cse32 .cse33 .cse34 .cse35 .cse36 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 1) 4294967296)) .cse13 .cse14 .cse15 (forall ((v_ArrVal_940 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| v_ArrVal_940) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616)) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|)) .cse16 (= .cse43 |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt|) .cse17 .cse18 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int|) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 (forall ((v_ArrVal_599 (Array Int Int))) (<= (select (select (store |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.baseInt| v_ArrVal_599) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296))) .cse39 .cse40 .cse41 .cse42))))) [2022-01-10 17:49:29,148 INFO L858 garLoopResultBuilder]: For program point L595-2(lines 595 597) no Hoare annotation was computed. [2022-01-10 17:49:29,148 INFO L854 garLoopResultBuilder]: At program point L633-3(lines 633 638) the Hoare annotation is: (let ((.cse29 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse27 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse30 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse18 (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648)) (.cse25 (select .cse27 .cse30)) (.cse26 (select .cse29 .cse30)) (.cse28 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 12) 18446744073709551616))) (let ((.cse0 (= (select .cse29 .cse28) 0)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse2 (< 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|)) (.cse4 (not (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| 0))) (.cse5 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 0)) (.cse6 (<= 0 .cse26)) (.cse7 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int|)) (.cse19 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1)) (.cse8 (= (select .cse27 .cse28) 0)) (.cse9 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse10 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse20 (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse21 (not (< |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 2147483648))))) (.cse11 (<= .cse26 0)) (.cse12 (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 0)) (.cse13 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) 1)) (.cse15 (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse16 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| .cse25) .cse26))) (.cse17 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) 1)) (.cse23 (* 2 .cse18)) (.cse14 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and (< 0 (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (* (- 2) .cse18) 1) 4294967296) 1)) .cse19 .cse20 .cse21) (and (<= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| (* (div |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 2147483648) 4294967296)) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (< (let ((.cse22 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|))) (+ (div (+ .cse22 2147483648) (- 2147483648)) (div (+ .cse22 .cse23 (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (- 4294967296)))) (+ (div (+ (- 2) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296) (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 2147483648) 1)) .cse10 .cse20 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 (let ((.cse24 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 1) 4294967296))) (<= (div (+ (- 1) .cse24) (- 4294967296)) (div (+ (* (- 1) .cse24) 1) 4294967296))) .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse20 .cse21 .cse11 .cse12 (< |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 4294967296) .cse13 .cse15 (not (= .cse25 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse16 .cse17) (and (not (< |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| .cse23)) .cse14))))) [2022-01-10 17:49:29,148 INFO L858 garLoopResultBuilder]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2022-01-10 17:49:29,148 INFO L858 garLoopResultBuilder]: For program point L633-4(lines 633 638) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L854 garLoopResultBuilder]: At program point L611-2(lines 611 614) the Hoare annotation is: (let ((.cse44 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse41 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse45 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse39 (select .cse41 .cse45)) (.cse40 (select .cse44 .cse45)) (.cse42 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 12) 18446744073709551616))) (let ((.cse9 (< 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|)) (.cse23 (not (= |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt| 0))) (.cse34 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse38 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0)) (.cse0 (= (select .cse44 .cse42) 0)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse2 (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296)) (.cse10 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int|)) (.cse11 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|)) (.cse12 (not (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| 0))) (.cse35 (let ((.cse43 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 1) 4294967296))) (<= (div (+ (- 1) .cse43) (- 4294967296)) (div (+ (* (- 1) .cse43) 1) 4294967296)))) (.cse13 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse14 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 0)) (.cse15 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)) (.cse16 (<= 0 .cse40)) (.cse17 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int|)) (.cse18 (= (select .cse41 .cse42) 0)) (.cse19 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse20 (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 1) 4294967296))) (.cse21 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse22 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt|)) (.cse36 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt|)) (.cse8 (mod |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296)) (.cse24 (<= .cse40 0)) (.cse25 (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 0)) (.cse26 (<= (div (+ (- 3) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) 3) 4294967296))) (.cse27 (<= |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt| 0)) (.cse37 (< |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 4294967296)) (.cse28 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) 1)) (.cse29 (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse30 (not (= .cse39 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|))) (.cse31 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| .cse39) .cse40))) (.cse32 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) 1))) (or (let ((.cse3 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt|)) (.cse5 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt|)) (.cse33 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt| 4) 18446744073709551616))) (let ((.cse4 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt| 12) 18446744073709551616)) (.cse6 (select .cse5 .cse33)) (.cse7 (select .cse3 .cse33))) (and .cse0 .cse1 .cse2 (= (select .cse3 .cse4) 0) (= 0 (select .cse5 .cse4)) (= (select (select |#memory_intInt| .cse6) .cse7) .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= .cse7 0) .cse18 .cse19 .cse20 .cse21 .cse22 (not (= |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt| .cse6)) (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (<= 0 .cse7) (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int|) (<= (div (+ (- 1) |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int|) 1) 4294967296)) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32))) (and .cse0 .cse1 .cse34 .cse9 .cse10 .cse11 .cse12 .cse35 .cse14 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 (= 2 .cse36) (= (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)) .cse23 .cse24 .cse25 .cse27 .cse37 .cse28 .cse38 .cse29 .cse31 .cse32) (and (< 0 (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (* (- 2) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648)) 1) 4294967296) 1)) .cse34 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int|) (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 0) .cse27 .cse38 (exists ((|ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| Int)) (and (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|) (<= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt|) (= 2 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~head#1.offsetInt|))))) (and .cse0 .cse1 .cse2 (< |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 4294967296) .cse10 .cse11 .cse12 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= .cse36 .cse8) (not (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| 0)) .cse24 .cse25 .cse26 .cse27 .cse37 .cse28 .cse29 .cse30 .cse31 .cse32))))) [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point L617(lines 617 623) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L861 garLoopResultBuilder]: At program point L604-2(lines 604 608) the Hoare annotation is: true [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point L611-3(lines 611 614) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point L629-2(lines 629 632) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point L603(lines 603 609) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L854 garLoopResultBuilder]: At program point L615(lines 610 616) the Hoare annotation is: (let ((.cse30 (select |#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse27 (select |#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) (.cse31 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse24 (select .cse27 .cse31)) (.cse25 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int|)) (.cse26 (select .cse30 .cse31)) (.cse28 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 12) 18446744073709551616))) (let ((.cse0 (= (select .cse30 .cse28) 0)) (.cse1 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (.cse3 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt|)) (.cse4 (not (= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| 0))) (.cse6 (<= |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 0)) (.cse7 (<= 0 .cse26)) (.cse8 (<= (* 2 (mod |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 2147483648)) |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int|)) (.cse10 (or (and .cse25 (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) (<= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0)) (and .cse25 (let ((.cse29 (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) 4294967296))) (<= (+ (* (div .cse29 2147483648) 4294967296) 1) .cse29)) (<= (+ (* 4294967296 (div |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 2147483648)) 1) |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|)))) (.cse11 (= (select .cse27 .cse28) 0)) (.cse12 (<= |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 0)) (.cse13 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|)) (.cse14 (<= 0 |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt|)) (.cse15 (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt|)) (.cse16 (<= .cse26 0)) (.cse17 (= |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt| 0)) (.cse18 (<= |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.offsetInt| 0)) (.cse19 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) 1)) (.cse21 (= (mod (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 1) 4294967296) (select (select |#memory_intInt| .cse24) .cse26))) (.cse22 (= (select |#validInt| |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) 1)) (.cse2 (= 2 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|)) (.cse9 (= |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_#res#1Int| 2)) (.cse20 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 0))) (or (and .cse0 .cse1 .cse2 (< 0 |ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) .cse3 .cse4 (let ((.cse5 (mod (+ |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 1) 4294967296))) (<= (div (+ (- 1) .cse5) (- 4294967296)) (div (+ (* (- 1) .cse5) 1) 4294967296))) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= 2 .cse15) (= (select (select |#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967296)) (not (= |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~head#1.baseInt| 0)) .cse16 .cse17 .cse18 (< |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_~index#1Int| 4294967296) .cse19 .cse20 (<= 1 |ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) .cse21 .cse22) (let ((.cse23 (mod |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296))) (and .cse0 .cse1 (< |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int| 4294967296) .cse3 .cse4 (= |ULTIMATE.start_ULTIMATE.start_dll_get_data_at_#res#1Int| .cse23) (<= 0 |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) .cse6 .cse7 .cse8 (= |ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int| 1) .cse10 .cse11 .cse12 .cse13 .cse14 (= .cse15 .cse23) .cse16 .cse17 (<= (div (+ (- 3) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) (- 4294967296)) (div (+ (* (- 1) |ULTIMATE.start_ULTIMATE.start_main_~expected~0#1Int|) 3) 4294967296)) .cse18 .cse19 (not (= .cse24 |ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|)) .cse21 .cse22)) (and (< 0 (+ (div (+ |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (* (- 2) (mod |ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 2147483648)) 1) 4294967296) 1)) .cse2 .cse25 .cse9 (= |ULTIMATE.start_ULTIMATE.start_dll_update_at_~index#1Int| 0) .cse20))))) [2022-01-10 17:49:29,149 INFO L861 garLoopResultBuilder]: At program point L642(lines 624 643) the Hoare annotation is: true [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point L635(lines 635 637) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L854 garLoopResultBuilder]: At program point L636(lines 624 643) the Hoare annotation is: false [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point L633-2(lines 633 638) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 17:49:29,149 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 641) no Hoare annotation was computed. [2022-01-10 17:49:29,151 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:49:29,152 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 17:49:29,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,165 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,166 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,167 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,189 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,191 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,199 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,200 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,201 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,202 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,205 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 1bit term. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation.IcfgTransformationObserver.lambda$0(IcfgTransformationObserver.java:355) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:113) at de.uni_freiburg.informatik.ultimate.icfgtransformer.IcfgTransformationBacktranslator.translateExpression(IcfgTransformationBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 17:49:29,213 INFO L158 Benchmark]: Toolchain (without parser) took 39883.20ms. Allocated memory was 202.4MB in the beginning and 302.0MB in the end (delta: 99.6MB). Free memory was 150.8MB in the beginning and 184.4MB in the end (delta: -33.6MB). Peak memory consumption was 155.5MB. Max. memory is 8.0GB. [2022-01-10 17:49:29,213 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory was 168.4MB in the beginning and 168.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 17:49:29,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.13ms. Allocated memory is still 202.4MB. Free memory was 150.5MB in the beginning and 171.2MB in the end (delta: -20.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-01-10 17:49:29,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.97ms. Allocated memory is still 202.4MB. Free memory was 171.2MB in the beginning and 169.1MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 17:49:29,214 INFO L158 Benchmark]: Boogie Preprocessor took 24.94ms. Allocated memory is still 202.4MB. Free memory was 168.6MB in the beginning and 167.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 17:49:29,214 INFO L158 Benchmark]: RCFGBuilder took 353.10ms. Allocated memory is still 202.4MB. Free memory was 167.0MB in the beginning and 152.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-01-10 17:49:29,214 INFO L158 Benchmark]: IcfgTransformer took 58.06ms. Allocated memory is still 202.4MB. Free memory was 152.9MB in the beginning and 146.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-10 17:49:29,214 INFO L158 Benchmark]: TraceAbstraction took 39108.89ms. Allocated memory was 202.4MB in the beginning and 302.0MB in the end (delta: 99.6MB). Free memory was 146.6MB in the beginning and 184.4MB in the end (delta: -37.8MB). Peak memory consumption was 151.6MB. Max. memory is 8.0GB. [2022-01-10 17:49:29,215 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 202.4MB. Free memory was 168.4MB in the beginning and 168.2MB in the end (delta: 143.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 301.13ms. Allocated memory is still 202.4MB. Free memory was 150.5MB in the beginning and 171.2MB in the end (delta: -20.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.97ms. Allocated memory is still 202.4MB. Free memory was 171.2MB in the beginning and 169.1MB in the end (delta: 2.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.94ms. Allocated memory is still 202.4MB. Free memory was 168.6MB in the beginning and 167.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 353.10ms. Allocated memory is still 202.4MB. Free memory was 167.0MB in the beginning and 152.9MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 58.06ms. Allocated memory is still 202.4MB. Free memory was 152.9MB in the beginning and 146.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 39108.89ms. Allocated memory was 202.4MB in the beginning and 302.0MB in the end (delta: 99.6MB). Free memory was 146.6MB in the beginning and 184.4MB in the end (delta: -37.8MB). Peak memory consumption was 151.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * 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: 641]: 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: 39.0s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1037 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1037 mSDsluCounter, 2094 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 940 IncrementalHoareTripleChecker+Unchecked, 1727 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1835 IncrementalHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 367 mSDtfsCounter, 1835 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 919 GetRequests, 613 SyntacticMatches, 20 SemanticMatches, 286 ConstructedPredicates, 14 IntricatePredicates, 1 DeprecatedPredicates, 2807 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=13, InterpolantAutomatonStates: 132, 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, 15 MinimizatonAttempts, 116 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 36 NumberOfFragments, 3870 HoareAnnotationTreeSize, 11 FomulaSimplifications, 4952 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 3046 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1157 ConstructedInterpolants, 37 QuantifiedInterpolants, 14249 SizeOfPredicates, 124 NumberOfNonLiveVariables, 6452 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 37 InterpolantComputations, 6 PerfectInterpolantSequences, 371/552 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: 633]: Loop Invariant [2022-01-10 17:49:29,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,242 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,243 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,244 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((unknown-#memory_int-unknown[s][s] == len[31:0] && ~bvule64(#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]], 0bv64)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && ~bvule64(0bv64, new_head)) && i == 0bv32) && ~bvule64(0bv64, s)) && ~bvadd16(~zero_extendFrom32To33(len), 1bv33)[31:0] == unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]][#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]]) && ~bvule32(~bvmul32(2bv32, ~zero_extendFrom31To32(index[30:0])), index)) && 0bv64 == head) && ~bvule64(0bv64, #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && \valid[head] == 1bv1) && ~bvule64(new_head, 0bv64)) && ~bvult64(0bv64, new_head)) && \valid[new_head] == 1bv1) && ~bvule64(1bv64, head)) && !(0bv64 == s)) && 2bv32 == len) && ~bvule64(s, 0bv64)) || (((((~bvule34(~bvadd16(~zero_extendFrom33To34(~bvmul32(4294967296bv33, ~zero_extendFrom1To33(i[31:31]))), 1bv34), ~zero_extendFrom32To34(i)) && ~bvule33(~zero_extendFrom32To33(index), index[31:31] ++ 0bv32)) && !~bvult64(index, ~bvmul32(~zero_extendFrom31To32(index[30:0]), 2bv32))) && ~bvule32(0bv32, i)) && ~bvslt32(~bvadd16(~sign_extendFrom8To32((if !(0bv65 == ~bvurem65(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), 2147483648bv65), 36893488145271619584bv65)) then (if ~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), 2147483648bv65)[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv32(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), 2147483648bv65), 36893488145271619584bv65)) else ~bvsdiv32(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), 2147483648bv65), 36893488145271619584bv65)) else ~bvsdiv32(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), 2147483648bv65), 36893488145271619584bv65))), ~sign_extendFrom8To32((if !(~bvurem65(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), ~zero_extendFrom32To65(~bvmul32(~zero_extendFrom31To32(len[30:0]), 2bv32))), ~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(len)))), 36893488143124135936bv65) == 0bv65) then (if ~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), ~zero_extendFrom32To65(~bvmul32(~zero_extendFrom31To32(len[30:0]), 2bv32))), ~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(len))))[64:64] == 1bv1 then ~bvadd16(1bv65, ~bvsdiv32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), ~zero_extendFrom32To65(~bvmul32(~zero_extendFrom31To32(len[30:0]), 2bv32))), ~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(len)))), 36893488143124135936bv65)) else ~bvsdiv32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), ~zero_extendFrom32To65(~bvmul32(~zero_extendFrom31To32(len[30:0]), 2bv32))), ~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(len)))), 36893488143124135936bv65)) else ~bvsdiv32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), ~zero_extendFrom32To65(~bvmul32(~zero_extendFrom31To32(len[30:0]), 2bv32))), ~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(len)))), 36893488143124135936bv65)))), ~sign_extendFrom8To32(~bvadd16(~bvadd16(~sign_extendFrom8To32(~bvadd16(8589934590bv33, ~zero_extendFrom32To33(i))[32:32]), ~sign_extendFrom8To32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i))[32:31])), 1bv3)))) && 2bv32 == len)) || (!~bvult64(len, ~bvmul32(~zero_extendFrom31To32(len[30:0]), 2bv32)) && i == 0bv32)) || (((i == 1bv32 && ~bvule34(~bvadd16(~zero_extendFrom33To34(~bvmul32(4294967296bv33, ~zero_extendFrom1To33(i[31:31]))), 1bv34), ~zero_extendFrom32To34(i))) && !~bvult64(index, ~bvmul32(~zero_extendFrom31To32(index[30:0]), 2bv32))) && ~bvslt32(0bv32, ~bvadd16(~sign_extendFrom8To32(~bvadd16(~bvadd16(~zero_extendFrom32To63(len), ~sign_extendFrom8To32(~bvmul32(4611686018427387902bv62, ~zero_extendFrom31To62(len[30:0])))), 1bv63)[62:32]), 1bv32)))) || ((((((((((((((((((((((i == 1bv32 && ~bvule64(#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]], 0bv64)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(~bvmul32(4294967296bv33, ~zero_extendFrom1To33(i[31:31]))), 1bv34), ~zero_extendFrom32To34(i))) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && !~bvult64(index, ~bvmul32(~zero_extendFrom31To32(index[30:0]), 2bv32))) && ~bvule64(0bv64, new_head)) && !(s == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && ~bvule64(0bv64, s)) && ~bvadd16(~zero_extendFrom32To33(len), 1bv33)[31:0] == unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]][#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]]) && ~bvule32(~bvmul32(2bv32, ~zero_extendFrom31To32(index[30:0])), index)) && 0bv64 == head) && ~bvule64(0bv64, #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && \valid[head] == 1bv1) && ~bvule64(new_head, 0bv64)) && ~bvult64(0bv64, new_head)) && \valid[new_head] == 1bv1) && ~bvule64(1bv64, head)) && !(0bv64 == s)) && 2bv32 == len) && ~bvult64(~zero_extendFrom32To33(index), 4294967296bv33)) && ~bvule64(s, 0bv64)) && ~bvsle33((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0]))[32:32] == 1bv1 then ~bvadd16(~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33), 1bv33) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(~zero_extendFrom32To64(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0]), 18446744073709551615bv64)), 1bv65)[64:32])) - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 611]: Loop Invariant [2022-01-10 17:49:29,247 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,256 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,258 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,265 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,266 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_dll_update_at_~head#1.offset,QUANTIFIED] [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,267 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-01-10 17:49:29,268 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((~bvule64(0bv64, #memory_$Pointer$[head][~bvadd16(~zero_extendFrom64To65(head), 4bv65)[63:0]]) && ~bvsle33((if !(~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(index)), 4294967296bv33) == 0bv33) then (if 1bv1 == ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(index))[32:32] then ~bvadd16(1bv33, ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(index)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(index)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(index)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(index))), 1bv65)[64:32])) && !(#memory_$Pointer$[head][~bvadd16(~zero_extendFrom64To65(head), 4bv65)[63:0]] == head)) && ~bvule64(#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]], 0bv64)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(~bvmul32(4294967296bv33, ~zero_extendFrom1To33(i[31:31]))), 1bv34), ~zero_extendFrom32To34(i))) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && ~bvsle33((if !(~bvurem33(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33) == 0bv33) then (if ~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected))[32:32] == 1bv1 then ~bvadd16(~bvsdiv32(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33), 1bv33) else ~bvsdiv32(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(expected))), 3bv65)[64:32])) && ~bvule64(#memory_$Pointer$[head][~bvadd16(~zero_extendFrom64To65(head), 4bv65)[63:0]], 0bv64)) && ~bvsle33((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i))[32:32] == 1bv1 then ~bvadd16(1bv33, ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), 1bv65)[64:32])) && ~bvult64(~zero_extendFrom32To33(expected), 4294967296bv33)) && ~bvule64(0bv64, new_head)) && 0bv64 == #memory_$Pointer$[head][~bvadd16(~zero_extendFrom64To65(head), 12bv65)[63:0]]) && ~bvule64(head, 0bv64)) && !(s == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && ~bvule32(0bv32, i)) && ~bvule64(0bv64, s)) && ~bvadd16(~zero_extendFrom32To33(len), 1bv33)[31:0] == unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]][#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]]) && ~bvule32(~bvmul32(2bv32, ~zero_extendFrom31To32(index[30:0])), index)) && 0bv64 == head) && ~bvule64(0bv64, #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && 0bv64 == #memory_$Pointer$[head][~bvadd16(~zero_extendFrom64To65(head), 12bv65)[63:0]]) && !(0bv64 == head)) && \valid[head] == 1bv1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][~bvadd16(~zero_extendFrom64To65(head), 4bv65)[63:0]]][#memory_$Pointer$[head][~bvadd16(~zero_extendFrom64To65(head), 4bv65)[63:0]]] == expected[31:0]) && ~bvule64(new_head, 0bv64)) && ~bvult64(0bv64, new_head)) && \valid[new_head] == 1bv1) && ~bvule64(1bv64, head)) && ~bvule34(~bvadd16(~zero_extendFrom33To34(~bvmul32(4294967296bv33, ~zero_extendFrom1To33(index[31:31]))), 1bv34), ~zero_extendFrom32To34(index))) && !(0bv64 == s)) && 2bv32 == len) && ~bvule32(0bv32, expected)) && ~bvule32(0bv32, index)) && ~bvule64(0bv64, head)) && ~bvule64(s, 0bv64)) || ((((((0bv32 == index && i == 0bv32) && ~bvule64(head, 0bv64)) && expected == 2bv32) && (\exists ULTIMATE.start_dll_update_at_~head#1.offset : bv64 :: (2bv32 == unknown-#memory_int-unknown[head][ULTIMATE.start_dll_update_at_~head#1.offset] && ~bvule64(ULTIMATE.start_dll_update_at_~head#1.offset, head)) && ~bvule64(0bv64, ULTIMATE.start_dll_update_at_~head#1.offset))) && ~bvule32(~bvmul32(~zero_extendFrom31To32(index[30:0]), 2bv32), index)) && ~bvslt32(0bv32, ~bvadd16(~sign_extendFrom8To32(~bvadd16(~bvadd16(~zero_extendFrom32To63(len), ~sign_extendFrom8To32(~bvmul32(4611686018427387902bv62, ~zero_extendFrom31To62(len[30:0])))), 1bv63)[62:32]), 1bv32)))) || ((((((((((((((((((((((((((unknown-#memory_int-unknown[s][s] == len[31:0] && ~bvule64(#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]], 0bv64)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && ~bvule64(0bv64, new_head)) && i == 0bv32) && ~bvule64(head, 0bv64)) && ~bvule64(0bv64, s)) && ~bvadd16(~zero_extendFrom32To33(len), 1bv33)[31:0] == unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]][#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]]) && ~bvule32(~bvmul32(2bv32, ~zero_extendFrom31To32(index[30:0])), index)) && 0bv64 == head) && ~bvule64(0bv64, #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && !(0bv64 == head)) && expected == 2bv32) && \valid[head] == 1bv1) && ~bvule64(new_head, 0bv64)) && ~bvult64(0bv64, new_head)) && \valid[new_head] == 1bv1) && ~bvule64(1bv64, head)) && !(0bv64 == s)) && 2bv32 == len) && 2bv32 == unknown-#memory_int-unknown[head][head]) && ~bvult64(~zero_extendFrom32To33(index), 4294967296bv33)) && ~bvule32(0bv32, index)) && ~bvule64(0bv64, head)) && ~bvule64(s, 0bv64)) && ~bvsle33((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0]))[32:32] == 1bv1 then ~bvadd16(~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33), 1bv33) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(~zero_extendFrom32To64(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0]), 18446744073709551615bv64)), 1bv65)[64:32]))) || (((((((((((((((((((((((((((((expected[31:0] == unknown-#memory_int-unknown[head][head] && ~bvule64(#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]], 0bv64)) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && 0bv64 == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 12bv65)[63:0]]) && ~bvsle33((if !(~bvurem33(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33) == 0bv33) then (if ~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected))[32:32] == 1bv1 then ~bvadd16(~bvsdiv32(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33), 1bv33) else ~bvsdiv32(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934589bv33, ~zero_extendFrom32To33(expected)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(expected))), 3bv65)[64:32])) && ~bvsle33((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i))[32:32] == 1bv1 then ~bvadd16(1bv33, ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(i)), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(18446744073709551615bv64, ~zero_extendFrom32To64(i))), 1bv65)[64:32])) && ~bvult64(~zero_extendFrom32To33(expected), 4294967296bv33)) && ~bvule64(0bv64, new_head)) && ~bvule64(head, 0bv64)) && !(s == #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && ~bvule32(0bv32, i)) && ~bvule64(0bv64, s)) && ~bvadd16(~zero_extendFrom32To33(len), 1bv33)[31:0] == unknown-#memory_int-unknown[#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]][#memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]]]) && ~bvule32(~bvmul32(2bv32, ~zero_extendFrom31To32(index[30:0])), index)) && 0bv64 == head) && ~bvule64(0bv64, #memory_$Pointer$[s][~bvadd16(~zero_extendFrom64To65(s), 4bv65)[63:0]])) && ~bvult64(~zero_extendFrom32To33(i), 4294967296bv33)) && \valid[head] == 1bv1) && ~bvule64(new_head, 0bv64)) && \valid[new_head] == 1bv1) && ~bvule64(1bv64, head)) && !(0bv64 == s)) && 2bv32 == len) && ~bvult64(~zero_extendFrom32To33(index), 4294967296bv33)) && ~bvule32(0bv32, expected)) && ~bvule32(0bv32, index)) && !~bvule64(new_head, 0bv64)) && ~bvule64(0bv64, head)) && ~bvule64(s, 0bv64)) && ~bvsle33((if !(0bv33 == ~bvurem33(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)) then (if ~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0]))[32:32] == 1bv1 then ~bvadd16(~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33), 1bv33) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)) else ~bvsdiv32(~bvadd16(8589934591bv33, ~zero_extendFrom32To33(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0])), 4294967296bv33)), ~bvadd16(~sign_extendFrom8To32(~bvmul32(~zero_extendFrom32To64(~bvadd16(~zero_extendFrom32To33(index), 1bv33)[31:0]), 18446744073709551615bv64)), 1bv65)[64:32])) - InvariantResult [Line: 624]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: AssertionError: Cannot access array with 64bit indices via 1bit term. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Cannot access array with 64bit indices via 1bit term.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.bvinttranslation.IntToBvBackTranslation.convertApplicationTerm(IntToBvBackTranslation.java:780) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 17:49:29,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...