/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:58:10,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:58:10,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:58:10,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:58:10,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:58:10,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:58:10,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:58:10,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:58:10,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:58:10,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:58:10,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:58:10,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:58:10,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:58:10,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:58:10,450 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:58:10,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:58:10,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:58:10,466 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:58:10,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:58:10,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:58:10,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:58:10,481 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:58:10,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:58:10,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:58:10,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:58:10,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:58:10,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:58:10,484 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:58:10,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:58:10,485 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:58:10,485 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:58:10,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:58:10,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:58:10,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:58:10,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:58:10,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:58:10,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:58:10,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:58:10,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:58:10,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:58:10,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:58:10,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:58:10,514 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:58:10,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:58:10,514 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:58:10,514 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:58:10,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:58:10,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:58:10,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:58:10,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:58:10,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:58:10,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:58:10,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:58:10,518 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:58:10,518 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:58:10,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:58:10,518 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:58:10,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:58:10,519 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:58:10,519 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 11:58:10,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:58:10,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:58:10,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:58:10,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:58:10,727 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:58:10,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_equal.i [2022-01-10 11:58:10,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea291ac5/33b0b50b1513410ab591614989fb1853/FLAGc03c2278c [2022-01-10 11:58:11,208 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:58:11,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_equal.i [2022-01-10 11:58:11,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea291ac5/33b0b50b1513410ab591614989fb1853/FLAGc03c2278c [2022-01-10 11:58:11,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea291ac5/33b0b50b1513410ab591614989fb1853 [2022-01-10 11:58:11,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:58:11,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:58:11,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:58:11,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:58:11,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:58:11,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d74dccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11, skipping insertion in model container [2022-01-10 11:58:11,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:58:11,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:58:11,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_equal.i[24333,24346] [2022-01-10 11:58:11,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:58:11,524 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:58:11,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_equal.i[24333,24346] [2022-01-10 11:58:11,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:58:11,584 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:58:11,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11 WrapperNode [2022-01-10 11:58:11,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:58:11,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:58:11,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:58:11,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:58:11,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,628 INFO L137 Inliner]: procedures = 130, calls = 37, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 137 [2022-01-10 11:58:11,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:58:11,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:58:11,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:58:11,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:58:11,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,652 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:58:11,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:58:11,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:58:11,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:58:11,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (1/1) ... [2022-01-10 11:58:11,670 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:58:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:58:11,695 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 11:58:11,708 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 11:58:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 11:58:11,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:58:11,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:58:11,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:58:11,847 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:58:11,848 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:58:12,180 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:58:12,189 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:58:12,189 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 11:58:12,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:58:12 BoogieIcfgContainer [2022-01-10 11:58:12,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:58:12,192 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:58:12,192 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:58:12,194 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:58:12,196 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:58:12" (1/1) ... [2022-01-10 11:58:12,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:58:12 BasicIcfg [2022-01-10 11:58:12,301 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:58:12,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:58:12,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:58:12,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:58:12,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:58:11" (1/4) ... [2022-01-10 11:58:12,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31676130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:58:12, skipping insertion in model container [2022-01-10 11:58:12,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:58:11" (2/4) ... [2022-01-10 11:58:12,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31676130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:58:12, skipping insertion in model container [2022-01-10 11:58:12,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:58:12" (3/4) ... [2022-01-10 11:58:12,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31676130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:58:12, skipping insertion in model container [2022-01-10 11:58:12,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:58:12" (4/4) ... [2022-01-10 11:58:12,305 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_equal.iTransformedIcfg [2022-01-10 11:58:12,309 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:58:12,309 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 11:58:12,357 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:58:12,363 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 11:58:12,364 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 11:58:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 11:58:12,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:12,378 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:12,379 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:12,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash 117946877, now seen corresponding path program 1 times [2022-01-10 11:58:12,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:12,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987489245] [2022-01-10 11:58:12,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:12,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:12,620 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 11:58:12,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:12,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987489245] [2022-01-10 11:58:12,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987489245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:12,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:12,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:58:12,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194039298] [2022-01-10 11:58:12,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:12,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:58:12,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:12,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:58:12,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:58:12,653 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:12,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:12,666 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2022-01-10 11:58:12,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:58:12,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 11:58:12,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:12,675 INFO L225 Difference]: With dead ends: 51 [2022-01-10 11:58:12,675 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 11:58:12,686 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:58:12,689 INFO L933 BasicCegarLoop]: 38 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, 38 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 11:58:12,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:12,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 11:58:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-10 11:58:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-01-10 11:58:12,716 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2022-01-10 11:58:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:12,717 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-01-10 11:58:12,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-01-10 11:58:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 11:58:12,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:12,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:12,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:58:12,719 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:12,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:12,721 INFO L85 PathProgramCache]: Analyzing trace with hash 117947838, now seen corresponding path program 1 times [2022-01-10 11:58:12,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:12,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914180909] [2022-01-10 11:58:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:12,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:13,036 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 11:58:13,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:13,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914180909] [2022-01-10 11:58:13,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914180909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:13,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:13,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 11:58:13,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364612702] [2022-01-10 11:58:13,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:13,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 11:58:13,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:13,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 11:58:13,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-10 11:58:13,041 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:13,224 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-01-10 11:58:13,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 11:58:13,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 11:58:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:13,225 INFO L225 Difference]: With dead ends: 36 [2022-01-10 11:58:13,225 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 11:58:13,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-10 11:58:13,226 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 119 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:13,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 72 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:58:13,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 11:58:13,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2022-01-10 11:58:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-01-10 11:58:13,258 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 13 [2022-01-10 11:58:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:13,258 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-01-10 11:58:13,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-01-10 11:58:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 11:58:13,259 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:13,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:13,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:58:13,259 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:13,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash 117948861, now seen corresponding path program 1 times [2022-01-10 11:58:13,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:13,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004680516] [2022-01-10 11:58:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:13,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:13,356 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 11:58:13,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:13,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004680516] [2022-01-10 11:58:13,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004680516] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:13,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:13,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:58:13,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274268577] [2022-01-10 11:58:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:13,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:58:13,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:58:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:58:13,360 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:13,376 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-01-10 11:58:13,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:58:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 11:58:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:13,379 INFO L225 Difference]: With dead ends: 48 [2022-01-10 11:58:13,379 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 11:58:13,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:58:13,383 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:13,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 11:58:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-01-10 11:58:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 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 11:58:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-10 11:58:13,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 13 [2022-01-10 11:58:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:13,393 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-10 11:58:13,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-10 11:58:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:58:13,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:13,394 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 11:58:13,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:58:13,395 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1049059020, now seen corresponding path program 1 times [2022-01-10 11:58:13,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:13,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079983059] [2022-01-10 11:58:13,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:13,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:13,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:58:13,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:13,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079983059] [2022-01-10 11:58:13,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079983059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:13,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:13,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:58:13,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189343475] [2022-01-10 11:58:13,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:13,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:58:13,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:13,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:58:13,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:58:13,481 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:13,497 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-01-10 11:58:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:58:13,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 11:58:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:13,498 INFO L225 Difference]: With dead ends: 54 [2022-01-10 11:58:13,498 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 11:58:13,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:58:13,500 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:13,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:13,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 11:58:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-10 11:58:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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 11:58:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-01-10 11:58:13,506 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-01-10 11:58:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:13,506 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-01-10 11:58:13,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-01-10 11:58:13,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:58:13,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:13,507 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 11:58:13,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:58:13,508 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:13,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1342462027, now seen corresponding path program 1 times [2022-01-10 11:58:13,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:13,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634585129] [2022-01-10 11:58:13,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:13,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:58:13,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:13,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634585129] [2022-01-10 11:58:13,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634585129] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:13,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:13,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-10 11:58:13,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236470118] [2022-01-10 11:58:13,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:13,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 11:58:13,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:13,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 11:58:13,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-01-10 11:58:13,778 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:14,138 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2022-01-10 11:58:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 11:58:14,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 11:58:14,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:14,140 INFO L225 Difference]: With dead ends: 52 [2022-01-10 11:58:14,140 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 11:58:14,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-01-10 11:58:14,141 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:14,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 22 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:58:14,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 11:58:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-01-10 11:58:14,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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 11:58:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-10 11:58:14,146 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 19 [2022-01-10 11:58:14,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:14,146 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-10 11:58:14,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-10 11:58:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:58:14,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:14,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:14,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 11:58:14,147 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:14,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash 724452029, now seen corresponding path program 1 times [2022-01-10 11:58:14,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:14,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588881749] [2022-01-10 11:58:14,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:14,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:14,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:58:14,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:14,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588881749] [2022-01-10 11:58:14,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588881749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:58:14,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:58:14,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-10 11:58:14,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804084340] [2022-01-10 11:58:14,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:58:14,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 11:58:14,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 11:58:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-01-10 11:58:14,472 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:15,023 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-01-10 11:58:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 11:58:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 11:58:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:15,026 INFO L225 Difference]: With dead ends: 36 [2022-01-10 11:58:15,026 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 11:58:15,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-01-10 11:58:15,027 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:15,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 31 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 11:58:15,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 11:58:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-01-10 11:58:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 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 11:58:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-01-10 11:58:15,033 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2022-01-10 11:58:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:15,034 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-01-10 11:58:15,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-01-10 11:58:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:58:15,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:15,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:15,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 11:58:15,035 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash 724453052, now seen corresponding path program 1 times [2022-01-10 11:58:15,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:15,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689317085] [2022-01-10 11:58:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:15,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:15,106 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 11:58:15,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689317085] [2022-01-10 11:58:15,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689317085] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:58:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970425955] [2022-01-10 11:58:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:15,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:58:15,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:58:15,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:58:15,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 11:58:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:15,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 90 conjunts are in the unsatisfiable core [2022-01-10 11:58:15,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:58:15,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-10 11:58:15,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:15,687 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 18 treesize of output 19 [2022-01-10 11:58:15,969 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 11:58:15,970 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 17 treesize of output 17 [2022-01-10 11:58:16,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:16,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-01-10 11:58:16,105 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 18 treesize of output 20 [2022-01-10 11:58:16,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:16,112 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 14 treesize of output 16 [2022-01-10 11:58:16,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:16,556 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:16,557 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 89 [2022-01-10 11:58:16,593 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:58:16,594 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 144 [2022-01-10 11:58:16,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:16,603 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2022-01-10 11:58:16,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:16,624 INFO L353 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-01-10 11:58:16,624 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 108 [2022-01-10 11:58:16,631 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 34 treesize of output 36 [2022-01-10 11:58:16,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:16,716 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:16,716 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 32 [2022-01-10 11:58:16,723 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 22 treesize of output 10 [2022-01-10 11:58:16,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:58:16,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 11:58:16,804 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 11:58:16,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:58:16,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| v_ArrVal_375) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_378) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (let ((.cse1 (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.offsetInt|) 18446744073709551616))) (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse1 v_ArrVal_376)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_380) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_377) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) .cse0))))) is different from false [2022-01-10 11:58:17,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_376 Int) (v_ArrVal_380 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_375 (Array Int Int)) (v_ArrVal_377 (Array Int Int)) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_372)) (.cse8 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_369))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.offsetInt|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.offsetInt|))) (let ((.cse5 (select .cse4 .cse2)) (.cse3 (mod (+ .cse7 4) 18446744073709551616))) (let ((.cse6 (select (select (store (store .cse8 .cse2 v_ArrVal_375) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_378) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse0 (select .cse5 .cse3))) (or (< 0 .cse0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_368))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_376))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_380) (select (select (store (store .cse4 .cse2 (store .cse5 .cse3 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_377) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse6)) (not (<= 0 .cse6)) (< .cse7 0) (< .cse0 0))))))) is different from false [2022-01-10 11:58:17,480 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:17,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 5748 treesize of output 5356 [2022-01-10 11:58:17,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:17,534 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 5718 treesize of output 5461 [2022-01-10 11:58:17,599 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 395033 treesize of output 373853 [2022-01-10 11:58:18,507 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 373842 treesize of output 363254 [2022-01-10 11:58:19,319 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 363028 treesize of output 358852 [2022-01-10 11:58:20,036 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 357354 treesize of output 349674 [2022-01-10 11:58:20,910 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 351172 treesize of output 342820 [2022-01-10 11:58:36,486 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 11:58:36,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:58:36,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2022-01-10 11:58:36,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726555890] [2022-01-10 11:58:36,487 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 11:58:36,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:58:36,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:58:36,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:58:36,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=581, Unknown=2, NotChecked=98, Total=756 [2022-01-10 11:58:36,488 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:58:36,521 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-10 11:58:36,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:58:36,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 11:58:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:58:36,522 INFO L225 Difference]: With dead ends: 47 [2022-01-10 11:58:36,522 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 11:58:36,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=581, Unknown=2, NotChecked=98, Total=756 [2022-01-10 11:58:36,523 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:58:36,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:58:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 11:58:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 11:58:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-01-10 11:58:36,527 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-01-10 11:58:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:58:36,527 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-01-10 11:58:36,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:58:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-01-10 11:58:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 11:58:36,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:58:36,528 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:58:36,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 11:58:36,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:58:36,744 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:58:36,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:58:36,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1533000165, now seen corresponding path program 1 times [2022-01-10 11:58:36,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:58:36,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496681673] [2022-01-10 11:58:36,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:36,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:58:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:58:37,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:58:37,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496681673] [2022-01-10 11:58:37,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496681673] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:58:37,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752990862] [2022-01-10 11:58:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:58:37,851 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:58:37,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:58:37,852 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:58:37,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 11:58:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:58:38,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 98 conjunts are in the unsatisfiable core [2022-01-10 11:58:38,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:58:38,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-01-10 11:58:38,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:38,544 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 18 treesize of output 19 [2022-01-10 11:58:38,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:38,610 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 23 treesize of output 22 [2022-01-10 11:58:38,843 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 11:58:38,843 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 17 treesize of output 17 [2022-01-10 11:58:38,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:38,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-01-10 11:58:38,974 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 18 treesize of output 20 [2022-01-10 11:58:39,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:39,008 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 14 treesize of output 16 [2022-01-10 11:58:39,555 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 11:58:39,555 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 92 [2022-01-10 11:58:39,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:39,572 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 95 treesize of output 87 [2022-01-10 11:58:39,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:39,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-01-10 11:58:39,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:58:39,602 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:39,603 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 55 [2022-01-10 11:58:39,627 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-01-10 11:58:39,628 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 3 case distinctions, treesize of input 102 treesize of output 102 [2022-01-10 11:58:39,634 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 28 treesize of output 30 [2022-01-10 11:58:39,652 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 34 treesize of output 14 [2022-01-10 11:58:39,727 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 36 treesize of output 20 [2022-01-10 11:58:39,730 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 22 treesize of output 10 [2022-01-10 11:58:39,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:58:39,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 11:58:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:58:39,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:58:39,906 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_582 Int) (v_ArrVal_591 Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse1 (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.offsetInt|) 18446744073709551616))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse1 v_ArrVal_582)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse1 v_ArrVal_591)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_589) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_583) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse0)))))) is different from false [2022-01-10 11:58:40,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_582 Int) (v_ArrVal_591 Int) (|ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|)) (.cse2 (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.offsetInt|) 4) 18446744073709551616))) (let ((.cse0 (select .cse3 .cse2)) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse2 v_ArrVal_582)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)) (not (<= 0 .cse1)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse2 v_ArrVal_591)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_589) (select (select (store (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store .cse3 .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~new_last~0#1.baseInt| v_ArrVal_583) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse1)))))) is different from false [2022-01-10 11:58:40,313 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_589 (Array Int Int)) (v_ArrVal_582 Int) (v_ArrVal_591 Int) (v_ArrVal_581 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| Int) (v_ArrVal_583 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_578))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_append_~head#1.offsetInt|)) (.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_581))) (let ((.cse3 (select .cse2 |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|)) (.cse1 (mod (+ 4 .cse6) 18446744073709551616))) (let ((.cse4 (select (select (store (store .cse7 |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select .cse7 |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse1 v_ArrVal_582)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_587) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse5 (select .cse3 .cse1))) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_579))) (store .cse0 |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store (select .cse0 |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt|) .cse1 v_ArrVal_591))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_589) (select (select (store (store .cse2 |ULTIMATE.start_ULTIMATE.start_dll_append_~last~0#1.baseInt| (store .cse3 .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_583) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse4)) (not (<= 0 .cse5)) (not (<= 0 .cse4)) (not (<= 0 .cse6)) (not (<= .cse5 0)))))))) is different from false [2022-01-10 11:58:40,460 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:40,461 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 20135 treesize of output 19435 [2022-01-10 11:58:40,517 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 19944 treesize of output 19110 [2022-01-10 11:58:40,607 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:40,609 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 467242 treesize of output 462152 [2022-01-10 11:58:41,306 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:58:41,307 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 487042 treesize of output 481970 [2022-01-10 11:58:42,026 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 481806 treesize of output 471630 [2022-01-10 11:58:42,787 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 475526 treesize of output 464078