/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:51:30,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:51:30,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:51:30,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:51:30,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:51:30,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:51:30,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:51:30,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:51:30,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:51:30,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:51:30,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:51:30,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:51:30,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:51:30,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:51:30,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:51:30,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:51:30,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:51:30,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:51:30,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:51:30,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:51:30,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:51:30,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:51:30,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:51:30,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:51:30,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:51:30,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:51:30,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:51:30,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:51:30,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:51:30,599 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:51:30,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:51:30,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:51:30,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:51:30,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:51:30,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:51:30,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:51:30,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:51:30,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:51:30,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:51:30,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:51:30,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:51:30,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:51:30,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:51:30,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:51:30,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:51:30,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:51:30,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:51:30,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:51:30,627 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:51:30,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:51:30,628 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:51:30,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:51:30,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:51:30,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:51:30,630 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:51:30,630 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:51:30,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:51:30,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:51:30,630 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:51:30,630 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:51:30,630 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:51:30,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:51:30,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:51:30,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:51:30,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:51:30,851 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:51:30,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2022-01-10 17:51:30,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdd17996/b9b9657f829f4069b90e90f3f3a44562/FLAG9238c8829 [2022-01-10 17:51:31,294 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:51:31,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_circular_traversal-2.i [2022-01-10 17:51:31,312 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdd17996/b9b9657f829f4069b90e90f3f3a44562/FLAG9238c8829 [2022-01-10 17:51:31,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdd17996/b9b9657f829f4069b90e90f3f3a44562 [2022-01-10 17:51:31,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:51:31,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:51:31,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:51:31,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:51:31,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:51:31,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:51:31" (1/1) ... [2022-01-10 17:51:31,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baa9dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:31, skipping insertion in model container [2022-01-10 17:51:31,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:51:31" (1/1) ... [2022-01-10 17:51:31,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:51:31,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:51:32,006 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2022-01-10 17:51:32,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:51:32,019 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:51:32,052 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-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2022-01-10 17:51:32,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:51:32,079 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:51:32,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32 WrapperNode [2022-01-10 17:51:32,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:51:32,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:51:32,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:51:32,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:51:32,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,130 INFO L137 Inliner]: procedures = 125, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 99 [2022-01-10 17:51:32,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:51:32,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:51:32,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:51:32,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:51:32,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:51:32,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:51:32,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:51:32,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:51:32,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,181 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:51:32,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:32,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:51:32,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:51:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:51:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:51:32,299 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:51:32,300 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:51:32,527 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:51:32,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:51:32,531 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 17:51:32,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:51:32 BoogieIcfgContainer [2022-01-10 17:51:32,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:51:32,540 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:51:32,540 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:51:32,542 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:51:32,545 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:51:32" (1/1) ... [2022-01-10 17:51:32,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:51:32 BasicIcfg [2022-01-10 17:51:32,627 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:51:32,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:51:32,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:51:32,641 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:51:32,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:51:31" (1/4) ... [2022-01-10 17:51:32,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fda5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:51:32, skipping insertion in model container [2022-01-10 17:51:32,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:51:32" (2/4) ... [2022-01-10 17:51:32,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fda5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:51:32, skipping insertion in model container [2022-01-10 17:51:32,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:51:32" (3/4) ... [2022-01-10 17:51:32,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fda5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:51:32, skipping insertion in model container [2022-01-10 17:51:32,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:51:32" (4/4) ... [2022-01-10 17:51:32,643 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.iTransformedIcfg [2022-01-10 17:51:32,647 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:51:32,647 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:51:32,676 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:51:32,681 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:51:32,681 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:51:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:32,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 17:51:32,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:32,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:32,695 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1413179187, now seen corresponding path program 1 times [2022-01-10 17:51:32,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:32,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787623451] [2022-01-10 17:51:32,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:32,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:32,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787623451] [2022-01-10 17:51:32,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787623451] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:51:32,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:51:32,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:51:32,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251422559] [2022-01-10 17:51:32,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:51:32,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:51:32,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:32,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:51:32,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:51:32,867 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:32,879 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-01-10 17:51:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:51:32,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-01-10 17:51:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:32,885 INFO L225 Difference]: With dead ends: 39 [2022-01-10 17:51:32,885 INFO L226 Difference]: Without dead ends: 18 [2022-01-10 17:51:32,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:51:32,889 INFO L933 BasicCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:32,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:51:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-10 17:51:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-10 17:51:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-01-10 17:51:32,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2022-01-10 17:51:32,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:32,909 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-01-10 17:51:32,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-01-10 17:51:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 17:51:32,910 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:32,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:32,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:51:32,910 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1384550036, now seen corresponding path program 1 times [2022-01-10 17:51:32,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:32,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214412486] [2022-01-10 17:51:32,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:32,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:33,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:33,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:33,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214412486] [2022-01-10 17:51:33,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214412486] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:51:33,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:51:33,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:51:33,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630496019] [2022-01-10 17:51:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:51:33,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:51:33,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:51:33,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:51:33,029 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:33,067 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-01-10 17:51:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:51:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-01-10 17:51:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:33,069 INFO L225 Difference]: With dead ends: 32 [2022-01-10 17:51:33,069 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 17:51:33,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:51:33,070 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:33,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:51:33,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 17:51:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-01-10 17:51:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 17:51:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-01-10 17:51:33,074 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2022-01-10 17:51:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:33,075 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-01-10 17:51:33,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:33,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-01-10 17:51:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 17:51:33,077 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:33,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:33,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:51:33,078 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:33,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:33,079 INFO L85 PathProgramCache]: Analyzing trace with hash 657429279, now seen corresponding path program 1 times [2022-01-10 17:51:33,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:33,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5013397] [2022-01-10 17:51:33,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:33,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:33,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:33,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5013397] [2022-01-10 17:51:33,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5013397] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:33,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297691109] [2022-01-10 17:51:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:33,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:33,291 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:33,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:51:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:33,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 40 conjunts are in the unsatisfiable core [2022-01-10 17:51:33,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:33,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:51:33,612 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:51:33,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2022-01-10 17:51:33,669 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 17:51:33,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:51:33,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:33,741 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 22 treesize of output 19 [2022-01-10 17:51:33,746 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 18 [2022-01-10 17:51:33,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:51:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:33,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:33,874 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_173 (Array Int Int)) (v_ArrVal_175 Int)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int| (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_173) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_175) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))) is different from false [2022-01-10 17:51:33,888 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:33,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-10 17:51:33,892 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 88 treesize of output 84 [2022-01-10 17:51:33,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:33,897 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 64 treesize of output 60 [2022-01-10 17:51:33,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:33,903 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 30 treesize of output 26 [2022-01-10 17:51:33,908 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 43 treesize of output 41 [2022-01-10 17:51:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 17:51:34,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297691109] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:34,111 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:34,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 9, 9] total 18 [2022-01-10 17:51:34,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118121266] [2022-01-10 17:51:34,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:34,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 17:51:34,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:34,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 17:51:34,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2022-01-10 17:51:34,113 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 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 17:51:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:34,369 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-01-10 17:51:34,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:51:34,370 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 17:51:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:34,370 INFO L225 Difference]: With dead ends: 33 [2022-01-10 17:51:34,370 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 17:51:34,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=349, Unknown=1, NotChecked=38, Total=462 [2022-01-10 17:51:34,372 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:34,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-01-10 17:51:34,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 17:51:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 17:51:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-01-10 17:51:34,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 13 [2022-01-10 17:51:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:34,375 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-01-10 17:51:34,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 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 17:51:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-01-10 17:51:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 17:51:34,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:34,376 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:34,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:34,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:34,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -653578100, now seen corresponding path program 2 times [2022-01-10 17:51:34,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:34,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39359632] [2022-01-10 17:51:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:34,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:34,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:34,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39359632] [2022-01-10 17:51:34,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39359632] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:34,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645165472] [2022-01-10 17:51:34,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:51:34,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:34,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:34,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:51:35,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:51:35,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:51:35,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-10 17:51:35,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:35,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:51:35,126 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:51:35,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 17:51:35,226 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 17:51:35,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 17:51:35,289 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 17:51:35,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:51:35,341 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 43 treesize of output 29 [2022-01-10 17:51:35,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:51:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:35,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:35,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:35,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2022-01-10 17:51:35,486 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:35,486 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 210 treesize of output 208 [2022-01-10 17:51:35,491 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:35,492 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 194 treesize of output 186 [2022-01-10 17:51:36,352 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 417 treesize of output 403 [2022-01-10 17:51:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:36,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645165472] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:51:36,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:51:36,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 21 [2022-01-10 17:51:36,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959356603] [2022-01-10 17:51:36,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:51:36,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 17:51:36,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:51:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 17:51:36,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-01-10 17:51:36,980 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:51:37,528 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-01-10 17:51:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 17:51:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 17:51:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:51:37,529 INFO L225 Difference]: With dead ends: 44 [2022-01-10 17:51:37,530 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 17:51:37,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=861, Unknown=0, NotChecked=0, Total=1056 [2022-01-10 17:51:37,531 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 38 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:51:37,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 91 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 163 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-01-10 17:51:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 17:51:37,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-01-10 17:51:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 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 17:51:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-01-10 17:51:37,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 16 [2022-01-10 17:51:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:51:37,535 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-01-10 17:51:37,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:51:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-01-10 17:51:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 17:51:37,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:51:37,536 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:51:37,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:51:37,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-10 17:51:37,739 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:51:37,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:51:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -147820287, now seen corresponding path program 1 times [2022-01-10 17:51:37,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:51:37,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215327997] [2022-01-10 17:51:37,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:37,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:51:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:51:37,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:51:37,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215327997] [2022-01-10 17:51:37,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215327997] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:51:37,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853242389] [2022-01-10 17:51:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:51:37,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:51:37,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:51:37,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:51:37,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:51:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:51:38,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 110 conjunts are in the unsatisfiable core [2022-01-10 17:51:38,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:51:38,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:51:38,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:51:38,509 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:51:38,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 17:51:38,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-01-10 17:51:38,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:38,596 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 26 treesize of output 23 [2022-01-10 17:51:38,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:38,601 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 17:51:38,664 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-10 17:51:38,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 38 [2022-01-10 17:51:38,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2022-01-10 17:51:38,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-01-10 17:51:38,790 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 5 treesize of output 3 [2022-01-10 17:51:38,916 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 17:51:38,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 17:51:39,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:39,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 17:51:39,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:39,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-01-10 17:51:39,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:39,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-01-10 17:51:39,037 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:51:39,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 66 [2022-01-10 17:51:39,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 22 treesize of output 34 [2022-01-10 17:51:39,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-01-10 17:51:39,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:39,143 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 22 treesize of output 19 [2022-01-10 17:51:39,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:39,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-01-10 17:51:39,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:51:39,159 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 42 treesize of output 35 [2022-01-10 17:51:39,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 30 [2022-01-10 17:51:39,169 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-01-10 17:51:39,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 18 [2022-01-10 17:51:39,315 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 65 treesize of output 51 [2022-01-10 17:51:39,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2022-01-10 17:51:39,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2022-01-10 17:51:39,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 43 treesize of output 33 [2022-01-10 17:51:39,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-01-10 17:51:39,409 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-10 17:51:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:51:39,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:51:39,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_570 Int) (v_ArrVal_568 Int)) (= (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~ptr~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~ptr~0#1.baseInt| v_ArrVal_567) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~ptr~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~ptr~0#1.offsetInt| v_ArrVal_568) .cse0)) (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~ptr~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~ptr~0#1.offsetInt| v_ArrVal_570) .cse0))) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|)) is different from false [2022-01-10 17:51:39,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_570 Int) (v_ArrVal_568 Int)) (= (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt| v_ArrVal_567) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| v_ArrVal_568) .cse0)) (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| v_ArrVal_570) .cse0))) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|)) is different from false [2022-01-10 17:51:39,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (v_ArrVal_570 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_568 Int)) (= (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616)) (.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_557)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_567) (select (store (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_559) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| v_ArrVal_568) .cse1)) (select (store (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_562) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| v_ArrVal_570) .cse1))) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|)) is different from false [2022-01-10 17:51:39,543 INFO L353 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2022-01-10 17:51:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 142 [2022-01-10 17:51:39,549 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 496 treesize of output 492 [2022-01-10 17:51:39,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,553 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,555 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 462 treesize of output 450 [2022-01-10 17:51:39,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,568 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 214 treesize of output 208 [2022-01-10 17:51:39,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,579 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 226 treesize of output 214 [2022-01-10 17:51:39,605 INFO L353 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2022-01-10 17:51:39,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 418 treesize of output 378 [2022-01-10 17:51:39,611 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 2706 treesize of output 2688 [2022-01-10 17:51:39,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,671 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 2598 treesize of output 2550 [2022-01-10 17:51:39,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:51:39,686 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 2390 treesize of output 2294 [2022-01-10 17:51:39,713 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 4112 treesize of output 4058 [2022-01-10 17:51:52,433 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_61 Int) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_557 Int) (v_arrayElimCell_66 Int)) (let ((.cse4 (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|)) (.cse5 (store (let ((.cse6 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_ArrVal_547) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_ArrVal_548) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_550)))) (store .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_557))) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_ArrVal_567))) (let ((.cse3 (= |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int| (select (select .cse5 v_arrayElimCell_61) v_arrayElimCell_66))) (.cse1 (not .cse4)) (.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|))) (or (and .cse0 (or (and .cse1 (forall ((v_arrayElimCell_62 Int) (v_arrayElimCell_65 Int)) (= (select (select (store (let ((.cse2 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_ArrVal_547) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_ArrVal_548) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_550)))) (store .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_557))) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_ArrVal_567) v_arrayElimCell_62) v_arrayElimCell_65) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|))) (and .cse3 .cse4))) (and (or .cse3 .cse1) (not .cse0) (or .cse4 (= (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|))))))) is different from false [2022-01-10 17:51:52,951 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:52,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 76 [2022-01-10 17:51:53,127 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:53,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 405 treesize of output 363 [2022-01-10 17:51:56,416 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:56,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:51:56,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:56,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:51:59,693 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:59,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:51:59,888 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:51:59,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:01,575 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:01,576 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:01,734 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:01,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:03,420 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:03,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:03,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:03,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:04,549 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:04,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:05,173 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:05,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:05,227 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:05,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:05,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:05,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:05,712 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:05,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:09,754 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:09,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:09,932 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:09,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:11,625 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:11,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:11,786 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:11,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:13,322 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:13,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:13,492 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:13,492 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:14,778 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:14,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:15,338 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:15,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:15,382 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:15,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 91 [2022-01-10 17:52:15,792 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:15,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:15,823 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:15,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2022-01-10 17:52:17,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| Int) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| Int)) (let ((.cse0 (select (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| 1) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6|)) (.cse6 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~data#1Int| (select v_arrayElimArr_13 0))) (not (< .cse0 2)) (let ((.cse1 (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6|))) (and (or .cse1 (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_557 Int)) (= (select (select (store (let ((.cse2 (let ((.cse3 (store (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| v_arrayElimArr_13) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_542))) (store (store .cse3 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_547) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| (store (select (store .cse3 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_548) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 12 v_ArrVal_550))))) (store .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_557))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_567) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 0) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|))) (or (forall ((v_arrayElimCell_61 Int) (v_ArrVal_567 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_557 Int) (v_arrayElimCell_66 Int)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int| (select (select (store (let ((.cse4 (let ((.cse5 (store (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| v_arrayElimArr_13) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_542))) (store (store .cse5 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_547) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| (store (select (store .cse5 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_548) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 12 v_ArrVal_550))))) (store .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_557))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_567) v_arrayElimCell_61) v_arrayElimCell_66))) (not .cse1)))) (not (<= (mod .cse6 2) 0)) (not (<= (mod .cse0 2) 0)) (not (< .cse6 2))))) is different from false [2022-01-10 17:52:17,067 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:17,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 350 treesize of output 309 [2022-01-10 17:52:17,989 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_38 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| Int) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| Int)) (let ((.cse0 (select (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| 1) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6|)) (.cse1 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~data#1Int| (select v_arrayElimArr_13 0))) (not (< .cse0 2)) (not (<= (mod .cse1 2) 0)) (not (<= (mod .cse0 2) 0)) (not (< .cse1 2)) (let ((.cse2 (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6|))) (and (or .cse2 (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_534 Int)) (= (select (select (store (let ((.cse3 (let ((.cse4 (store (store (let ((.cse5 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_arrayElimArr_38))) (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_534))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| v_arrayElimArr_13) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_ArrVal_542))) (store (store .cse4 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_547) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| (store (select (store .cse4 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_548) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 12 v_ArrVal_550))))) (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_557))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_567) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 0) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|))) (or (not .cse2) (forall ((v_arrayElimCell_61 Int) (v_prenex_76 (Array Int Int)) (v_prenex_78 Int) (v_prenex_75 (Array Int Int)) (v_prenex_79 (Array Int Int)) (v_prenex_77 (Array Int Int)) (v_prenex_80 Int) (v_ArrVal_534 Int) (v_arrayElimCell_66 Int)) (= (select (select (store (let ((.cse6 (let ((.cse7 (store (store (let ((.cse8 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_arrayElimArr_38))) (store .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (store (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_534))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| v_arrayElimArr_13) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| v_prenex_79))) (store (store .cse7 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_prenex_77) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| (store (select (store .cse7 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_prenex_76) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 12 v_prenex_78))))) (store .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_prenex_80))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_prenex_75) v_arrayElimCell_61) v_arrayElimCell_66) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|))))) (not (= (select v_arrayElimArr_38 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~data#1Int|))))) is different from false [2022-01-10 17:52:19,659 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_38 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| Int) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_8| Int) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| Int)) (let ((.cse9 (store |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_8| 1))) (let ((.cse0 (select (store .cse9 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| 1) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6|)) (.cse8 (select .cse9 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|))) (or (not (= (select v_arrayElimArr_38 0) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~data#1Int|)) (not (< .cse0 2)) (let ((.cse1 (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6|))) (and (or .cse1 (forall ((v_ArrVal_567 (Array Int Int)) (v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_557 Int) (v_ArrVal_534 Int)) (= (select (select (store (let ((.cse2 (let ((.cse3 (store (store (let ((.cse4 (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_8| v_arrayElimArr_38))) (store .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (store (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_534))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| v_arrayElimArr_13) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_8| v_ArrVal_542))) (store (store .cse3 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_547) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| (store (select (store .cse3 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_548) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 12 v_ArrVal_550))))) (store .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_557))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_ArrVal_567) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 0) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|))) (or (not .cse1) (forall ((v_arrayElimCell_61 Int) (v_prenex_76 (Array Int Int)) (v_prenex_78 Int) (v_prenex_75 (Array Int Int)) (v_prenex_79 (Array Int Int)) (v_prenex_77 (Array Int Int)) (v_prenex_80 Int) (v_ArrVal_534 Int) (v_arrayElimCell_66 Int)) (= (select (select (store (let ((.cse5 (let ((.cse6 (store (store (let ((.cse7 (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_8| v_arrayElimArr_38))) (store .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (store (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 12) 18446744073709551616) v_ArrVal_534))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| v_arrayElimArr_13) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_8| v_prenex_79))) (store (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_prenex_77) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7| (store (select (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_prenex_76) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_7|) 12 v_prenex_78))))) (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.offsetInt| 4) 18446744073709551616) v_prenex_80))) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_6| v_prenex_75) v_arrayElimCell_61) v_arrayElimCell_66) |c_ULTIMATE.start_ULTIMATE.start_main_~data_init~0#1Int|))))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~data#1Int| (select v_arrayElimArr_13 0))) (not (< .cse8 2)) (not (<= (mod .cse0 2) 0)) (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt_8|) 2) 0)) (not (<= (mod .cse8 2) 0)))))) is different from false [2022-01-10 17:52:19,698 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:52:19,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 430 treesize of output 311 [2022-01-10 17:52:19,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:52:19,711 INFO L173 IndexEqualityManager]: detected equality via solver