/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-simple/sll2n_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:39:57,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:39:57,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:39:57,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:39:57,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:39:57,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:39:57,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:39:57,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:39:57,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:39:57,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:39:57,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:39:57,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:39:57,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:39:57,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:39:57,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:39:57,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:39:57,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:39:57,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:39:57,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:39:57,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:39:57,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:39:57,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:39:57,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:39:57,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:39:57,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:39:57,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:39:57,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:39:57,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:39:57,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:39:57,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:39:57,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:39:57,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:39:57,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:39:57,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:39:57,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:39:57,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:39:57,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:39:57,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:39:57,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:39:57,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:39:57,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:39:57,587 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:39:57,613 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:39:57,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:39:57,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:39:57,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:39:57,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:39:57,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:39:57,614 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:39:57,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:39:57,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:39:57,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:39:57,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:39:57,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:39:57,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:39:57,617 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:39:57,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:39:57,617 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:39:57,617 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:39:57,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:39:57,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:39:57,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:39:57,793 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:39:57,793 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:39:57,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2022-01-10 23:39:57,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620464784/938f584e475b4445b460531b3a6dd4c8/FLAG382e313e1 [2022-01-10 23:39:58,256 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:39:58,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i [2022-01-10 23:39:58,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620464784/938f584e475b4445b460531b3a6dd4c8/FLAG382e313e1 [2022-01-10 23:39:58,282 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620464784/938f584e475b4445b460531b3a6dd4c8 [2022-01-10 23:39:58,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:39:58,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:39:58,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:39:58,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:39:58,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:39:58,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf7bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58, skipping insertion in model container [2022-01-10 23:39:58,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:39:58,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:39:58,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i[24301,24314] [2022-01-10 23:39:58,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:39:58,592 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:39:58,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_equal.i[24301,24314] [2022-01-10 23:39:58,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:39:58,659 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:39:58,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58 WrapperNode [2022-01-10 23:39:58,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:39:58,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:39:58,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:39:58,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:39:58,666 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:39:58" (1/1) ... [2022-01-10 23:39:58,683 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:39:58" (1/1) ... [2022-01-10 23:39:58,699 INFO L137 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 133 [2022-01-10 23:39:58,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:39:58,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:39:58,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:39:58,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:39:58,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:39:58,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:39:58,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:39:58,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:39:58,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (1/1) ... [2022-01-10 23:39:58,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:39:58,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:39:58,754 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:39:58,758 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:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 23:39:58,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:39:58,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:39:58,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:39:58,890 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:39:58,891 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:39:59,089 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:39:59,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:39:59,094 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 23:39:59,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:39:59 BoogieIcfgContainer [2022-01-10 23:39:59,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:39:59,097 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:39:59,098 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:39:59,098 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:39:59,100 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:39:59" (1/1) ... [2022-01-10 23:39:59,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:39:59 BasicIcfg [2022-01-10 23:39:59,174 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:39:59,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:39:59,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:39:59,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:39:59,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:39:58" (1/4) ... [2022-01-10 23:39:59,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f44fb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:39:59, skipping insertion in model container [2022-01-10 23:39:59,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:39:58" (2/4) ... [2022-01-10 23:39:59,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f44fb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:39:59, skipping insertion in model container [2022-01-10 23:39:59,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:39:59" (3/4) ... [2022-01-10 23:39:59,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f44fb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:39:59, skipping insertion in model container [2022-01-10 23:39:59,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:39:59" (4/4) ... [2022-01-10 23:39:59,180 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.iTransformedIcfg [2022-01-10 23:39:59,183 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:39:59,183 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:39:59,231 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:39:59,236 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:39:59,236 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:39:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:39:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:39:59,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:39:59,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:39:59,250 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:39:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:39:59,255 INFO L85 PathProgramCache]: Analyzing trace with hash 242788213, now seen corresponding path program 1 times [2022-01-10 23:39:59,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:39:59,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399720357] [2022-01-10 23:39:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:39:59,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:39:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:39:59,438 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:39:59,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:39:59,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399720357] [2022-01-10 23:39:59,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399720357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:39:59,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:39:59,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:39:59,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885755768] [2022-01-10 23:39:59,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:39:59,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:39:59,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:39:59,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:39:59,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:39:59,467 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:39:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:39:59,478 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. [2022-01-10 23:39:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:39:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 23:39:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:39:59,485 INFO L225 Difference]: With dead ends: 48 [2022-01-10 23:39:59,485 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 23:39:59,491 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:39:59,494 INFO L933 BasicCegarLoop]: 35 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, 35 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:39:59,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:39:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 23:39:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 23:39:59,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:39:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-10 23:39:59,518 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2022-01-10 23:39:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:39:59,519 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-10 23:39:59,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:39:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-10 23:39:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:39:59,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:39:59,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:39:59,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:39:59,521 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:39:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:39:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash 836889848, now seen corresponding path program 1 times [2022-01-10 23:39:59,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:39:59,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854475279] [2022-01-10 23:39:59,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:39:59,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:39:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:39:59,669 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:39:59,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:39:59,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854475279] [2022-01-10 23:39:59,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854475279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:39:59,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:39:59,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:39:59,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408914750] [2022-01-10 23:39:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:39:59,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:39:59,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:39:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:39:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:39:59,673 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:39:59,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:39:59,692 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-01-10 23:39:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:39:59,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 23:39:59,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:39:59,694 INFO L225 Difference]: With dead ends: 37 [2022-01-10 23:39:59,694 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 23:39:59,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:39:59,699 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:39:59,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:39:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 23:39:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-01-10 23:39:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:39:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-01-10 23:39:59,709 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2022-01-10 23:39:59,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:39:59,710 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-01-10 23:39:59,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:39:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-01-10 23:39:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:39:59,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:39:59,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:39:59,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:39:59,711 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:39:59,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:39:59,711 INFO L85 PathProgramCache]: Analyzing trace with hash 865518999, now seen corresponding path program 1 times [2022-01-10 23:39:59,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:39:59,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665351092] [2022-01-10 23:39:59,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:39:59,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:39:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:00,020 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:40:00,020 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:40:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665351092] [2022-01-10 23:40:00,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665351092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:40:00,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:40:00,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 23:40:00,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101586767] [2022-01-10 23:40:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:40:00,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 23:40:00,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:40:00,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 23:40:00,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:40:00,023 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:40:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:40:00,261 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-01-10 23:40:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:40:00,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 23:40:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:40:00,263 INFO L225 Difference]: With dead ends: 37 [2022-01-10 23:40:00,263 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 23:40:00,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-01-10 23:40:00,266 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:40:00,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 60 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:40:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 23:40:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-01-10 23:40:00,270 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:40:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-10 23:40:00,270 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2022-01-10 23:40:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:40:00,270 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-10 23:40:00,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:40:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-10 23:40:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:40:00,271 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:40:00,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:40:00,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:40:00,271 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:40:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:40:00,272 INFO L85 PathProgramCache]: Analyzing trace with hash 865520022, now seen corresponding path program 1 times [2022-01-10 23:40:00,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:40:00,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720583664] [2022-01-10 23:40:00,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:40:00,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:40:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:00,382 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:40:00,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:40:00,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720583664] [2022-01-10 23:40:00,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720583664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:40:00,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:40:00,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:40:00,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117286474] [2022-01-10 23:40:00,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:40:00,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:40:00,384 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:40:00,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:40:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:40:00,384 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:40:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:40:00,400 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-01-10 23:40:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:40:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 23:40:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:40:00,401 INFO L225 Difference]: With dead ends: 50 [2022-01-10 23:40:00,401 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 23:40:00,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:40:00,409 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:40:00,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:40:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 23:40:00,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-01-10 23:40:00,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:40:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-01-10 23:40:00,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 15 [2022-01-10 23:40:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:40:00,421 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-01-10 23:40:00,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:40:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-01-10 23:40:00,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 23:40:00,421 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:40:00,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:40:00,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:40:00,422 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:40:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:40:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1299178569, now seen corresponding path program 1 times [2022-01-10 23:40:00,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:40:00,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696309108] [2022-01-10 23:40:00,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:40:00,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:40:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:00,576 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:40:00,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:40:00,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696309108] [2022-01-10 23:40:00,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696309108] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:40:00,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094953145] [2022-01-10 23:40:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:40:00,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:40:00,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:40:00,578 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:40:00,579 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:40:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:00,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-10 23:40:00,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:40:01,011 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:40:01,125 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:40:01,129 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:40:01,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:01,135 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 23:40:01,197 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:40:01,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 67 [2022-01-10 23:40:01,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:01,205 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-01-10 23:40:01,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:01,213 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 40 treesize of output 38 [2022-01-10 23:40:01,258 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 32 treesize of output 20 [2022-01-10 23:40:01,267 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 33 treesize of output 17 [2022-01-10 23:40:01,301 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:40:01,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:40:01,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:40:01,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094953145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:40:01,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:40:01,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2022-01-10 23:40:01,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238003590] [2022-01-10 23:40:01,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:40:01,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 23:40:01,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:40:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 23:40:01,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:40:01,319 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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:40:01,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:40:01,615 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-01-10 23:40:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 23:40:01,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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:40:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:40:01,617 INFO L225 Difference]: With dead ends: 35 [2022-01-10 23:40:01,617 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 23:40:01,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-01-10 23:40:01,617 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 67 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:40:01,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 68 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:40:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 23:40:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-01-10 23:40:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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:40:01,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-10 23:40:01,622 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2022-01-10 23:40:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:40:01,622 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-10 23:40:01,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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:40:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-10 23:40:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:40:01,623 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:40:01,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:40:01,651 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:40:01,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:40:01,836 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:40:01,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:40:01,836 INFO L85 PathProgramCache]: Analyzing trace with hash 641854238, now seen corresponding path program 1 times [2022-01-10 23:40:01,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:40:01,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93119979] [2022-01-10 23:40:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:40:01,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:40:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:40:02,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:40:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93119979] [2022-01-10 23:40:02,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93119979] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:40:02,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431397955] [2022-01-10 23:40:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:40:02,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:40:02,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:40:02,125 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:40:02,126 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:40:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:02,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-10 23:40:02,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:40:02,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:02,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-10 23:40:02,466 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-10 23:40:02,466 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 24 treesize of output 35 [2022-01-10 23:40:02,538 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-01-10 23:40:02,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 56 [2022-01-10 23:40:02,546 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 22 treesize of output 10 [2022-01-10 23:40:02,567 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:40:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:40:02,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 23:40:02,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431397955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:40:02,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 23:40:02,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 23 [2022-01-10 23:40:02,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248360383] [2022-01-10 23:40:02,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:40:02,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 23:40:02,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:40:02,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 23:40:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-01-10 23:40:02,582 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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:40:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:40:02,846 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-01-10 23:40:02,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 23:40:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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) Word has length 21 [2022-01-10 23:40:02,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:40:02,847 INFO L225 Difference]: With dead ends: 38 [2022-01-10 23:40:02,847 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 23:40:02,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=813, Unknown=0, NotChecked=0, Total=992 [2022-01-10 23:40:02,848 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 118 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:40:02,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 37 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 108 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-01-10 23:40:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 23:40:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-01-10 23:40:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:40:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-10 23:40:02,853 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 21 [2022-01-10 23:40:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:40:02,853 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-10 23:40:02,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 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:40:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-10 23:40:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 23:40:02,853 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:40:02,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:40:02,872 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:40:03,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 23:40:03,064 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:40:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:40:03,064 INFO L85 PathProgramCache]: Analyzing trace with hash 641855261, now seen corresponding path program 1 times [2022-01-10 23:40:03,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:40:03,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575893978] [2022-01-10 23:40:03,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:40:03,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:40:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:40:03,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:40:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575893978] [2022-01-10 23:40:03,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575893978] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:40:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696189586] [2022-01-10 23:40:03,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:40:03,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:40:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:40:03,127 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:40:03,128 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:40:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:40:03,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 102 conjunts are in the unsatisfiable core [2022-01-10 23:40:03,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:40:03,339 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:40:03,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:03,379 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:40:03,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:03,599 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 31 treesize of output 31 [2022-01-10 23:40:03,615 INFO L353 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2022-01-10 23:40:03,615 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 35 [2022-01-10 23:40:03,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:03,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-10 23:40:03,627 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 8 treesize of output 7 [2022-01-10 23:40:03,635 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 23:40:03,954 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:40:03,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 74 [2022-01-10 23:40:03,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:03,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:03,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:40:03,966 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 23:40:03,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-01-10 23:40:03,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:03,971 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 53 treesize of output 40 [2022-01-10 23:40:04,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:04,067 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 46 treesize of output 44 [2022-01-10 23:40:04,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:04,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:04,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:40:04,080 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 23:40:04,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2022-01-10 23:40:04,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:04,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:40:04,097 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-10 23:40:04,097 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 60 [2022-01-10 23:40:04,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-10 23:40:04,166 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 32 treesize of output 20 [2022-01-10 23:40:04,169 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 33 treesize of output 17 [2022-01-10 23:40:04,201 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:40:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:40:04,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:40:04,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt| v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_398)) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt| v_ArrVal_399) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse0)) (not (<= 0 .cse0))))) is different from false [2022-01-10 23:40:04,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~snd_to_last~0#1.baseInt|) .cse1 v_ArrVal_393)) |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt| v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~snd_to_last~0#1.baseInt|) .cse1 v_ArrVal_394)))) (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt| (store (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_398))) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~snd_to_last~0#1.baseInt| v_ArrVal_396) |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.baseInt| v_ArrVal_399) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse2)) (not (<= 0 .cse2)) (not (<= v_ArrVal_393 |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~new_node~0#1.offsetInt|)))))) is different from false [2022-01-10 23:40:04,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3| Int) (v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.offsetInt|)) (.cse3 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3| 4) 18446744073709551616))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| .cse2 (store (select |c_#memory_$Pointer$.offsetInt| .cse2) .cse3 v_ArrVal_393)) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (not (<= v_ArrVal_393 |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt|)) (= (select (select (let ((.cse1 (store |c_#memory_intInt| .cse2 (store (select |c_#memory_intInt| .cse2) .cse3 v_ArrVal_394)))) (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| (store (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.offsetInt| 4) 18446744073709551616) v_ArrVal_398))) (select (select (store (store |c_#memory_$Pointer$.baseInt| .cse2 v_ArrVal_396) |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| v_ArrVal_399) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse0) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3| (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.offsetInt|))))))) is different from false [2022-01-10 23:40:04,632 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:40:04,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 149 [2022-01-10 23:40:04,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3| Int) (v_ArrVal_398 Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_390 (Array Int Int)) (v_ArrVal_394 Int) (v_ArrVal_393 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_389 (Array Int Int)) (v_ArrVal_400 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_389))) (let ((.cse6 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_390)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.offsetInt|)) (.cse4 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3| 4) 18446744073709551616))) (let ((.cse0 (select (select (store (store .cse6 .cse3 (store (select .cse6 .cse3) .cse4 v_ArrVal_393)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_400) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= v_ArrVal_393 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) (not (<= 0 .cse0)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_arrayElimArr_1))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_394))))) (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_398))) (select (select (store (store .cse5 .cse3 v_ArrVal_396) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_399) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) .cse0) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|) (not (<= |v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3| (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_sll_insert_~head#1.offsetInt|))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_sll_insert_~last~0#1.offsetInt_3|)) (not (= (select v_arrayElimArr_1 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_node_create_~data#1Int|))))))) is different from false [2022-01-10 23:40:05,199 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 4424 treesize of output 4184 [2022-01-10 23:40:05,217 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 4180 treesize of output 3718 [2022-01-10 23:40:05,238 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 3650 treesize of output 3630 [2022-01-10 23:40:05,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:40:05,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 296480 treesize of output 294310 [2022-01-10 23:40:05,802 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 290150 treesize of output 285990 [2022-01-10 23:40:06,272 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 324512 treesize of output 322308 [2022-01-10 23:40:06,706 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 322288 treesize of output 317896