/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-properties/list_search-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:01:20,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:01:20,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:01:21,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:01:21,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:01:21,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:01:21,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:01:21,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:01:21,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:01:21,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:01:21,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:01:21,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:01:21,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:01:21,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:01:21,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:01:21,045 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:01:21,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:01:21,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:01:21,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:01:21,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:01:21,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:01:21,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:01:21,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:01:21,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:01:21,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:01:21,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:01:21,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:01:21,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:01:21,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:01:21,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:01:21,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:01:21,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:01:21,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:01:21,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:01:21,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:01:21,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:01:21,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:01:21,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:01:21,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:01:21,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:01:21,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:01:21,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:01:21,119 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:01:21,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:01:21,120 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:01:21,120 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:01:21,121 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:01:21,121 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:01:21,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:01:21,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:01:21,122 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:01:21,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:01:21,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:01:21,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:01:21,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:01:21,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:01:21,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:01:21,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:01:21,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:01:21,135 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:01:21,135 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:01:21,135 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:01:21,136 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:01:21,136 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:01:21,136 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:01:21,136 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:01:21,136 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:01:21,136 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:01:21,137 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 06:01:21,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:01:21,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:01:21,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:01:21,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:01:21,389 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:01:21,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search-1.i [2022-01-10 06:01:21,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6e8d762/d139d8bf1cbc4f888799787b9ce7294b/FLAGbd52a1227 [2022-01-10 06:01:21,856 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:01:21,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search-1.i [2022-01-10 06:01:21,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6e8d762/d139d8bf1cbc4f888799787b9ce7294b/FLAGbd52a1227 [2022-01-10 06:01:22,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df6e8d762/d139d8bf1cbc4f888799787b9ce7294b [2022-01-10 06:01:22,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:01:22,231 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:01:22,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:01:22,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:01:22,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:01:22,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bca7c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22, skipping insertion in model container [2022-01-10 06:01:22,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:01:22,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:01:22,407 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-properties/list_search-1.i[813,826] [2022-01-10 06:01:22,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:01:22,504 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 06:01:22,509 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:01:22,512 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-properties/list_search-1.i[813,826] [2022-01-10 06:01:22,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:01:22,555 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:01:22,570 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-properties/list_search-1.i[813,826] [2022-01-10 06:01:22,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:01:22,636 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:01:22,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22 WrapperNode [2022-01-10 06:01:22,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:01:22,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:01:22,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:01:22,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:01:22,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,702 INFO L137 Inliner]: procedures = 128, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2022-01-10 06:01:22,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:01:22,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:01:22,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:01:22,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:01:22,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:01:22,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:01:22,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:01:22,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:01:22,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (1/1) ... [2022-01-10 06:01:22,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:01:22,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:01:22,797 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 06:01:22,800 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 06:01:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:01:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:01:22,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:01:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:01:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:01:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2022-01-10 06:01:22,829 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2022-01-10 06:01:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:01:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:01:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:01:22,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:01:22,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:01:22,940 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:01:22,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:01:23,192 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:01:23,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:01:23,197 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 06:01:23,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:23 BoogieIcfgContainer [2022-01-10 06:01:23,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:01:23,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:01:23,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:01:23,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:01:23,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:01:22" (1/3) ... [2022-01-10 06:01:23,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d85655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:23, skipping insertion in model container [2022-01-10 06:01:23,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:22" (2/3) ... [2022-01-10 06:01:23,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d85655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:23, skipping insertion in model container [2022-01-10 06:01:23,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:23" (3/3) ... [2022-01-10 06:01:23,206 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2022-01-10 06:01:23,211 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:01:23,211 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:01:23,251 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:01:23,257 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 06:01:23,257 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:01:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 06:01:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 06:01:23,276 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:23,276 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:01:23,277 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:23,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:23,282 INFO L85 PathProgramCache]: Analyzing trace with hash -547062782, now seen corresponding path program 1 times [2022-01-10 06:01:23,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:23,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629286503] [2022-01-10 06:01:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:23,294 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:23,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:23,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:23,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:01:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:23,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:01:23,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-01-10 06:01:23,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:01:23,712 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:23,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629286503] [2022-01-10 06:01:23,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629286503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:01:23,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:01:23,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:01:23,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705577473] [2022-01-10 06:01:23,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:01:23,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:01:23,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:01:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:01:23,756 INFO L87 Difference]: Start difference. First operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:01:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:23,776 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2022-01-10 06:01:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:01:23,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-01-10 06:01:23,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:23,785 INFO L225 Difference]: With dead ends: 38 [2022-01-10 06:01:23,785 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 06:01:23,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 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 06:01:23,796 INFO L933 BasicCegarLoop]: 34 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, 34 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 06:01:23,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:01:23,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 06:01:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 06:01:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 06:01:23,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-01-10 06:01:23,839 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 35 [2022-01-10 06:01:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:23,841 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-01-10 06:01:23,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:01:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-01-10 06:01:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:01:23,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:23,844 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:01:23,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:24,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:01:24,058 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash -745059685, now seen corresponding path program 1 times [2022-01-10 06:01:24,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:24,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720522146] [2022-01-10 06:01:24,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:24,060 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:24,061 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:24,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:01:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:24,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:01:24,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:01:24,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:01:24,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:24,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720522146] [2022-01-10 06:01:24,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720522146] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:01:24,622 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:01:24,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-01-10 06:01:24,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254464917] [2022-01-10 06:01:24,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:01:24,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 06:01:24,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:24,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 06:01:24,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:01:24,624 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 06:01:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:24,943 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2022-01-10 06:01:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:01:24,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-01-10 06:01:24,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:24,950 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:01:24,953 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 06:01:24,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-01-10 06:01:24,955 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:24,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 84 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:01:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 06:01:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-01-10 06:01:24,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 06:01:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 06:01:24,966 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 37 [2022-01-10 06:01:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:24,967 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 06:01:24,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 06:01:24,968 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 06:01:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:01:24,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:24,969 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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 06:01:24,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:25,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:01:25,186 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:25,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2113798375, now seen corresponding path program 1 times [2022-01-10 06:01:25,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853441651] [2022-01-10 06:01:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:25,187 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:25,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:25,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:25,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:01:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:25,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-10 06:01:25,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:26,105 INFO L353 Elim1Store]: treesize reduction 288, result has 11.1 percent of original size [2022-01-10 06:01:26,106 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 4 case distinctions, treesize of input 32 treesize of output 45 [2022-01-10 06:01:26,239 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-01-10 06:01:26,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 29 [2022-01-10 06:01:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:01:26,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:01:26,277 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:26,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853441651] [2022-01-10 06:01:26,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853441651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:01:26,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:01:26,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 06:01:26,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423733258] [2022-01-10 06:01:26,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:01:26,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:01:26,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:01:26,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:01:26,282 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:01:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:26,822 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-01-10 06:01:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:01:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-01-10 06:01:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:26,824 INFO L225 Difference]: With dead ends: 42 [2022-01-10 06:01:26,824 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 06:01:26,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:01:26,825 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:26,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:01:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 06:01:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-01-10 06:01:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 06:01:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-01-10 06:01:26,832 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 37 [2022-01-10 06:01:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:26,832 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-01-10 06:01:26,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:01:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-01-10 06:01:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:01:26,834 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:26,834 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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 06:01:26,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:27,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:01:27,048 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:27,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:27,048 INFO L85 PathProgramCache]: Analyzing trace with hash -2056540073, now seen corresponding path program 1 times [2022-01-10 06:01:27,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:27,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90123884] [2022-01-10 06:01:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:27,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:27,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:27,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:27,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:01:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:27,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:01:27,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:01:27,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:01:27,422 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:27,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90123884] [2022-01-10 06:01:27,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90123884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:01:27,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:01:27,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 06:01:27,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986786257] [2022-01-10 06:01:27,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:01:27,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:01:27,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:27,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:01:27,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:01:27,424 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:01:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:27,788 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-01-10 06:01:27,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:01:27,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2022-01-10 06:01:27,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:27,791 INFO L225 Difference]: With dead ends: 40 [2022-01-10 06:01:27,791 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 06:01:27,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-10 06:01:27,793 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:27,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:01:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 06:01:27,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-01-10 06:01:27,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 06:01:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-01-10 06:01:27,798 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 37 [2022-01-10 06:01:27,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:27,799 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-01-10 06:01:27,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-10 06:01:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-01-10 06:01:27,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:01:27,806 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:27,807 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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 06:01:27,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-01-10 06:01:28,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:01:28,024 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:28,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:28,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1005030197, now seen corresponding path program 1 times [2022-01-10 06:01:28,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:28,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269728142] [2022-01-10 06:01:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:28,026 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:28,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:28,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:28,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:01:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:28,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 06:01:28,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:28,860 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 06:01:29,029 INFO L353 Elim1Store]: treesize reduction 288, result has 11.1 percent of original size [2022-01-10 06:01:29,029 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 4 case distinctions, treesize of input 32 treesize of output 45 [2022-01-10 06:01:29,299 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 06:01:29,306 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 06:01:29,524 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-10 06:01:29,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 32 [2022-01-10 06:01:29,546 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 9 treesize of output 3 [2022-01-10 06:01:29,569 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:01:29,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-01-10 06:01:29,712 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 31 treesize of output 19 [2022-01-10 06:01:29,717 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 19 treesize of output 11 [2022-01-10 06:01:29,807 INFO L353 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-01-10 06:01:29,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 29 [2022-01-10 06:01:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:01:29,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:30,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_42 (_ BitVec 64)) (v_ArrVal_613 (Array (_ BitVec 64) (_ BitVec 8)))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_42)))) (not (= (_ bv2 32) (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_42 v_ArrVal_613) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 64) c_~head~0.offset)) (select .cse0 (bvadd (_ bv2 64) c_~head~0.offset))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 64)))) (select .cse0 c_~head~0.offset))))))) is different from false [2022-01-10 06:01:30,543 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:30,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269728142] [2022-01-10 06:01:30,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269728142] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:01:30,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2085843097] [2022-01-10 06:01:30,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:30,544 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:01:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:01:30,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:01:30,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-01-10 06:01:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:31,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-10 06:01:31,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:31,268 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 06:01:31,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:31,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2022-01-10 06:01:31,675 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 06:01:31,684 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 06:01:31,771 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:01:31,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-01-10 06:01:31,778 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-10 06:01:31,998 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 60 treesize of output 36 [2022-01-10 06:01:32,002 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 06:01:32,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:32,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:32,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:32,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:32,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:32,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:32,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:32,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:32,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:32,117 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:32,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 98 treesize of output 50 [2022-01-10 06:01:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:01:32,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:32,535 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_772 (Array (_ BitVec 64) (_ BitVec 8))) (v_~head~0.base_48 (_ BitVec 64))) (or (not (= (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_48 v_ArrVal_772) c_~head~0.base))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 64) c_~head~0.offset)) (select .cse0 (bvadd (_ bv2 64) c_~head~0.offset))) (select .cse0 (bvadd c_~head~0.offset (_ bv1 64)))) (select .cse0 c_~head~0.offset))) (_ bv2 32))) (not (= (bvneg (select |c_#valid| v_~head~0.base_48)) (_ bv0 1))))) is different from false [2022-01-10 06:01:32,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2085843097] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:01:32,538 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:01:32,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2022-01-10 06:01:32,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947413977] [2022-01-10 06:01:32,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:01:32,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 06:01:32,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:32,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 06:01:32,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=541, Unknown=2, NotChecked=94, Total=702 [2022-01-10 06:01:32,540 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 06:01:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:33,525 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-10 06:01:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:01:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2022-01-10 06:01:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:33,528 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:01:33,528 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 06:01:33,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=126, Invalid=936, Unknown=2, NotChecked=126, Total=1190 [2022-01-10 06:01:33,529 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:33,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 239 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 94 Unchecked, 0.4s Time] [2022-01-10 06:01:33,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 06:01:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-01-10 06:01:33,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-10 06:01:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-01-10 06:01:33,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 40 [2022-01-10 06:01:33,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:33,535 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-01-10 06:01:33,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 19 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-10 06:01:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-01-10 06:01:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:01:33,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:33,536 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 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 06:01:33,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:33,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 06:01:33,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:01:33,960 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash -947771895, now seen corresponding path program 1 times [2022-01-10 06:01:33,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:33,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092624726] [2022-01-10 06:01:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:33,961 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:33,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:33,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:33,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:01:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:34,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:01:34,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:34,259 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 06:01:34,385 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 16 treesize of output 8 [2022-01-10 06:01:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:01:34,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:01:34,790 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:34,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092624726] [2022-01-10 06:01:34,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092624726] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:01:34,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:01:34,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2022-01-10 06:01:34,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748705004] [2022-01-10 06:01:34,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:01:34,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 06:01:34,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:34,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 06:01:34,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-01-10 06:01:34,793 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:01:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:35,990 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-01-10 06:01:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 06:01:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-01-10 06:01:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:35,992 INFO L225 Difference]: With dead ends: 48 [2022-01-10 06:01:35,992 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 06:01:35,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 06:01:35,993 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:35,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 143 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 06:01:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 06:01:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-01-10 06:01:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 06:01:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-01-10 06:01:35,999 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 40 [2022-01-10 06:01:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:35,999 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-01-10 06:01:36,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-10 06:01:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-01-10 06:01:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 06:01:36,000 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:36,000 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:01:36,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 06:01:36,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:01:36,218 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash 2009254361, now seen corresponding path program 2 times [2022-01-10 06:01:36,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:36,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582934621] [2022-01-10 06:01:36,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:01:36,219 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:36,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:36,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:36,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:01:37,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:01:37,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:01:37,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-10 06:01:37,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:37,336 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 06:01:37,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:37,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2022-01-10 06:01:37,663 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 06:01:37,671 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 06:01:37,925 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-01-10 06:01:37,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 33 [2022-01-10 06:01:37,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2022-01-10 06:01:38,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2022-01-10 06:01:38,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 06:01:38,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 06:01:38,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,721 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 46 treesize of output 32 [2022-01-10 06:01:38,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2022-01-10 06:01:38,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 06:01:38,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:38,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-01-10 06:01:39,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:39,598 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 06:01:39,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 59 [2022-01-10 06:01:39,625 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 06:01:39,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-01-10 06:01:39,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:39,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:39,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:39,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:39,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:39,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:39,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:39,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:39,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:39,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:39,854 INFO L353 Elim1Store]: treesize reduction 52, result has 21.2 percent of original size [2022-01-10 06:01:39,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 6 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 119 treesize of output 60 [2022-01-10 06:01:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:01:39,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:42,181 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:42,182 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 195 [2022-01-10 06:01:42,227 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:42,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 188 treesize of output 159 [2022-01-10 06:01:42,240 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:42,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2022-01-10 06:01:42,478 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimArr_4 (Array (_ BitVec 64) (_ BitVec 64))) (v_~head~0.base_72 (_ BitVec 64)) (v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 8)))) (or (not (= (select v_arrayElimArr_6 (_ bv4 64)) c_~head~0.offset)) (not (= (select v_arrayElimArr_5 (_ bv2 64)) (_ bv0 8))) (not (= (select v_arrayElimArr_5 (_ bv0 64)) (_ bv3 8))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_72)))) (not (= (select v_arrayElimArr_5 (_ bv1 64)) (_ bv0 8))) (not (= (select v_arrayElimArr_5 (_ bv3 64)) (_ bv0 8))) (not (= (_ bv2 32) (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 64)))) (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_72 v_arrayElimArr_5) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_72 v_arrayElimArr_4) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_72 v_arrayElimArr_6) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 64) .cse1)) (select .cse0 (bvadd (_ bv2 64) .cse1))) (select .cse0 (bvadd .cse1 (_ bv1 64)))) (select .cse0 .cse1)))))) (not (= (select v_arrayElimArr_4 (_ bv4 64)) c_~head~0.base)))) is different from false [2022-01-10 06:01:42,483 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582934621] [2022-01-10 06:01:42,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582934621] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:01:42,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1219497149] [2022-01-10 06:01:42,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:01:42,484 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:01:42,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:01:42,485 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:01:42,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-01-10 06:01:43,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:01:43,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:01:43,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 100 conjunts are in the unsatisfiable core [2022-01-10 06:01:43,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:43,288 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 06:01:43,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 48 [2022-01-10 06:01:43,834 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 06:01:43,840 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 06:01:43,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:43,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 42 [2022-01-10 06:01:44,242 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-01-10 06:01:44,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 33 [2022-01-10 06:01:44,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 35 [2022-01-10 06:01:44,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 06:01:44,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,563 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2022-01-10 06:01:44,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 06:01:44,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 67 [2022-01-10 06:01:44,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 06:01:44,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 89 treesize of output 58 [2022-01-10 06:01:44,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:44,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-01-10 06:01:45,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:45,624 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 06:01:45,624 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 80 [2022-01-10 06:01:45,643 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 06:01:45,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-01-10 06:01:46,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:46,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:46,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:46,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:46,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:46,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:46,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:46,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:01:46,036 INFO L353 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-01-10 06:01:46,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 9 disjoint index pairs (out of 91 index pairs), introduced 10 new quantified variables, introduced 32 case distinctions, treesize of input 140 treesize of output 60 [2022-01-10 06:01:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:01:46,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:47,210 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:47,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 195 [2022-01-10 06:01:47,242 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:47,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 188 treesize of output 159 [2022-01-10 06:01:47,262 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:47,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 123 [2022-01-10 06:01:47,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimArr_11 (Array (_ BitVec 64) (_ BitVec 64))) (v_arrayElimArr_12 (Array (_ BitVec 64) (_ BitVec 8))) (v_~head~0.base_78 (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_78)))) (not (= c_~head~0.offset (select v_arrayElimArr_13 (_ bv4 64)))) (not (= (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 64)))) (let ((.cse0 (select (store |c_#memory_int| v_~head~0.base_78 v_arrayElimArr_12) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_78 v_arrayElimArr_11) c_~head~0.base) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_78 v_arrayElimArr_13) c_~head~0.base) .cse2))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 64) .cse1)) (select .cse0 (bvadd (_ bv2 64) .cse1))) (select .cse0 (bvadd (_ bv1 64) .cse1))) (select .cse0 .cse1)))) (_ bv2 32))) (not (= (_ bv0 8) (select v_arrayElimArr_12 (_ bv1 64)))) (not (= (_ bv0 8) (select v_arrayElimArr_12 (_ bv3 64)))) (not (= (select v_arrayElimArr_12 (_ bv2 64)) (_ bv0 8))) (not (= c_~head~0.base (select v_arrayElimArr_11 (_ bv4 64)))) (not (= (select v_arrayElimArr_12 (_ bv0 64)) (_ bv3 8))))) is different from false [2022-01-10 06:01:47,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1219497149] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:01:47,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:01:47,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2022-01-10 06:01:47,431 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639702023] [2022-01-10 06:01:47,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:01:47,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-10 06:01:47,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:47,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-10 06:01:47,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1159, Unknown=12, NotChecked=138, Total=1406 [2022-01-10 06:01:47,432 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 27 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 06:01:50,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:50,347 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-01-10 06:01:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 06:01:50,348 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 27 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 43 [2022-01-10 06:01:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:50,349 INFO L225 Difference]: With dead ends: 51 [2022-01-10 06:01:50,349 INFO L226 Difference]: Without dead ends: 46 [2022-01-10 06:01:50,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=182, Invalid=1881, Unknown=15, NotChecked=178, Total=2256 [2022-01-10 06:01:50,351 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:50,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 311 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 132 Unchecked, 0.7s Time] [2022-01-10 06:01:50,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-10 06:01:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-01-10 06:01:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 06:01:50,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-01-10 06:01:50,359 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 43 [2022-01-10 06:01:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:50,359 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-01-10 06:01:50,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 27 states have internal predecessors, (53), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2022-01-10 06:01:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-01-10 06:01:50,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 06:01:50,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:50,360 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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 06:01:50,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-01-10 06:01:50,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:50,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 06:01:50,767 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2066512663, now seen corresponding path program 2 times [2022-01-10 06:01:50,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247826913] [2022-01-10 06:01:50,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:01:50,768 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:50,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:50,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:50,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:01:51,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:01:51,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:01:51,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 06:01:51,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:51,574 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 06:01:51,598 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 06:01:51,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 06:01:51,860 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 06:01:52,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:52,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-01-10 06:01:52,050 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:01:52,050 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-01-10 06:01:52,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:01:52,340 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:01:52,341 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-01-10 06:01:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:01:52,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:53,201 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:53,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-01-10 06:01:53,243 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_15 (Array (_ BitVec 64) (_ BitVec 64))) (v_~head~0.base_84 (_ BitVec 64))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_84))))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_84 v_arrayElimArr_15) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 64))))) (not (= (select v_arrayElimArr_15 (_ bv4 64)) c_~head~0.base)))) is different from false [2022-01-10 06:01:53,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:53,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247826913] [2022-01-10 06:01:53,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247826913] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:01:53,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2062488490] [2022-01-10 06:01:53,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:01:53,248 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:01:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:01:53,260 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:01:53,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-01-10 06:01:53,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:01:53,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:01:53,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-10 06:01:53,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:53,930 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 06:01:53,945 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 06:01:54,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 06:01:54,058 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 06:01:54,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:01:54,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-01-10 06:01:54,167 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:01:54,168 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-01-10 06:01:54,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:01:54,295 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:01:54,296 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-01-10 06:01:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:01:54,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:01:54,698 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:01:54,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-01-10 06:01:54,730 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_17 (Array (_ BitVec 64) (_ BitVec 64))) (v_~head~0.base_90 (_ BitVec 64))) (or (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_90 v_arrayElimArr_17) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 64))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_90)))) (not (= (select v_arrayElimArr_17 (_ bv4 64)) c_~head~0.base)))) is different from false [2022-01-10 06:01:54,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2062488490] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:01:54,732 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:01:54,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2022-01-10 06:01:54,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697051216] [2022-01-10 06:01:54,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:01:54,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:01:54,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:01:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=377, Unknown=2, NotChecked=78, Total=506 [2022-01-10 06:01:54,734 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:01:55,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:55,617 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-01-10 06:01:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 06:01:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2022-01-10 06:01:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:55,628 INFO L225 Difference]: With dead ends: 52 [2022-01-10 06:01:55,628 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 06:01:55,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=107, Invalid=829, Unknown=2, NotChecked=118, Total=1056 [2022-01-10 06:01:55,629 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:55,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 246 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 138 Invalid, 0 Unknown, 87 Unchecked, 0.4s Time] [2022-01-10 06:01:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 06:01:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-01-10 06:01:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-10 06:01:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-01-10 06:01:55,635 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 43 [2022-01-10 06:01:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:55,636 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-01-10 06:01:55,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:01:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-01-10 06:01:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-10 06:01:55,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:55,636 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:01:55,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:55,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:56,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 06:01:56,040 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1384296971, now seen corresponding path program 3 times [2022-01-10 06:01:56,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:56,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193639356] [2022-01-10 06:01:56,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:01:56,041 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:56,041 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:01:56,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 06:01:57,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 06:01:57,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-01-10 06:01:57,637 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 06:01:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 06:01:58,804 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-01-10 06:01:58,804 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 06:01:58,805 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 06:01:58,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:01:59,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:01:59,010 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2022-01-10 06:01:59,012 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 06:01:59,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:01:59 BoogieIcfgContainer [2022-01-10 06:01:59,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 06:01:59,058 INFO L158 Benchmark]: Toolchain (without parser) took 36826.43ms. Allocated memory was 182.5MB in the beginning and 229.6MB in the end (delta: 47.2MB). Free memory was 129.3MB in the beginning and 163.0MB in the end (delta: -33.7MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-01-10 06:01:59,058 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:01:59,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.04ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 142.1MB in the end (delta: -13.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-01-10 06:01:59,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.11ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 06:01:59,058 INFO L158 Benchmark]: Boogie Preprocessor took 46.74ms. Allocated memory is still 182.5MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:01:59,059 INFO L158 Benchmark]: RCFGBuilder took 448.23ms. Allocated memory is still 182.5MB. Free memory was 138.4MB in the beginning and 125.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 06:01:59,059 INFO L158 Benchmark]: TraceAbstraction took 35856.89ms. Allocated memory was 182.5MB in the beginning and 229.6MB in the end (delta: 47.2MB). Free memory was 124.8MB in the beginning and 163.0MB in the end (delta: -38.2MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-01-10 06:01:59,060 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.12ms. Allocated memory is still 182.5MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 402.04ms. Allocated memory is still 182.5MB. Free memory was 129.1MB in the beginning and 142.1MB in the end (delta: -13.0MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.11ms. Allocated memory is still 182.5MB. Free memory was 142.1MB in the beginning and 140.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.74ms. Allocated memory is still 182.5MB. Free memory was 140.5MB in the beginning and 138.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.23ms. Allocated memory is still 182.5MB. Free memory was 138.4MB in the beginning and 125.3MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 35856.89ms. Allocated memory was 182.5MB in the beginning and 229.6MB in the end (delta: 47.2MB). Free memory was 124.8MB in the beginning and 163.0MB in the end (delta: -38.2MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L533] mlist *head; VAL [head={0:0}] [L554] int i; [L555] mlist *mylist, *temp; VAL [head={0:0}] [L556] CALL insert_list(mylist,2) VAL [\old(head)=null, \old(head)=null, \old(k)=2, head={0:0}, l={5:6}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=2, head={0:0}, k=2, l={5:6}, l={-9223372036854775806:0}] [L544] COND TRUE head==((void *)0) [L545] l->next = ((void *)0) VAL [\old(head)=null, \old(head)=null, \old(k)=2, head={0:0}, k=2, l={5:6}, l={-9223372036854775806:0}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=2, \result=0, head={-9223372036854775806:0}, k=2, l={-9223372036854775806:0}, l={5:6}] [L556] RET insert_list(mylist,2) VAL [head={-9223372036854775806:0}, insert_list(mylist,2)=0, mylist={5:6}] [L557] CALL insert_list(mylist,5) VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-9223372036854775806:0}, l={5:6}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-9223372036854775806:0}, k=5, l={7:0}, l={5:6}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)=null, \old(head)=null, \old(k)=5, head={-9223372036854775806:0}, k=5, l={5:6}, l={7:0}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=5, \result=0, head={7:0}, k=5, l={7:0}, l={5:6}] [L557] RET insert_list(mylist,5) VAL [head={7:0}, insert_list(mylist,5)=0, mylist={5:6}] [L558] CALL insert_list(mylist,1) VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, l={5:6}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, k=1, l={-9223372036854775808:0}, l={5:6}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)=null, \old(head)=null, \old(k)=1, head={7:0}, k=1, l={5:6}, l={-9223372036854775808:0}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=1, \result=0, head={-9223372036854775808:0}, k=1, l={-9223372036854775808:0}, l={5:6}] [L558] RET insert_list(mylist,1) VAL [head={-9223372036854775808:0}, insert_list(mylist,1)=0, mylist={5:6}] [L559] CALL insert_list(mylist,3) VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-9223372036854775808:0}, l={5:6}] [L542] l = (mlist*)malloc(sizeof(mlist)) [L543] l->key = k VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-9223372036854775808:0}, k=3, l={5:6}, l={3:0}] [L544] COND FALSE !(head==((void *)0)) [L547] l->key = k [L548] l->next = head VAL [\old(head)=null, \old(head)=null, \old(k)=3, head={-9223372036854775808:0}, k=3, l={3:0}, l={5:6}] [L550] head = l [L551] return 0; VAL [\old(head)=null, \old(head)=null, \old(k)=3, \result=0, head={3:0}, k=3, l={3:0}, l={5:6}] [L559] RET insert_list(mylist,3) VAL [head={3:0}, insert_list(mylist,3)=0, mylist={5:6}] [L560] CALL, EXPR search_list(head,2) [L535] l = head VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={3:0}] [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={3:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={3:0}, l={-9223372036854775808:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={7:0}, l={3:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L536] COND TRUE l!=((void *)0) && l->key!=k [L537] EXPR l->next [L537] l = l->next [L536] l!=((void *)0) && l->key!=k [L536] EXPR l->key [L536] l!=((void *)0) && l->key!=k VAL [\old(k)=2, head={3:0}, k=2, l={-9223372036854775806:0}, l={3:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L536] COND FALSE !(l!=((void *)0) && l->key!=k) [L539] return l; VAL [\old(k)=2, \result={-9223372036854775806:0}, head={3:0}, k=2, l={3:0}, l={-9223372036854775806:0}] [L560] RET, EXPR search_list(head,2) [L560] temp = search_list(head,2) [L561] EXPR temp->key [L561] CALL __VERIFIER_assert(temp->key==1) [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, head={3:0}] [L15] reach_error() VAL [\old(cond)=0, cond=0, head={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 1217 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 313 IncrementalHoareTripleChecker+Unchecked, 1045 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 784 IncrementalHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 172 mSDtfsCounter, 784 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 471 SyntacticMatches, 7 SemanticMatches, 169 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 96, 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, 8 MinimizatonAttempts, 38 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 484 NumberOfCodeBlocks, 484 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 502 ConstructedInterpolants, 48 QuantifiedInterpolants, 6553 SizeOfPredicates, 130 NumberOfNonLiveVariables, 3539 ConjunctsInSsa, 403 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 303/438 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 RESULT: Ultimate proved your program to be incorrect! [2022-01-10 06:01:59,102 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...