/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/forester-heap/sll-reverse_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:05:12,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:05:12,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:05:12,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:05:12,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:05:12,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:05:12,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:05:12,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:05:12,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:05:12,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:05:12,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:05:12,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:05:12,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:05:12,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:05:12,503 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:05:12,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:05:12,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:05:12,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:05:12,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:05:12,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:05:12,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:05:12,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:05:12,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:05:12,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:05:12,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:05:12,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:05:12,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:05:12,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:05:12,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:05:12,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:05:12,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:05:12,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:05:12,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:05:12,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:05:12,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:05:12,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:05:12,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:05:12,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:05:12,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:05:12,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:05:12,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:05:12,516 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:05:12,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:05:12,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:05:12,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:05:12,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:05:12,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:05:12,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:05:12,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:05:12,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:05:12,530 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:05:12,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:05:12,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:05:12,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:05:12,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:05:12,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:05:12,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:05:12,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:05:12,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:05:12,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:05:12,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:05:12,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:05:12,532 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:05:12,532 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:05:12,533 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:05:12,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:05:12,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:05:12,533 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:05:12,533 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:05:12,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:05:12,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:05:12,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:05:12,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:05:12,701 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:05:12,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2022-01-10 06:05:12,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d327aecee/521158bf1cde469483dd8b1c06c11dee/FLAG23c2b7958 [2022-01-10 06:05:13,140 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:05:13,141 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i [2022-01-10 06:05:13,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d327aecee/521158bf1cde469483dd8b1c06c11dee/FLAG23c2b7958 [2022-01-10 06:05:13,164 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d327aecee/521158bf1cde469483dd8b1c06c11dee [2022-01-10 06:05:13,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:05:13,168 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:05:13,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:05:13,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:05:13,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:05:13,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4c13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13, skipping insertion in model container [2022-01-10 06:05:13,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:05:13,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:05:13,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22251,22264] [2022-01-10 06:05:13,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22336,22349] [2022-01-10 06:05:13,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22829,22842] [2022-01-10 06:05:13,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:05:13,437 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:05:13,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22251,22264] [2022-01-10 06:05:13,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22336,22349] [2022-01-10 06:05:13,461 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-reverse_simple.i[22829,22842] [2022-01-10 06:05:13,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:05:13,481 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:05:13,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13 WrapperNode [2022-01-10 06:05:13,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:05:13,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:05:13,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:05:13,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:05:13,487 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:05:13" (1/1) ... [2022-01-10 06:05:13,498 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:05:13" (1/1) ... [2022-01-10 06:05:13,519 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2022-01-10 06:05:13,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:05:13,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:05:13,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:05:13,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:05:13,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:05:13,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:05:13,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:05:13,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:05:13,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (1/1) ... [2022-01-10 06:05:13,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:05:13,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:05:13,580 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:05:13,583 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:05:13,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:05:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:05:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:05:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:05:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:05:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:05:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:05:13,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:05:13,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:05:13,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:05:13,710 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:05:13,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:05:13,946 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:05:13,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:05:13,950 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-01-10 06:05:13,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:13 BoogieIcfgContainer [2022-01-10 06:05:13,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:05:13,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:05:13,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:05:13,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:05:13,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:05:13" (1/3) ... [2022-01-10 06:05:13,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffec678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:13, skipping insertion in model container [2022-01-10 06:05:13,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:05:13" (2/3) ... [2022-01-10 06:05:13,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffec678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:05:13, skipping insertion in model container [2022-01-10 06:05:13,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:05:13" (3/3) ... [2022-01-10 06:05:13,957 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple.i [2022-01-10 06:05:13,962 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:05:13,962 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 06:05:13,991 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:05:13,995 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:05:13,996 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 06:05:14,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-10 06:05:14,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:14,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:14,009 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1808873062, now seen corresponding path program 1 times [2022-01-10 06:05:14,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:14,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902943053] [2022-01-10 06:05:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:14,027 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:14,029 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:05:14,030 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:05:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:14,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:05:14,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:14,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:14,128 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:14,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902943053] [2022-01-10 06:05:14,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902943053] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:14,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:14,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:05:14,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814772600] [2022-01-10 06:05:14,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:14,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:05:14,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:14,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:05:14,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:05:14,166 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 34 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:14,193 INFO L93 Difference]: Finished difference Result 67 states and 107 transitions. [2022-01-10 06:05:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:05:14,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-01-10 06:05:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:14,199 INFO L225 Difference]: With dead ends: 67 [2022-01-10 06:05:14,199 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 06:05:14,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:05:14,218 INFO L933 BasicCegarLoop]: 42 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, 42 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:05:14,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:05:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 06:05:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-10 06:05:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-01-10 06:05:14,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2022-01-10 06:05:14,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:14,240 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-01-10 06:05:14,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-01-10 06:05:14,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 06:05:14,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:14,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:14,250 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:05:14,447 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:05:14,448 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash 239687661, now seen corresponding path program 1 times [2022-01-10 06:05:14,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:14,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032979925] [2022-01-10 06:05:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:14,449 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:14,450 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:05:14,454 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:05:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:14,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:05:14,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:14,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:14,570 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:14,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032979925] [2022-01-10 06:05:14,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032979925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:14,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:14,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:05:14,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963220517] [2022-01-10 06:05:14,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:14,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:05:14,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:14,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:05:14,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:05:14,582 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:14,724 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-01-10 06:05:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:05:14,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-01-10 06:05:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:14,725 INFO L225 Difference]: With dead ends: 54 [2022-01-10 06:05:14,725 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 06:05:14,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:14,726 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:14,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:05:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 06:05:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-01-10 06:05:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-01-10 06:05:14,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 8 [2022-01-10 06:05:14,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:14,731 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-01-10 06:05:14,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-01-10 06:05:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:05:14,732 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:14,732 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:14,741 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:05:14,932 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:05:14,933 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1200905122, now seen corresponding path program 1 times [2022-01-10 06:05:14,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:14,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601886387] [2022-01-10 06:05:14,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:14,934 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:14,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:14,935 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:05:14,936 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:05:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:14,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:05:14,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:15,117 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 25 treesize of output 17 [2022-01-10 06:05:15,121 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 21 treesize of output 13 [2022-01-10 06:05:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:15,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:15,251 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:15,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601886387] [2022-01-10 06:05:15,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601886387] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:15,253 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:15,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-01-10 06:05:15,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580644250] [2022-01-10 06:05:15,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:15,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:05:15,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:05:15,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:05:15,256 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:15,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:15,446 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-01-10 06:05:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:05:15,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 06:05:15,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:15,447 INFO L225 Difference]: With dead ends: 35 [2022-01-10 06:05:15,448 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 06:05:15,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:05:15,449 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:15,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 31 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:15,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 06:05:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-01-10 06:05:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-01-10 06:05:15,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 13 [2022-01-10 06:05:15,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:15,452 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-01-10 06:05:15,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-01-10 06:05:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 06:05:15,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:15,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:15,463 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:05:15,653 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:05:15,654 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:15,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 825424614, now seen corresponding path program 1 times [2022-01-10 06:05:15,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:15,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265423454] [2022-01-10 06:05:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:15,655 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:15,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:15,657 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:05:15,659 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:05:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:15,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:05:15,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:15,784 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:05:15,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 06:05:15,917 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:05:15,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-10 06:05:15,931 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:05:15,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-01-10 06:05:15,977 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 24 treesize of output 12 [2022-01-10 06:05:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:15,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:16,052 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-01-10 06:05:16,067 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:16,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2022-01-10 06:05:16,083 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 20 treesize of output 18 [2022-01-10 06:05:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:16,412 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:16,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265423454] [2022-01-10 06:05:16,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265423454] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:16,412 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:16,412 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-01-10 06:05:16,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793725970] [2022-01-10 06:05:16,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:16,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:05:16,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:16,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:05:16,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:05:16,413 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:16,733 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-01-10 06:05:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:05:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 06:05:16,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:16,734 INFO L225 Difference]: With dead ends: 50 [2022-01-10 06:05:16,734 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 06:05:16,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-10 06:05:16,735 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 53 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:16,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 89 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 95 Invalid, 0 Unknown, 14 Unchecked, 0.3s Time] [2022-01-10 06:05:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 06:05:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-01-10 06:05:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 06:05:16,739 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 18 [2022-01-10 06:05:16,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:16,739 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 06:05:16,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 06:05:16,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 06:05:16,740 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:16,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:16,758 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:05:16,948 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:05:16,948 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1505482984, now seen corresponding path program 1 times [2022-01-10 06:05:16,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:16,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698488315] [2022-01-10 06:05:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:16,950 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:16,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:16,951 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:05:16,952 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:05:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:17,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 06:05:17,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:17,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:17,057 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 06:05:17,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:17,182 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 21 treesize of output 20 [2022-01-10 06:05:17,229 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 18 treesize of output 10 [2022-01-10 06:05:17,232 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 15 treesize of output 17 [2022-01-10 06:05:17,278 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 16 treesize of output 8 [2022-01-10 06:05:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:17,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:17,396 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:17,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 66 [2022-01-10 06:05:17,401 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 38 treesize of output 36 [2022-01-10 06:05:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:17,612 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:17,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698488315] [2022-01-10 06:05:17,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698488315] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:17,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:17,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-01-10 06:05:17,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011544184] [2022-01-10 06:05:17,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:17,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 06:05:17,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:17,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 06:05:17,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-01-10 06:05:17,614 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:17,976 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-01-10 06:05:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:05:17,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 06:05:17,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:17,977 INFO L225 Difference]: With dead ends: 66 [2022-01-10 06:05:17,977 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 06:05:17,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-10 06:05:17,978 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:17,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 128 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 52 Unchecked, 0.3s Time] [2022-01-10 06:05:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 06:05:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-01-10 06:05:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-01-10 06:05:17,982 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2022-01-10 06:05:17,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:17,982 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-01-10 06:05:17,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-01-10 06:05:17,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:05:17,983 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:17,983 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:17,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:18,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:18,192 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:18,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1413183039, now seen corresponding path program 2 times [2022-01-10 06:05:18,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:18,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423482151] [2022-01-10 06:05:18,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:05:18,193 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:18,194 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:18,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:05:18,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:05:18,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:05:18,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-10 06:05:18,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:18,358 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:05:18,440 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:05:18,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:18,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 06:05:18,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 06:05:18,496 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:05:18,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-01-10 06:05:18,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:18,501 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 20 treesize of output 22 [2022-01-10 06:05:18,509 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:05:18,509 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 15 treesize of output 15 [2022-01-10 06:05:18,560 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:05:18,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:18,567 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 21 treesize of output 20 [2022-01-10 06:05:18,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:05:18,605 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:05:18,614 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 11 treesize of output 7 [2022-01-10 06:05:18,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 37 treesize of output 25 [2022-01-10 06:05:18,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 21 treesize of output 13 [2022-01-10 06:05:18,721 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:05:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:18,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:18,855 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_~prev~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~prev~0#1.offset|)))) is different from false [2022-01-10 06:05:18,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_189 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_189)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 32))) is different from false [2022-01-10 06:05:18,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_189 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_189)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_193) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32))) is different from false [2022-01-10 06:05:18,895 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:18,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 58 [2022-01-10 06:05:18,926 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:18,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 113 [2022-01-10 06:05:18,939 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 48 treesize of output 46 [2022-01-10 06:05:20,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:20,208 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 26 treesize of output 30 [2022-01-10 06:05:20,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_29 (_ BitVec 64)) (v_arrayElimCell_28 (_ BitVec 64)) (v_ArrVal_193 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_189 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse0 (= v_arrayElimCell_29 |c_ULTIMATE.start_main_~head~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (not (= v_arrayElimCell_28 v_arrayElimCell_29)) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (and (not .cse0) (= (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_186)) v_arrayElimCell_29 v_ArrVal_184))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_189))) v_arrayElimCell_28 v_ArrVal_193) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32))) (and (forall ((v_arrayElimCell_30 (_ BitVec 64))) (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_186)) v_arrayElimCell_29 v_ArrVal_184))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_189))) v_arrayElimCell_30 v_ArrVal_193) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32))) .cse0) (not (= (select |c_#valid| v_arrayElimCell_29) (_ bv0 1)))))) is different from false [2022-01-10 06:05:20,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:05:20,325 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:20,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 80 [2022-01-10 06:05:20,353 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:20,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 160 [2022-01-10 06:05:20,361 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 160 treesize of output 144 [2022-01-10 06:05:20,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:05:20,368 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 138 treesize of output 130 [2022-01-10 06:05:20,681 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 8 treesize of output 4 [2022-01-10 06:05:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-10 06:05:20,847 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:20,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423482151] [2022-01-10 06:05:20,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423482151] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:20,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:20,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-01-10 06:05:20,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237369692] [2022-01-10 06:05:20,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:20,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 06:05:20,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:20,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 06:05:20,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=176, Unknown=4, NotChecked=116, Total=342 [2022-01-10 06:05:20,849 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:21,336 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_29 (_ BitVec 64))) (or (and (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (not (= v_arrayElimCell_29 |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| v_arrayElimCell_29) (_ bv0 1))))) (forall ((v_arrayElimCell_29 (_ BitVec 64)) (v_arrayElimCell_28 (_ BitVec 64)) (v_ArrVal_193 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_189 (_ BitVec 32)) (v_ArrVal_186 (_ BitVec 32))) (let ((.cse0 (= v_arrayElimCell_29 |c_ULTIMATE.start_main_~head~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (not (= v_arrayElimCell_28 v_arrayElimCell_29)) (= |c_ULTIMATE.start_main_~x~0#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (and (not .cse0) (= (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_186)) v_arrayElimCell_29 v_ArrVal_184))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_189))) v_arrayElimCell_28 v_ArrVal_193) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32))) (and (forall ((v_arrayElimCell_30 (_ BitVec 64))) (= (select (select (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_186)) v_arrayElimCell_29 v_ArrVal_184))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_189))) v_arrayElimCell_30 v_ArrVal_193) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 32))) .cse0) (not (= (select |c_#valid| v_arrayElimCell_29) (_ bv0 1))))))) is different from false [2022-01-10 06:05:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:21,900 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-01-10 06:05:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 06:05:21,901 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 06:05:21,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:21,903 INFO L225 Difference]: With dead ends: 120 [2022-01-10 06:05:21,903 INFO L226 Difference]: Without dead ends: 118 [2022-01-10 06:05:21,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=384, Unknown=5, NotChecked=220, Total=702 [2022-01-10 06:05:21,904 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 156 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:21,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 157 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 220 Invalid, 0 Unknown, 279 Unchecked, 0.7s Time] [2022-01-10 06:05:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-01-10 06:05:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 50. [2022-01-10 06:05:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-01-10 06:05:21,910 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 19 [2022-01-10 06:05:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:21,910 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-01-10 06:05:21,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:21,910 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-01-10 06:05:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:05:21,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:21,911 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:21,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:22,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:22,120 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1413184961, now seen corresponding path program 1 times [2022-01-10 06:05:22,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:22,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270632701] [2022-01-10 06:05:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:22,121 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:22,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:22,122 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:05:22,122 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:05:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:22,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:05:22,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:05:22,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:22,241 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:22,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270632701] [2022-01-10 06:05:22,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270632701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:22,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:22,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:05:22,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456448738] [2022-01-10 06:05:22,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:22,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:05:22,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:05:22,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:05:22,242 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:22,259 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-01-10 06:05:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:05:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 06:05:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:22,260 INFO L225 Difference]: With dead ends: 58 [2022-01-10 06:05:22,260 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 06:05:22,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:05:22,261 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:22,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:05:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 06:05:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-01-10 06:05:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 49 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-01-10 06:05:22,266 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 19 [2022-01-10 06:05:22,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:22,266 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-01-10 06:05:22,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-01-10 06:05:22,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:05:22,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:22,267 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:22,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:22,475 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:05:22,475 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1020156029, now seen corresponding path program 2 times [2022-01-10 06:05:22,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:22,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941106271] [2022-01-10 06:05:22,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:05:22,476 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:22,477 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:05:22,478 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:05:22,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:05:22,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:05:22,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 06:05:22,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:22,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:22,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 06:05:22,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:22,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 06:05:22,681 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 18 treesize of output 14 [2022-01-10 06:05:22,685 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 18 treesize of output 14 [2022-01-10 06:05:22,688 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 11 treesize of output 7 [2022-01-10 06:05:22,690 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 11 treesize of output 7 [2022-01-10 06:05:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:05:22,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:05:22,711 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:22,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941106271] [2022-01-10 06:05:22,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941106271] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:05:22,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:05:22,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:05:22,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510838100] [2022-01-10 06:05:22,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:05:22,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:05:22,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:05:22,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:05:22,713 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:22,936 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2022-01-10 06:05:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:05:22,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 06:05:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:22,938 INFO L225 Difference]: With dead ends: 75 [2022-01-10 06:05:22,938 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 06:05:22,938 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:05:22,939 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:22,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 06:05:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 06:05:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-01-10 06:05:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-01-10 06:05:22,943 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 19 [2022-01-10 06:05:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:22,943 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-01-10 06:05:22,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-01-10 06:05:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:05:22,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:22,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:22,953 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:05:23,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:23,153 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:23,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash -758128691, now seen corresponding path program 1 times [2022-01-10 06:05:23,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:23,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197725472] [2022-01-10 06:05:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:05:23,154 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:23,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:23,155 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:05:23,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:05:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:05:23,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 06:05:23,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:23,318 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:05:23,337 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 06:05:23,350 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:05:23,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-01-10 06:05:23,359 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:05:23,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-01-10 06:05:23,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:23,470 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 30 treesize of output 25 [2022-01-10 06:05:23,489 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:05:23,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-01-10 06:05:23,514 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 24 treesize of output 12 [2022-01-10 06:05:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:23,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:23,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_353 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_353) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-01-10 06:05:23,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (_ BitVec 64)) (v_ArrVal_353 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_352))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_353)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-01-10 06:05:23,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (_ BitVec 64)) (v_ArrVal_353 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 64) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_352))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| .cse0) (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_353)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-01-10 06:05:23,644 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:23,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 48 [2022-01-10 06:05:23,657 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:23,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 119 [2022-01-10 06:05:23,663 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 133 treesize of output 127 [2022-01-10 06:05:23,674 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 127 treesize of output 123 [2022-01-10 06:05:23,725 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 24 treesize of output 22 [2022-01-10 06:05:23,758 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:23,758 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 94 treesize of output 90 [2022-01-10 06:05:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 06:05:23,854 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:23,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197725472] [2022-01-10 06:05:23,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197725472] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:05:23,855 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:05:23,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2022-01-10 06:05:23,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631271529] [2022-01-10 06:05:23,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:05:23,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 06:05:23,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:05:23,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 06:05:23,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=69, Unknown=3, NotChecked=54, Total=156 [2022-01-10 06:05:23,856 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:05:24,337 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-01-10 06:05:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:05:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 06:05:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:05:24,338 INFO L225 Difference]: With dead ends: 94 [2022-01-10 06:05:24,338 INFO L226 Difference]: Without dead ends: 83 [2022-01-10 06:05:24,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=118, Unknown=3, NotChecked=72, Total=240 [2022-01-10 06:05:24,339 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:05:24,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 120 Invalid, 0 Unknown, 204 Unchecked, 0.4s Time] [2022-01-10 06:05:24,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-01-10 06:05:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2022-01-10 06:05:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 73 transitions. [2022-01-10 06:05:24,346 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 73 transitions. Word has length 19 [2022-01-10 06:05:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:05:24,346 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 73 transitions. [2022-01-10 06:05:24,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:05:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 73 transitions. [2022-01-10 06:05:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 06:05:24,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:05:24,346 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:05:24,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:05:24,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:24,551 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:05:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:05:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1841142266, now seen corresponding path program 3 times [2022-01-10 06:05:24,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:05:24,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504787539] [2022-01-10 06:05:24,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 06:05:24,552 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:05:24,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:05:24,553 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:05:24,556 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:05:24,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 06:05:24,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:05:24,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-10 06:05:24,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:05:24,764 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:05:24,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:24,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:24,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2022-01-10 06:05:24,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:24,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:05:24,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-01-10 06:05:24,875 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:05:24,876 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 15 treesize of output 15 [2022-01-10 06:05:24,959 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:05:24,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 49 [2022-01-10 06:05:24,965 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 38 treesize of output 30 [2022-01-10 06:05:24,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-01-10 06:05:24,972 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 24 treesize of output 18 [2022-01-10 06:05:24,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 15 treesize of output 7 [2022-01-10 06:05:25,001 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:05:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:05:25,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:05:25,053 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_427 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_427) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_428 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_428) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv0 64)))) is different from false [2022-01-10 06:05:25,065 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_428 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_428) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 64))) (forall ((v_ArrVal_427 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_427) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-01-10 06:05:25,849 INFO L353 Elim1Store]: treesize reduction 142, result has 37.7 percent of original size [2022-01-10 06:05:25,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 11661 treesize of output 9827 [2022-01-10 06:05:26,743 INFO L353 Elim1Store]: treesize reduction 142, result has 37.7 percent of original size [2022-01-10 06:05:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 92323 treesize of output 61688 [2022-01-10 06:05:35,296 WARN L228 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 582 DAG size of output: 326 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-10 06:05:35,300 INFO L353 Elim1Store]: treesize reduction 958, result has 45.6 percent of original size [2022-01-10 06:05:35,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 73976 treesize of output 70665 [2022-01-10 06:05:45,293 WARN L228 SmtUtils]: Spent 9.61s on a formula simplification. DAG size of input: 582 DAG size of output: 326 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-10 06:05:45,296 INFO L353 Elim1Store]: treesize reduction 958, result has 45.6 percent of original size [2022-01-10 06:05:45,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 82953 treesize of output 79642 [2022-01-10 06:05:49,927 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:49,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 77645 treesize of output 75646 [2022-01-10 06:05:50,925 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:05:50,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 75597 treesize of output 73598 [2022-01-10 06:05:51,578 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:05:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504787539] [2022-01-10 06:05:51,578 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-10 06:05:51,591 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:05:51,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:05:51,787 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 06:05:51,790 INFO L158 Benchmark]: Toolchain (without parser) took 38621.76ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 138.7MB in the beginning and 229.6MB in the end (delta: -90.9MB). Peak memory consumption was 179.6MB. Max. memory is 8.0GB. [2022-01-10 06:05:51,790 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:05:51,790 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.68ms. Allocated memory is still 190.8MB. Free memory was 138.6MB in the beginning and 158.4MB in the end (delta: -19.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 06:05:51,790 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.09ms. Allocated memory is still 190.8MB. Free memory was 158.4MB in the beginning and 156.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:05:51,790 INFO L158 Benchmark]: Boogie Preprocessor took 35.07ms. Allocated memory is still 190.8MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:05:51,790 INFO L158 Benchmark]: RCFGBuilder took 395.46ms. Allocated memory is still 190.8MB. Free memory was 154.2MB in the beginning and 138.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-10 06:05:51,791 INFO L158 Benchmark]: TraceAbstraction took 37836.71ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 137.5MB in the beginning and 229.6MB in the end (delta: -92.2MB). Peak memory consumption was 179.9MB. Max. memory is 8.0GB. [2022-01-10 06:05:51,791 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 156.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 310.68ms. Allocated memory is still 190.8MB. Free memory was 138.6MB in the beginning and 158.4MB in the end (delta: -19.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.09ms. Allocated memory is still 190.8MB. Free memory was 158.4MB in the beginning and 156.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.07ms. Allocated memory is still 190.8MB. Free memory was 156.3MB in the beginning and 154.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 395.46ms. Allocated memory is still 190.8MB. Free memory was 154.2MB in the beginning and 138.0MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 37836.71ms. Allocated memory was 190.8MB in the beginning and 331.4MB in the end (delta: 140.5MB). Free memory was 137.5MB in the beginning and 229.6MB in the end (delta: -92.2MB). Peak memory consumption was 179.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 06:05:51,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...