/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_SUM.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:29:21,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:29:21,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:29:21,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:29:21,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:29:21,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:29:21,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:29:21,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:29:21,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:29:21,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:29:21,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:29:21,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:29:21,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:29:21,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:29:21,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:29:21,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:29:21,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:29:21,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:29:21,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:29:21,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:29:21,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:29:21,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:29:21,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:29:21,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:29:21,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:29:21,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:29:21,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:29:21,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:29:21,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:29:21,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:29:21,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:29:21,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:29:21,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:29:21,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:29:21,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:29:21,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:29:21,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:29:21,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:29:21,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:29:21,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:29:21,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:29:21,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:29:21,499 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:29:21,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:29:21,500 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:29:21,500 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:29:21,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:29:21,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:29:21,501 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:29:21,501 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:29:21,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:29:21,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:29:21,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:29:21,505 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:29:21,505 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:29:21,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:29:21,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:29:21,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:29:21,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:29:21,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:29:21,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:29:21,507 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:29:21,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:29:21,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:29:21,508 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:29:21,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:29:21,510 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:29:21,510 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:29:21,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:29:21,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:29:21,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:29:21,757 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:29:21,767 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:29:21,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2022-01-11 05:29:21,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f3f8d2c/d2dce1c601614406b2ba585197dc4390/FLAG544809cc5 [2022-01-11 05:29:22,281 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:29:22,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2022-01-11 05:29:22,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f3f8d2c/d2dce1c601614406b2ba585197dc4390/FLAG544809cc5 [2022-01-11 05:29:22,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34f3f8d2c/d2dce1c601614406b2ba585197dc4390 [2022-01-11 05:29:22,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:29:22,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:29:22,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:29:22,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:29:22,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:29:22,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7796a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22, skipping insertion in model container [2022-01-11 05:29:22,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:29:22,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:29:22,643 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_nullified-2.i[23974,23987] [2022-01-11 05:29:22,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:29:22,661 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:29:22,709 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_nullified-2.i[23974,23987] [2022-01-11 05:29:22,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:29:22,732 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:29:22,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22 WrapperNode [2022-01-11 05:29:22,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:29:22,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:29:22,733 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:29:22,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:29:22,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,764 INFO L137 Inliner]: procedures = 125, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2022-01-11 05:29:22,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:29:22,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:29:22,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:29:22,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:29:22,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:29:22,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:29:22,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:29:22,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:29:22,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (1/1) ... [2022-01-11 05:29:22,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:29:22,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:22,822 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-11 05:29:22,833 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-11 05:29:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:29:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:29:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:29:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:29:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:29:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:29:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:29:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:29:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:29:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:29:22,910 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:29:22,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:29:23,324 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:29:23,328 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:29:23,328 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-11 05:29:23,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:29:23 BoogieIcfgContainer [2022-01-11 05:29:23,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:29:23,330 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:29:23,330 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:29:23,331 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:29:23,333 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:29:23" (1/1) ... [2022-01-11 05:29:23,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:29:23 BasicIcfg [2022-01-11 05:29:23,385 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:29:23,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:29:23,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:29:23,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:29:23,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:29:22" (1/4) ... [2022-01-11 05:29:23,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f1ab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:29:23, skipping insertion in model container [2022-01-11 05:29:23,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:29:22" (2/4) ... [2022-01-11 05:29:23,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f1ab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:29:23, skipping insertion in model container [2022-01-11 05:29:23,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:29:23" (3/4) ... [2022-01-11 05:29:23,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f1ab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:29:23, skipping insertion in model container [2022-01-11 05:29:23,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:29:23" (4/4) ... [2022-01-11 05:29:23,390 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.iTransformedIcfg [2022-01-11 05:29:23,394 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:29:23,394 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:29:23,433 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:29:23,439 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-11 05:29:23,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:29:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 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-11 05:29:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 05:29:23,454 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:23,455 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:23,456 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:23,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:23,459 INFO L85 PathProgramCache]: Analyzing trace with hash 680677268, now seen corresponding path program 1 times [2022-01-11 05:29:23,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:23,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462519258] [2022-01-11 05:29:23,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:23,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:23,608 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-11 05:29:23,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:23,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462519258] [2022-01-11 05:29:23,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462519258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:23,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:29:23,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:29:23,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221459918] [2022-01-11 05:29:23,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:23,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:29:23,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:29:23,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:29:23,639 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11 05:29:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:23,651 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2022-01-11 05:29:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:29:23,653 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-01-11 05:29:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:23,658 INFO L225 Difference]: With dead ends: 46 [2022-01-11 05:29:23,658 INFO L226 Difference]: Without dead ends: 22 [2022-01-11 05:29:23,660 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-11 05:29:23,667 INFO L933 BasicCegarLoop]: 36 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, 36 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-11 05:29:23,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:29:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-11 05:29:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-11 05:29:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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-11 05:29:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-01-11 05:29:23,693 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 12 [2022-01-11 05:29:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:23,694 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-01-11 05:29:23,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11 05:29:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-01-11 05:29:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 05:29:23,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:23,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:23,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:29:23,696 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:23,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1430804563, now seen corresponding path program 1 times [2022-01-11 05:29:23,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:23,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023802240] [2022-01-11 05:29:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:23,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:23,827 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-11 05:29:23,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:23,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023802240] [2022-01-11 05:29:23,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023802240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:23,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:29:23,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:29:23,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863687360] [2022-01-11 05:29:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:23,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:29:23,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:23,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:29:23,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:29:23,832 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11 05:29:23,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:23,850 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2022-01-11 05:29:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:29:23,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-01-11 05:29:23,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:23,852 INFO L225 Difference]: With dead ends: 42 [2022-01-11 05:29:23,852 INFO L226 Difference]: Without dead ends: 27 [2022-01-11 05:29:23,856 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-11 05:29:23,857 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 5 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 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-11 05:29:23,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:29:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-11 05:29:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-01-11 05:29:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-01-11 05:29:23,869 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-01-11 05:29:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:23,871 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-01-11 05:29:23,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11 05:29:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-01-11 05:29:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 05:29:23,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:23,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:23,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:29:23,876 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash -556248830, now seen corresponding path program 1 times [2022-01-11 05:29:23,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960676220] [2022-01-11 05:29:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:23,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:29:23,983 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:23,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960676220] [2022-01-11 05:29:23,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960676220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:23,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:29:23,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:29:23,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555870046] [2022-01-11 05:29:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:23,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:29:23,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:29:23,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:29:23,985 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11 05:29:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:24,066 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-01-11 05:29:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:29:24,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-01-11 05:29:24,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:24,067 INFO L225 Difference]: With dead ends: 47 [2022-01-11 05:29:24,067 INFO L226 Difference]: Without dead ends: 27 [2022-01-11 05:29:24,067 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-11 05:29:24,068 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:24,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:29:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-11 05:29:24,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-01-11 05:29:24,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-01-11 05:29:24,071 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-01-11 05:29:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:24,071 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-01-11 05:29:24,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-11 05:29:24,072 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-01-11 05:29:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 05:29:24,072 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:24,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:24,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:29:24,072 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:24,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:24,073 INFO L85 PathProgramCache]: Analyzing trace with hash -427166111, now seen corresponding path program 1 times [2022-01-11 05:29:24,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:24,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296925354] [2022-01-11 05:29:24,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:24,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:24,214 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-11 05:29:24,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:24,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296925354] [2022-01-11 05:29:24,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296925354] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:24,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741222331] [2022-01-11 05:29:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:24,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:24,225 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-11 05:29:24,226 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-11 05:29:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:24,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-11 05:29:24,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:24,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:24,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2022-01-11 05:29:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:29:24,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 05:29:24,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741222331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:24,712 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:29:24,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2022-01-11 05:29:24,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473068769] [2022-01-11 05:29:24,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:24,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 05:29:24,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 05:29:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:29:24,714 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-11 05:29:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:25,261 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-01-11 05:29:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:29:25,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 17 [2022-01-11 05:29:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:25,262 INFO L225 Difference]: With dead ends: 53 [2022-01-11 05:29:25,262 INFO L226 Difference]: Without dead ends: 40 [2022-01-11 05:29:25,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-11 05:29:25,264 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 169 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:25,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 47 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 05:29:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-11 05:29:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2022-01-11 05:29:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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-11 05:29:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2022-01-11 05:29:25,272 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 17 [2022-01-11 05:29:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:25,272 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2022-01-11 05:29:25,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-11 05:29:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-01-11 05:29:25,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 05:29:25,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:25,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:25,293 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-11 05:29:25,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:25,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash -426242590, now seen corresponding path program 1 times [2022-01-11 05:29:25,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:25,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949835167] [2022-01-11 05:29:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:25,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:25,569 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-11 05:29:25,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:25,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949835167] [2022-01-11 05:29:25,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949835167] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:25,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565441833] [2022-01-11 05:29:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:25,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:25,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:25,587 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-11 05:29:25,588 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-11 05:29:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:25,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-11 05:29:25,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:25,781 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-11 05:29:25,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:29:25,940 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-11 05:29:25,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565441833] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:29:25,941 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:29:25,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-11 05:29:25,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43050344] [2022-01-11 05:29:25,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:29:25,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 05:29:25,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 05:29:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:29:25,943 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11 05:29:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:26,024 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-01-11 05:29:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:29:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 17 [2022-01-11 05:29:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:26,025 INFO L225 Difference]: With dead ends: 59 [2022-01-11 05:29:26,025 INFO L226 Difference]: Without dead ends: 41 [2022-01-11 05:29:26,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:29:26,026 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:26,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 91 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:29:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-11 05:29:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-11 05:29:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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-11 05:29:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-01-11 05:29:26,032 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 17 [2022-01-11 05:29:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:26,032 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-01-11 05:29:26,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11 05:29:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-01-11 05:29:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-11 05:29:26,033 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:26,033 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:26,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-11 05:29:26,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:26,254 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash -854953131, now seen corresponding path program 1 times [2022-01-11 05:29:26,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:26,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487743137] [2022-01-11 05:29:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:26,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:29:26,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:26,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487743137] [2022-01-11 05:29:26,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487743137] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:26,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990393085] [2022-01-11 05:29:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:26,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:26,499 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-11 05:29:26,502 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-11 05:29:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:28,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-11 05:29:28,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:28,551 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-11 05:29:28,588 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:29:28,588 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-11 05:29:28,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:28,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2022-01-11 05:29:28,671 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 29 treesize of output 29 [2022-01-11 05:29:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 05:29:28,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:29:29,083 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_410) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 12) 18446744073709551616)) 0)) is different from false [2022-01-11 05:29:29,301 INFO L353 Elim1Store]: treesize reduction 412, result has 12.2 percent of original size [2022-01-11 05:29:29,301 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 5 case distinctions, treesize of input 50 treesize of output 71 [2022-01-11 05:29:29,308 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-11 05:29:29,308 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 54 treesize of output 30 [2022-01-11 05:29:29,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-11 05:29:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked. [2022-01-11 05:29:29,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990393085] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:29:29,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:29:29,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 12] total 25 [2022-01-11 05:29:29,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611532298] [2022-01-11 05:29:29,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:29:29,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-11 05:29:29,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:29,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-11 05:29:29,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=496, Unknown=1, NotChecked=44, Total=600 [2022-01-11 05:29:29,414 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:31,978 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-01-11 05:29:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-11 05:29:31,980 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-11 05:29:31,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:31,981 INFO L225 Difference]: With dead ends: 81 [2022-01-11 05:29:31,981 INFO L226 Difference]: Without dead ends: 63 [2022-01-11 05:29:31,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=335, Invalid=1560, Unknown=1, NotChecked=84, Total=1980 [2022-01-11 05:29:31,982 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 299 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:31,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 144 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 418 Invalid, 0 Unknown, 54 Unchecked, 1.5s Time] [2022-01-11 05:29:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-11 05:29:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2022-01-11 05:29:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-01-11 05:29:31,988 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 32 [2022-01-11 05:29:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:31,988 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-01-11 05:29:31,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-01-11 05:29:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 05:29:31,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:31,989 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:32,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 05:29:32,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:32,215 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash -160670451, now seen corresponding path program 1 times [2022-01-11 05:29:32,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:32,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893290226] [2022-01-11 05:29:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:32,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-11 05:29:32,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893290226] [2022-01-11 05:29:32,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893290226] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415287441] [2022-01-11 05:29:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:32,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:32,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:32,792 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:29:32,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-11 05:29:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:32,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 34 conjunts are in the unsatisfiable core [2022-01-11 05:29:32,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:33,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2022-01-11 05:29:33,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:33,139 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:33,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2022-01-11 05:29:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-11 05:29:33,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 05:29:33,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415287441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:29:33,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:29:33,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 19 [2022-01-11 05:29:33,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943113936] [2022-01-11 05:29:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:29:33,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-11 05:29:33,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-11 05:29:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2022-01-11 05:29:33,412 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:33,942 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-01-11 05:29:33,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:29:33,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-11 05:29:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:33,944 INFO L225 Difference]: With dead ends: 63 [2022-01-11 05:29:33,944 INFO L226 Difference]: Without dead ends: 56 [2022-01-11 05:29:33,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-01-11 05:29:33,945 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 189 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:33,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 45 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 05:29:33,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-11 05:29:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-01-11 05:29:33,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.26) internal successors, (63), 50 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:33,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-01-11 05:29:33,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 38 [2022-01-11 05:29:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:33,955 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-01-11 05:29:33,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:33,955 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-01-11 05:29:33,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-11 05:29:33,956 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:33,956 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:33,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-11 05:29:34,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:34,175 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:34,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:34,176 INFO L85 PathProgramCache]: Analyzing trace with hash -159746930, now seen corresponding path program 1 times [2022-01-11 05:29:34,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:34,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892459425] [2022-01-11 05:29:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:34,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:34,749 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:29:34,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:34,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892459425] [2022-01-11 05:29:34,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892459425] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:34,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447724127] [2022-01-11 05:29:34,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:34,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:34,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:34,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:29:34,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-11 05:29:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:40,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-11 05:29:40,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:40,756 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-11 05:29:40,807 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:29:40,808 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 13 treesize of output 13 [2022-01-11 05:29:40,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:40,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2022-01-11 05:29:40,946 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 29 treesize of output 29 [2022-01-11 05:29:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-11 05:29:41,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:29:41,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,501 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:41,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 71 [2022-01-11 05:29:41,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:41,506 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:41,506 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 1 case distinctions, treesize of input 54 treesize of output 30 [2022-01-11 05:29:41,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-11 05:29:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-11 05:29:41,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447724127] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:29:41,610 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:29:41,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-01-11 05:29:41,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262602158] [2022-01-11 05:29:41,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:29:41,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-11 05:29:41,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:29:41,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-11 05:29:41,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=792, Unknown=1, NotChecked=0, Total=870 [2022-01-11 05:29:41,612 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:43,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:29:43,883 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-01-11 05:29:43,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 05:29:43,884 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-11 05:29:43,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:29:43,884 INFO L225 Difference]: With dead ends: 96 [2022-01-11 05:29:43,884 INFO L226 Difference]: Without dead ends: 56 [2022-01-11 05:29:43,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=316, Invalid=1489, Unknown=1, NotChecked=0, Total=1806 [2022-01-11 05:29:43,886 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 406 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:29:43,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 138 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 282 Invalid, 0 Unknown, 31 Unchecked, 1.1s Time] [2022-01-11 05:29:43,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-11 05:29:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-01-11 05:29:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-01-11 05:29:43,916 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2022-01-11 05:29:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:29:43,916 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-01-11 05:29:43,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3333333333333335) internal successors, (70), 30 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:29:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-01-11 05:29:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-11 05:29:43,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:29:43,917 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:29:43,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 05:29:44,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:44,126 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:29:44,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:29:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 170946611, now seen corresponding path program 1 times [2022-01-11 05:29:44,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:29:44,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478992458] [2022-01-11 05:29:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:44,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:29:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:29:44,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:29:44,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478992458] [2022-01-11 05:29:44,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478992458] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:29:44,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808777857] [2022-01-11 05:29:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:29:44,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:29:44,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:29:44,876 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:29:44,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-11 05:29:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:29:49,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-11 05:29:49,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:29:49,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:29:49,648 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:29:49,649 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-11 05:29:49,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2022-01-11 05:29:49,759 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-11 05:29:49,856 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-11 05:29:49,856 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-11 05:29:49,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-01-11 05:29:49,948 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-11 05:29:49,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:49,959 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2022-01-11 05:29:50,034 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:29:50,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 99 [2022-01-11 05:29:50,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:29:50,041 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 55 treesize of output 46 [2022-01-11 05:29:50,047 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 37 treesize of output 37 [2022-01-11 05:29:50,492 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 42 treesize of output 22 [2022-01-11 05:29:50,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-11 05:29:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-11 05:29:50,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:29:50,793 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1403 (Array Int Int)) (v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1402 Int)) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_1401) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) .cse2)) (.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| v_ArrVal_1403) |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt|) .cse2))) (or (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1402)) .cse0) .cse1) 0) (and (= .cse0 0) (= .cse1 0)))))) is different from false [2022-01-11 05:29:50,818 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-11 05:29:50,818 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 153 treesize of output 139 [2022-01-11 05:29:50,831 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-11 05:29:50,832 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 222 treesize of output 190 [2022-01-11 05:29:50,839 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 122 treesize of output 110 [2022-01-11 05:29:50,860 INFO L353 Elim1Store]: treesize reduction 37, result has 40.3 percent of original size [2022-01-11 05:29:50,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 129 [2022-01-11 05:29:50,870 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-11 05:29:50,870 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 213 treesize of output 173 [2022-01-11 05:29:50,874 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 165 treesize of output 147 [2022-01-11 05:29:51,698 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1402 Int) (v_arrayElimCell_32 Int)) (let ((.cse2 (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|)) (.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt| v_ArrVal_1398))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1402)) (.cse3 (not .cse2))) (or (and (= (select (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| .cse1) v_arrayElimCell_32) v_arrayElimCell_35) 0) .cse2) (and (or (and (= 0 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) .cse3) (and (= v_arrayElimCell_35 0) .cse2)) (or (and .cse3 (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| 0)) (and .cse2 (= v_arrayElimCell_32 0)))) (and (= (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 0) .cse3))))) is different from false [2022-01-11 05:29:53,109 INFO L353 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2022-01-11 05:29:53,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2022-01-11 05:29:53,120 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:29:53,352 INFO L353 Elim1Store]: treesize reduction 23, result has 42.5 percent of original size [2022-01-11 05:29:53,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2022-01-11 05:29:53,360 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-11 05:29:53,619 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:53,619 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 17 treesize of output 21 [2022-01-11 05:29:53,669 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int)) (v_arrayElimCell_35 Int) (v_ArrVal_1402 Int) (v_arrayElimCell_32 Int) (|v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_7| Int)) (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_7|)) (.cse1 (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_7| v_ArrVal_1398))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1402)) (.cse3 (not .cse0))) (or (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_dll_create_~new_head~0#1.baseInt_7|) 2) 0)) (and .cse0 (= (select (select (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| .cse2) v_arrayElimCell_32) v_arrayElimCell_35) 0)) (and (or (and .cse0 (= v_arrayElimCell_32 0)) (and .cse3 (= |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.baseInt| 0))) (or (and (= 0 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) .cse3) (and .cse0 (= v_arrayElimCell_35 0)))) (and (= (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_create_~head~0#1.offsetInt|) 0) .cse3))))) is different from false [2022-01-11 05:29:54,073 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,074 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 17 treesize of output 21 [2022-01-11 05:29:54,164 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,165 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 17 treesize of output 21 [2022-01-11 05:29:54,209 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,209 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 17 treesize of output 21 [2022-01-11 05:29:54,640 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,640 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 17 treesize of output 21 [2022-01-11 05:29:54,686 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,686 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 17 treesize of output 21 [2022-01-11 05:29:54,760 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,760 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 17 treesize of output 21 [2022-01-11 05:29:54,881 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,882 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 17 treesize of output 21 [2022-01-11 05:29:54,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:54,938 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 17 treesize of output 21 [2022-01-11 05:29:55,505 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:55,505 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 20 treesize of output 24 [2022-01-11 05:29:55,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:55,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:55,561 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:55,562 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-01-11 05:29:55,857 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:55,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-01-11 05:29:55,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:55,876 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:55,881 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:55,881 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-01-11 05:29:55,953 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:55,953 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 20 treesize of output 24 [2022-01-11 05:29:56,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:56,010 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-01-11 05:29:56,069 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,078 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:56,078 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2022-01-11 05:29:56,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:56,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 169 treesize of output 117 [2022-01-11 05:29:56,562 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:56,563 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 9906 treesize of output 9652 [2022-01-11 05:29:56,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,612 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:56,612 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 10520 treesize of output 10268 [2022-01-11 05:29:56,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:29:56,669 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:29:56,670 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 12024 treesize of output 11512 [2022-01-11 05:29:58,088 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 11366 treesize of output 11238