/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_NONE.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:41:35,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:41:35,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:41:36,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:41:36,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:41:36,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:41:36,039 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:41:36,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:41:36,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:41:36,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:41:36,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:41:36,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:41:36,054 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:41:36,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:41:36,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:41:36,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:41:36,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:41:36,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:41:36,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:41:36,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:41:36,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:41:36,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:41:36,063 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:41:36,064 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:41:36,066 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:41:36,066 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:41:36,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:41:36,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:41:36,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:41:36,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:41:36,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:41:36,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:41:36,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:41:36,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:41:36,070 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:41:36,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:41:36,071 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:41:36,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:41:36,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:41:36,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:41:36,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:41:36,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:41:36,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:41:36,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:41:36,091 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:41:36,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:41:36,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:41:36,093 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:41:36,093 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:41:36,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:41:36,093 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:41:36,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:41:36,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:41:36,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:41:36,094 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:41:36,094 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:41:36,094 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:41:36,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:41:36,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:41:36,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:41:36,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:41:36,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:41:36,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:41:36,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:41:36,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:41:36,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:41:36,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:41:36,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:41:36,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:41:36,096 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:41:36,096 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:41:36,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:41:36,096 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:41:36,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:41:36,097 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:41:36,097 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:41:36,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:41:36,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:41:36,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:41:36,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:41:36,387 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:41:36,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.i [2022-01-10 23:41:36,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b468289/81566d2b1b9c4ec3b80cc80654dc9abc/FLAG1be0fd6f9 [2022-01-10 23:41:36,906 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:41:36,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check-2.i [2022-01-10 23:41:36,923 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b468289/81566d2b1b9c4ec3b80cc80654dc9abc/FLAG1be0fd6f9 [2022-01-10 23:41:37,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06b468289/81566d2b1b9c4ec3b80cc80654dc9abc [2022-01-10 23:41:37,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:41:37,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:41:37,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:41:37,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:41:37,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:41:37,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,254 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe20ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37, skipping insertion in model container [2022-01-10 23:41:37,254 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:41:37,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:41:37,514 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/sll_length_check-2.i[23814,23827] [2022-01-10 23:41:37,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:41:37,524 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:41:37,556 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/sll_length_check-2.i[23814,23827] [2022-01-10 23:41:37,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:41:37,578 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:41:37,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37 WrapperNode [2022-01-10 23:41:37,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:41:37,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:41:37,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:41:37,580 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:41:37,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,629 INFO L137 Inliner]: procedures = 126, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 81 [2022-01-10 23:41:37,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:41:37,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:41:37,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:41:37,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:41:37,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,647 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:41:37,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:41:37,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:41:37,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:41:37,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (1/1) ... [2022-01-10 23:41:37,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:41:37,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:41:37,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:41:37,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:41:37,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:41:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:41:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:41:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:41:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:41:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:41:37,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:41:37,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:41:37,855 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:41:37,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:41:38,046 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:41:38,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:41:38,051 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 23:41:38,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:41:38 BoogieIcfgContainer [2022-01-10 23:41:38,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:41:38,053 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:41:38,053 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:41:38,056 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:41:38,059 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:41:38" (1/1) ... [2022-01-10 23:41:38,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:41:38 BasicIcfg [2022-01-10 23:41:38,151 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:41:38,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:41:38,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:41:38,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:41:38,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:41:37" (1/4) ... [2022-01-10 23:41:38,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41de309b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:41:38, skipping insertion in model container [2022-01-10 23:41:38,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:41:37" (2/4) ... [2022-01-10 23:41:38,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41de309b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:41:38, skipping insertion in model container [2022-01-10 23:41:38,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:41:38" (3/4) ... [2022-01-10 23:41:38,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41de309b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:41:38, skipping insertion in model container [2022-01-10 23:41:38,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:41:38" (4/4) ... [2022-01-10 23:41:38,158 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_length_check-2.iTransformedIcfg [2022-01-10 23:41:38,162 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:41:38,162 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:41:38,213 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:41:38,220 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:41:38,221 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:41:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:38,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 23:41:38,236 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:38,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:38,237 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash 352951502, now seen corresponding path program 1 times [2022-01-10 23:41:38,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:38,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621518639] [2022-01-10 23:41:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:38,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:38,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:38,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621518639] [2022-01-10 23:41:38,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621518639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:41:38,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:41:38,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:41:38,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944553470] [2022-01-10 23:41:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:41:38,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:41:38,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:41:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:41:38,444 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 20 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) 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-10 23:41:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:38,458 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2022-01-10 23:41:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:41:38,461 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-10 23:41:38,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:38,467 INFO L225 Difference]: With dead ends: 39 [2022-01-10 23:41:38,467 INFO L226 Difference]: Without dead ends: 15 [2022-01-10 23:41:38,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:41:38,481 INFO L933 BasicCegarLoop]: 25 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, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:38,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:41:38,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-01-10 23:41:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-01-10 23:41:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 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-10 23:41:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-01-10 23:41:38,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-01-10 23:41:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:38,508 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-01-10 23:41:38,508 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-10 23:41:38,509 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-01-10 23:41:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 23:41:38,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:38,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:38,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:41:38,511 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:38,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:38,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1900171853, now seen corresponding path program 1 times [2022-01-10 23:41:38,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:38,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377442259] [2022-01-10 23:41:38,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:38,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:38,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:38,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377442259] [2022-01-10 23:41:38,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377442259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:41:38,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:41:38,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:41:38,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910904724] [2022-01-10 23:41:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:41:38,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:41:38,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:41:38,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:41:38,685 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-10 23:41:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:38,743 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-01-10 23:41:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:41:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-10 23:41:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:38,746 INFO L225 Difference]: With dead ends: 39 [2022-01-10 23:41:38,747 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 23:41:38,751 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:41:38,752 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:38,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:41:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 23:41:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2022-01-10 23:41:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-01-10 23:41:38,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2022-01-10 23:41:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:38,763 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-01-10 23:41:38,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-10 23:41:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-01-10 23:41:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 23:41:38,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:38,771 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:38,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:41:38,772 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:38,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:38,772 INFO L85 PathProgramCache]: Analyzing trace with hash -982788900, now seen corresponding path program 1 times [2022-01-10 23:41:38,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:38,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125113785] [2022-01-10 23:41:38,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:38,773 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:38,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:38,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125113785] [2022-01-10 23:41:38,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125113785] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:41:38,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920066205] [2022-01-10 23:41:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:38,892 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:41:38,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:41:38,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:41:38,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 23:41:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:38,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 23:41:39,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:41:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:39,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:41:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:39,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920066205] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:41:39,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:41:39,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 17 [2022-01-10 23:41:39,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542998847] [2022-01-10 23:41:39,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:41:39,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 23:41:39,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:39,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 23:41:39,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-01-10 23:41:39,547 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:40,010 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-01-10 23:41:40,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 23:41:40,011 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 23:41:40,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:40,012 INFO L225 Difference]: With dead ends: 70 [2022-01-10 23:41:40,012 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 23:41:40,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-01-10 23:41:40,028 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 139 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:40,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 172 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:41:40,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 23:41:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 26. [2022-01-10 23:41:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-10 23:41:40,042 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 13 [2022-01-10 23:41:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:40,042 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-10 23:41:40,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-10 23:41:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:41:40,043 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:40,043 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:40,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 23:41:40,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:41:40,258 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash -646311145, now seen corresponding path program 1 times [2022-01-10 23:41:40,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:40,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342520501] [2022-01-10 23:41:40,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:40,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:41:40,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:40,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342520501] [2022-01-10 23:41:40,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342520501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:41:40,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:41:40,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:41:40,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211208697] [2022-01-10 23:41:40,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:41:40,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 23:41:40,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 23:41:40,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:41:40,348 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:40,395 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-01-10 23:41:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:41:40,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 15 [2022-01-10 23:41:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:40,396 INFO L225 Difference]: With dead ends: 34 [2022-01-10 23:41:40,396 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 23:41:40,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:41:40,397 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:40,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:41:40,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 23:41:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-01-10 23:41:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-10 23:41:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-01-10 23:41:40,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-01-10 23:41:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:40,406 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-01-10 23:41:40,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-01-10 23:41:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 23:41:40,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:40,407 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:40,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:41:40,407 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:40,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2109897471, now seen corresponding path program 1 times [2022-01-10 23:41:40,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:40,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039593321] [2022-01-10 23:41:40,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:40,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:40,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:40,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039593321] [2022-01-10 23:41:40,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039593321] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:41:40,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015621046] [2022-01-10 23:41:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:40,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:41:40,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:41:40,577 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:41:40,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 23:41:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:40,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 23:41:40,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:41:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:41:40,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:41:40,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015621046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:41:40,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:41:40,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-01-10 23:41:40,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545218709] [2022-01-10 23:41:40,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:41:40,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:41:40,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:40,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:41:40,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-01-10 23:41:40,755 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:40,816 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-01-10 23:41:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:41:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-10 23:41:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:40,817 INFO L225 Difference]: With dead ends: 31 [2022-01-10 23:41:40,817 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 23:41:40,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:41:40,818 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:40,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 41 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:41:40,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 23:41:40,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-01-10 23:41:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-10 23:41:40,826 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17 [2022-01-10 23:41:40,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:40,826 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-10 23:41:40,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:40,826 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-10 23:41:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:41:40,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:40,827 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:40,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 23:41:41,049 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-10 23:41:41,049 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:41,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1009063557, now seen corresponding path program 1 times [2022-01-10 23:41:41,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:41,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790354902] [2022-01-10 23:41:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:41,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:41,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:41:41,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:41,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790354902] [2022-01-10 23:41:41,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790354902] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:41:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951900223] [2022-01-10 23:41:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:41,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:41:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:41:41,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:41:41,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 23:41:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:41,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 23:41:41,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:41:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:41:41,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:41:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:41:42,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951900223] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:41:42,201 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:41:42,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 17 [2022-01-10 23:41:42,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267877559] [2022-01-10 23:41:42,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:41:42,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 23:41:42,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:42,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 23:41:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-01-10 23:41:42,203 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:42,978 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2022-01-10 23:41:42,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 23:41:42,979 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 23:41:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:42,979 INFO L225 Difference]: With dead ends: 90 [2022-01-10 23:41:42,979 INFO L226 Difference]: Without dead ends: 81 [2022-01-10 23:41:42,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2022-01-10 23:41:42,981 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 105 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:42,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 236 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 73 Invalid, 0 Unknown, 70 Unchecked, 0.3s Time] [2022-01-10 23:41:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-10 23:41:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 30. [2022-01-10 23:41:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-01-10 23:41:42,996 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2022-01-10 23:41:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:42,996 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-01-10 23:41:42,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-01-10 23:41:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 23:41:42,997 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:42,997 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:43,016 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-10 23:41:43,197 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-10 23:41:43,198 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -299933129, now seen corresponding path program 1 times [2022-01-10 23:41:43,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353757669] [2022-01-10 23:41:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:43,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:43,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:43,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353757669] [2022-01-10 23:41:43,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353757669] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:41:43,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782453983] [2022-01-10 23:41:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:43,323 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:41:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:41:43,324 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-10 23:41:43,343 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-10 23:41:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:43,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 23:41:43,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:41:43,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:41:43,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-10 23:41:43,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:43,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:41:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:43,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782453983] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:41:43,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:41:43,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 14 [2022-01-10 23:41:43,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226902854] [2022-01-10 23:41:43,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:41:43,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 23:41:43,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 23:41:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:41:43,625 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:43,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:43,778 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2022-01-10 23:41:43,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:41:43,779 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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) Word has length 19 [2022-01-10 23:41:43,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:43,780 INFO L225 Difference]: With dead ends: 55 [2022-01-10 23:41:43,780 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 23:41:43,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-01-10 23:41:43,781 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 88 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:43,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 126 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:41:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 23:41:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2022-01-10 23:41:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-01-10 23:41:43,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 19 [2022-01-10 23:41:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:43,829 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-01-10 23:41:43,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:43,829 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-01-10 23:41:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 23:41:43,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:43,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:43,857 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-10 23:41:44,043 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-10 23:41:44,043 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash -681241011, now seen corresponding path program 2 times [2022-01-10 23:41:44,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:44,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161485277] [2022-01-10 23:41:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:44,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 23:41:44,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:44,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161485277] [2022-01-10 23:41:44,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161485277] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:41:44,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124045882] [2022-01-10 23:41:44,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:41:44,161 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:41:44,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:41:44,162 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-10 23:41:44,163 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-10 23:41:44,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:41:44,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:41:44,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 23:41:44,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:41:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 23:41:44,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:41:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 23:41:44,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124045882] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:41:44,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:41:45,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-01-10 23:41:45,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951420331] [2022-01-10 23:41:45,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:41:45,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 23:41:45,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:41:45,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 23:41:45,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:41:45,002 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:41:45,073 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-01-10 23:41:45,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:41:45,074 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 23:41:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:41:45,076 INFO L225 Difference]: With dead ends: 55 [2022-01-10 23:41:45,076 INFO L226 Difference]: Without dead ends: 50 [2022-01-10 23:41:45,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:41:45,077 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:41:45,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-01-10 23:41:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-10 23:41:45,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-01-10 23:41:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-01-10 23:41:45,110 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 20 [2022-01-10 23:41:45,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:41:45,111 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-01-10 23:41:45,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:41:45,111 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-01-10 23:41:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:41:45,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:41:45,112 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:41:45,141 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-10 23:41:45,326 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-10 23:41:45,327 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:41:45,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:41:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash 383116535, now seen corresponding path program 3 times [2022-01-10 23:41:45,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:41:45,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698759593] [2022-01-10 23:41:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:41:45,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:41:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:41:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:45,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:41:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698759593] [2022-01-10 23:41:45,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698759593] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:41:45,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681338797] [2022-01-10 23:41:45,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 23:41:45,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:41:45,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:41:45,590 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-10 23:41:45,600 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-10 23:41:45,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 23:41:45,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:41:45,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-10 23:41:45,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:41:45,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:41:45,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:41:45,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:41:45,935 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 23:41:45,935 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 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 23:41:45,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:41:45,949 INFO L353 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-01-10 23:41:45,949 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 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 23:41:46,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:41:46,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:41:46,650 INFO L353 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2022-01-10 23:41:46,650 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 52 [2022-01-10 23:41:46,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:41:46,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:41:46,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:41:46,939 INFO L353 Elim1Store]: treesize reduction 63, result has 17.1 percent of original size [2022-01-10 23:41:46,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 40 [2022-01-10 23:41:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:41:46,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:41:51,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16| Int) (|ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse6 (store (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse6)) (.cse4 (select .cse6 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (.cse5 (select .cse3 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse3) .cse4) .cse5))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (< |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|) (and (= .cse1 0) (= .cse2 0))))))) is different from false [2022-01-10 23:41:55,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| Int)) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16| Int) (|ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| Int)) (let ((.cse3 (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse6 (store (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse6)) (.cse4 (select .cse6 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (.cse5 (select .cse3 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|))) (let ((.cse0 (select (select .cse2 .cse4) .cse5)) (.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse3) .cse4) .cse5))) (or (and (= .cse0 0) (= .cse1 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (< |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|) (not (= (select (select .cse2 .cse0) .cse1) 0))))))))) is different from false [2022-01-10 23:41:56,144 INFO L353 Elim1Store]: treesize reduction 185, result has 37.3 percent of original size [2022-01-10 23:41:56,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 5900 treesize of output 4118 [2022-01-10 23:41:56,285 INFO L353 Elim1Store]: treesize reduction 62, result has 11.4 percent of original size [2022-01-10 23:41:56,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 6775 treesize of output 4862 [2022-01-10 23:41:56,416 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:41:56,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4803 treesize of output 4451 [2022-01-10 23:41:56,469 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:41:56,470 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 4405 treesize of output 4023 [2022-01-10 23:41:56,758 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 6 treesize of output 4 [2022-01-10 23:42:03,482 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 6 treesize of output 4 [2022-01-10 23:42:03,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:42:03,497 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 23 treesize of output 21 [2022-01-10 23:42:03,587 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 6 treesize of output 4 [2022-01-10 23:42:03,613 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 23:42:03,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 23:42:03,666 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 23:42:05,173 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 6 treesize of output 4 [2022-01-10 23:42:05,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 23:42:05,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 23:42:05,284 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 6 treesize of output 4 [2022-01-10 23:42:05,339 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:42:05,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-01-10 23:42:05,366 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-10 23:42:05,367 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 12 [2022-01-10 23:42:05,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:42:05,469 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:42:05,470 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 99 treesize of output 101 [2022-01-10 23:42:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-10 23:42:05,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681338797] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:42:05,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:42:05,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2022-01-10 23:42:05,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352417210] [2022-01-10 23:42:05,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:42:05,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 23:42:05,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:42:05,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 23:42:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=680, Unknown=4, NotChecked=106, Total=870 [2022-01-10 23:42:05,758 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:07,840 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| 0))) (let ((.cse1 (not .cse0)) (.cse3 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse2 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (and (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 1) (or (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) .cse0) .cse1 (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|) (or (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|) .cse0) (or .cse1 (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) (= (select .cse2 0) 0) (= (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 0) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0) (= (select .cse3 0) 0) (= (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| Int)) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| 0)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16| Int) (|ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| Int)) (let ((.cse7 (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse10 (store (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (let ((.cse6 (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse10)) (.cse8 (select .cse10 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (.cse9 (select .cse7 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|))) (let ((.cse4 (select (select .cse6 .cse8) .cse9)) (.cse5 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse7) .cse8) .cse9))) (or (and (= .cse4 0) (= .cse5 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (< |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_9| |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|) (not (= (select (select .cse6 .cse4) .cse5) 0)))))))))))) is different from false [2022-01-10 23:42:09,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (.cse0 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (and (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt| 0)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) (= (select .cse0 0) 0) (= (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 0) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0) (= (select .cse1 0) 0) (= (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16| Int) (|ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| Int)) (let ((.cse5 (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse8 (store (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse8)) (.cse6 (select .cse8 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (.cse7 (select .cse5 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse5) .cse6) .cse7))) (or (not (= (select (select .cse2 .cse3) .cse4) 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|)) (< |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_16|) (and (= .cse3 0) (= .cse4 0))))))) (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| 0))) is different from false [2022-01-10 23:42:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:42:10,108 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-01-10 23:42:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 23:42:10,109 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 states have internal predecessors, (46), 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 21 [2022-01-10 23:42:10,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:42:10,109 INFO L225 Difference]: With dead ends: 78 [2022-01-10 23:42:10,110 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 23:42:10,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=124, Invalid=1076, Unknown=6, NotChecked=276, Total=1482 [2022-01-10 23:42:10,111 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:42:10,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 236 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-01-10 23:42:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 23:42:10,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-01-10 23:42:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-01-10 23:42:10,133 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 21 [2022-01-10 23:42:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:42:10,134 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-01-10 23:42:10,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-01-10 23:42:10,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:42:10,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:42:10,134 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:42:10,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-10 23:42:10,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:10,348 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:42:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:42:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2061067812, now seen corresponding path program 2 times [2022-01-10 23:42:10,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:42:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994339874] [2022-01-10 23:42:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:42:10,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:42:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:42:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:42:10,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:42:10,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994339874] [2022-01-10 23:42:10,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994339874] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:42:10,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247366586] [2022-01-10 23:42:10,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:42:10,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:10,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:42:10,485 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:42:10,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 23:42:10,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:42:10,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:42:10,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjunts are in the unsatisfiable core [2022-01-10 23:42:10,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:42:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:42:11,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:42:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:42:12,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247366586] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:42:12,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:42:12,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2022-01-10 23:42:12,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099693261] [2022-01-10 23:42:12,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:42:12,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 23:42:12,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:42:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 23:42:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-01-10 23:42:12,680 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:42:13,292 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2022-01-10 23:42:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 23:42:13,293 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 23:42:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:42:13,294 INFO L225 Difference]: With dead ends: 106 [2022-01-10 23:42:13,294 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 23:42:13,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2022-01-10 23:42:13,295 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:42:13,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 194 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2022-01-10 23:42:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 23:42:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2022-01-10 23:42:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2022-01-10 23:42:13,326 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 21 [2022-01-10 23:42:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:42:13,326 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2022-01-10 23:42:13,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2022-01-10 23:42:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:42:13,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:42:13,327 INFO L514 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:42:13,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 23:42:13,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:13,532 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:42:13,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:42:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -313916428, now seen corresponding path program 3 times [2022-01-10 23:42:13,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:42:13,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367757675] [2022-01-10 23:42:13,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:42:13,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:42:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:42:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:42:13,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:42:13,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367757675] [2022-01-10 23:42:13,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367757675] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:42:13,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696231197] [2022-01-10 23:42:13,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 23:42:13,753 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:42:13,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:42:13,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 23:42:13,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-10 23:42:13,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:42:13,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 23:42:13,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:42:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 23:42:14,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:42:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 23:42:15,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696231197] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:42:15,037 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:42:15,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2022-01-10 23:42:15,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963767340] [2022-01-10 23:42:15,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:42:15,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 23:42:15,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:42:15,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 23:42:15,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2022-01-10 23:42:15,039 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:19,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:42:19,893 INFO L93 Difference]: Finished difference Result 252 states and 282 transitions. [2022-01-10 23:42:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-10 23:42:19,894 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 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 21 [2022-01-10 23:42:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:42:19,895 INFO L225 Difference]: With dead ends: 252 [2022-01-10 23:42:19,895 INFO L226 Difference]: Without dead ends: 193 [2022-01-10 23:42:19,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=422, Invalid=3610, Unknown=0, NotChecked=0, Total=4032 [2022-01-10 23:42:19,897 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 431 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:42:19,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 1031 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-10 23:42:19,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-10 23:42:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 74. [2022-01-10 23:42:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.178082191780822) internal successors, (86), 73 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2022-01-10 23:42:19,936 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 21 [2022-01-10 23:42:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:42:19,936 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-01-10 23:42:19,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-01-10 23:42:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 23:42:19,937 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:42:19,937 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:42:19,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 23:42:20,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 23:42:20,142 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:42:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:42:20,142 INFO L85 PathProgramCache]: Analyzing trace with hash 16615423, now seen corresponding path program 4 times [2022-01-10 23:42:20,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:42:20,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694419096] [2022-01-10 23:42:20,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:42:20,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:42:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:42:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 23:42:20,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:42:20,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694419096] [2022-01-10 23:42:20,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694419096] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:42:20,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579582894] [2022-01-10 23:42:20,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 23:42:20,437 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:20,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:42:20,439 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:42:20,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 23:42:20,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 23:42:20,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:42:20,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 23:42:20,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:42:20,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:42:20,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:42:20,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-10 23:42:20,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 23:42:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 23:42:20,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:42:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 23:42:21,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579582894] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:42:21,006 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:42:21,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2022-01-10 23:42:21,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341853646] [2022-01-10 23:42:21,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:42:21,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 23:42:21,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:42:21,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 23:42:21,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2022-01-10 23:42:21,007 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:42:23,109 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2022-01-10 23:42:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-10 23:42:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 23:42:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:42:23,110 INFO L225 Difference]: With dead ends: 224 [2022-01-10 23:42:23,110 INFO L226 Difference]: Without dead ends: 210 [2022-01-10 23:42:23,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2022-01-10 23:42:23,111 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 185 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:42:23,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 964 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 23:42:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-10 23:42:23,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 74. [2022-01-10 23:42:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 73 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-01-10 23:42:23,146 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 23 [2022-01-10 23:42:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:42:23,146 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-01-10 23:42:23,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-01-10 23:42:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 23:42:23,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:42:23,147 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:42:23,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 23:42:23,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:23,348 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:42:23,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:42:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash 162220272, now seen corresponding path program 5 times [2022-01-10 23:42:23,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:42:23,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403982120] [2022-01-10 23:42:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:42:23,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:42:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:42:23,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:42:23,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:42:23,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403982120] [2022-01-10 23:42:23,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403982120] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:42:23,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98758487] [2022-01-10 23:42:23,575 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 23:42:23,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:23,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:42:23,576 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:42:23,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 23:42:23,725 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-10 23:42:23,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:42:23,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-10 23:42:23,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:42:23,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:42:23,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:42:23,848 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 23:42:23,848 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-10 23:42:23,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:42:23,908 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 23 treesize of output 22 [2022-01-10 23:42:24,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:24,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-01-10 23:42:24,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:24,203 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:24,216 INFO L353 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-01-10 23:42:24,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 23 [2022-01-10 23:42:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:42:24,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:42:24,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2022-01-10 23:42:24,396 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 56 treesize of output 54 [2022-01-10 23:42:26,774 INFO L353 Elim1Store]: treesize reduction 26, result has 23.5 percent of original size [2022-01-10 23:42:26,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 119 [2022-01-10 23:42:26,786 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:42:26,786 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 112 treesize of output 104 [2022-01-10 23:42:26,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:42:26,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:42:26,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:42:26,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2022-01-10 23:42:27,234 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 12 treesize of output 10 [2022-01-10 23:42:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:42:27,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98758487] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:42:27,262 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:42:27,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-01-10 23:42:27,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309301156] [2022-01-10 23:42:27,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:42:27,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 23:42:27,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:42:27,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 23:42:27,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=635, Unknown=1, NotChecked=0, Total=702 [2022-01-10 23:42:27,263 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:29,490 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (and (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| 0) (not (= (select (select |c_#memory_$Pointer$.baseInt| (select .cse0 0)) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 0)) 0)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 1) (exists ((|ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|)) (.cse1 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|))) (and (<= 0 .cse1) (not (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)) (<= .cse1 0) (<= |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| 0) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|) (< 0 (select (select |c_#memory_$Pointer$.baseInt| .cse2) .cse1))))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| 0)) (< 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (< 0 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31| Int)) (let ((.cse4 (= |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|))) (or (and (<= 1 (select (let ((.cse3 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse3) (select .cse3 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|))) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) .cse4) (and (not .cse4) (forall ((v_arrayElimCell_49 Int)) (<= 1 (select (let ((.cse5 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse5) (select .cse5 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|))) v_arrayElimCell_49)))) (< |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|))))))) is different from false [2022-01-10 23:42:31,549 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) 1) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| 0)) (< 0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) (< 0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt| 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31| Int)) (let ((.cse1 (= |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt|))) (or (and (<= 1 (select (let ((.cse0 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse0) (select .cse0 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|))) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) .cse1) (and (not .cse1) (forall ((v_arrayElimCell_49 Int)) (<= 1 (select (let ((.cse2 (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|))) (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| .cse2) (select .cse2 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|))) v_arrayElimCell_49)))) (< |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_length_~head#1.offsetInt_31|)))))) is different from false [2022-01-10 23:42:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:42:31,575 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-01-10 23:42:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 23:42:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 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 24 [2022-01-10 23:42:31,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:42:31,576 INFO L225 Difference]: With dead ends: 82 [2022-01-10 23:42:31,576 INFO L226 Difference]: Without dead ends: 77 [2022-01-10 23:42:31,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=143, Invalid=984, Unknown=3, NotChecked=130, Total=1260 [2022-01-10 23:42:31,577 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:42:31,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 193 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-01-10 23:42:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-10 23:42:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2022-01-10 23:42:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2022-01-10 23:42:31,610 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 24 [2022-01-10 23:42:31,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:42:31,610 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2022-01-10 23:42:31,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 27 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2022-01-10 23:42:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 23:42:31,611 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:42:31,611 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:42:31,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 23:42:31,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 23:42:31,814 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:42:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:42:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash 760612532, now seen corresponding path program 6 times [2022-01-10 23:42:31,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:42:31,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315895307] [2022-01-10 23:42:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:42:31,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:42:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:42:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 23:42:32,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:42:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315895307] [2022-01-10 23:42:32,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315895307] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:42:32,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300413992] [2022-01-10 23:42:32,000 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 23:42:32,000 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:42:32,001 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:42:32,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 23:42:32,260 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-10 23:42:32,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:42:32,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 23:42:32,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:42:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 23:42:32,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:42:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 23:42:33,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300413992] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:42:33,173 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:42:33,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2022-01-10 23:42:33,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068570410] [2022-01-10 23:42:33,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:42:33,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 23:42:33,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:42:33,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 23:42:33,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-01-10 23:42:33,174 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:42:33,373 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-01-10 23:42:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 23:42:33,374 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 23:42:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:42:33,374 INFO L225 Difference]: With dead ends: 96 [2022-01-10 23:42:33,374 INFO L226 Difference]: Without dead ends: 91 [2022-01-10 23:42:33,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2022-01-10 23:42:33,375 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:42:33,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 146 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 130 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-01-10 23:42:33,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-01-10 23:42:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2022-01-10 23:42:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 66 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-01-10 23:42:33,411 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 25 [2022-01-10 23:42:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:42:33,412 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-01-10 23:42:33,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:42:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2022-01-10 23:42:33,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 23:42:33,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:42:33,412 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:42:33,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-10 23:42:33,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-10 23:42:33,613 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:42:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:42:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2130903408, now seen corresponding path program 7 times [2022-01-10 23:42:33,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:42:33,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019349058] [2022-01-10 23:42:33,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:42:33,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:42:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:42:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:42:34,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:42:34,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019349058] [2022-01-10 23:42:34,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019349058] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:42:34,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964325997] [2022-01-10 23:42:34,177 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 23:42:34,177 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:42:34,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:42:34,178 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:42:34,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-10 23:42:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:42:34,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 81 conjunts are in the unsatisfiable core [2022-01-10 23:42:34,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:42:34,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:42:34,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:42:34,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:34,493 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 23:42:34,493 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 1 case distinctions, treesize of input 26 treesize of output 21 [2022-01-10 23:42:34,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:34,505 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 23:42:34,506 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 1 case distinctions, treesize of input 23 treesize of output 26 [2022-01-10 23:42:34,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:34,698 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-01-10 23:42:34,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 60 [2022-01-10 23:42:34,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:34,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:34,726 INFO L353 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2022-01-10 23:42:34,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 94 [2022-01-10 23:42:35,644 INFO L353 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2022-01-10 23:42:35,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 108 [2022-01-10 23:42:36,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:36,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:36,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:42:36,161 INFO L353 Elim1Store]: treesize reduction 42, result has 14.3 percent of original size [2022-01-10 23:42:36,161 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 46 [2022-01-10 23:42:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:42:36,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:42:38,537 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|))) (.cse0 (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse5 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (and (<= .cse1 0) (< 0 (+ .cse1 1)) (<= .cse2 0) (< 0 (+ .cse2 1)))))))) is different from false [2022-01-10 23:42:40,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_26| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_26|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_26| 0)) (forall ((|ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_26| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|))) (.cse0 (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_sll_create_~new_head~0#1.offsetInt_26| |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|)))) (let ((.cse3 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_create_~head~0#1.offsetInt|))) (let ((.cse2 (select (select .cse5 .cse3) .cse4)) (.cse1 (select (select .cse0 .cse3) .cse4))) (or (not (= (select (select .cse0 .cse1) .cse2) 0)) (and (<= .cse1 0) (< 0 (+ .cse2 1)) (<= .cse2 0) (< 0 (+ .cse1 1)))))))))) is different from false