/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:54:59,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:54:59,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:54:59,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:54:59,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:54:59,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:54:59,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:54:59,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:54:59,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:54:59,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:54:59,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:54:59,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:54:59,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:54:59,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:54:59,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:54:59,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:54:59,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:54:59,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:54:59,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:54:59,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:54:59,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:54:59,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:54:59,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:54:59,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:54:59,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:54:59,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:54:59,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:54:59,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:54:59,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:54:59,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:54:59,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:54:59,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:54:59,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:54:59,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:54:59,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:54:59,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:54:59,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:54:59,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:54:59,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:54:59,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:54:59,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:54:59,821 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:54:59,835 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:54:59,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:54:59,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:54:59,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:54:59,836 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:54:59,836 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:54:59,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:54:59,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:54:59,836 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:54:59,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:54:59,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:54:59,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:54:59,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:54:59,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 00:55:00,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:55:00,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:55:00,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:55:00,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:55:00,020 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:55:00,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2022-01-10 00:55:00,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209be0a1b/65178a424f804f4f8f4837336fb09ceb/FLAG835c281e3 [2022-01-10 00:55:00,463 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:55:00,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_insert_equal.i [2022-01-10 00:55:00,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209be0a1b/65178a424f804f4f8f4837336fb09ceb/FLAG835c281e3 [2022-01-10 00:55:00,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/209be0a1b/65178a424f804f4f8f4837336fb09ceb [2022-01-10 00:55:00,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:55:00,493 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:55:00,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:55:00,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:55:00,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:55:00,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777165de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00, skipping insertion in model container [2022-01-10 00:55:00,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:55:00,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:55:00,773 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/sll2c_insert_equal.i[24601,24614] [2022-01-10 00:55:00,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:55:00,781 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:55:00,812 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/sll2c_insert_equal.i[24601,24614] [2022-01-10 00:55:00,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:55:00,830 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:55:00,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00 WrapperNode [2022-01-10 00:55:00,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:55:00,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:55:00,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:55:00,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:55:00,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,881 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2022-01-10 00:55:00,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:55:00,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:55:00,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:55:00,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:55:00,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:55:00,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:55:00,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:55:00,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:55:00,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (1/1) ... [2022-01-10 00:55:00,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:55:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:00,932 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 00:55:00,957 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 00:55:00,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:55:00,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:55:00,975 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 00:55:00,975 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 00:55:00,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:55:00,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:55:00,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 00:55:00,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:55:00,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:55:00,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:55:00,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 00:55:00,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:55:00,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:55:00,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:55:01,105 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:55:01,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:55:01,297 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:55:01,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:55:01,301 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 00:55:01,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:01 BoogieIcfgContainer [2022-01-10 00:55:01,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:55:01,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:55:01,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:55:01,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:55:01,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:55:00" (1/3) ... [2022-01-10 00:55:01,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315dc1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:01, skipping insertion in model container [2022-01-10 00:55:01,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:55:00" (2/3) ... [2022-01-10 00:55:01,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315dc1cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:55:01, skipping insertion in model container [2022-01-10 00:55:01,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:55:01" (3/3) ... [2022-01-10 00:55:01,307 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-01-10 00:55:01,310 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:55:01,310 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:55:01,350 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:55:01,356 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 00:55:01,356 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:55:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:55:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:55:01,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:01,370 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:01,371 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2022-01-10 00:55:01,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:01,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520343158] [2022-01-10 00:55:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:01,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:55:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:55:01,591 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:01,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520343158] [2022-01-10 00:55:01,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520343158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:55:01,592 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:55:01,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:55:01,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641042643] [2022-01-10 00:55:01,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:55:01,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:55:01,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:55:01,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:55:01,614 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:55:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:01,676 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-01-10 00:55:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:55:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-10 00:55:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:01,696 INFO L225 Difference]: With dead ends: 65 [2022-01-10 00:55:01,696 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 00:55:01,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 00:55:01,700 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:01,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:55:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 00:55:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 00:55:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:55:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-01-10 00:55:01,721 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2022-01-10 00:55:01,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:01,721 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-01-10 00:55:01,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:55:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-01-10 00:55:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:55:01,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:01,724 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:01,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:55:01,724 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:01,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2022-01-10 00:55:01,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091348956] [2022-01-10 00:55:01,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:01,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:01,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-10 00:55:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:55:01,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:01,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091348956] [2022-01-10 00:55:01,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091348956] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:55:01,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:55:01,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:55:01,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807927860] [2022-01-10 00:55:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:55:01,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:55:01,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:55:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:55:01,868 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:55:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:01,907 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-01-10 00:55:01,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:55:01,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-01-10 00:55:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:01,909 INFO L225 Difference]: With dead ends: 52 [2022-01-10 00:55:01,909 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 00:55:01,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:55:01,914 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:01,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:55:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 00:55:01,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-01-10 00:55:01,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:55:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-01-10 00:55:01,923 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2022-01-10 00:55:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:01,924 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-01-10 00:55:01,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 00:55:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-01-10 00:55:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 00:55:01,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:01,926 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:01,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:55:01,926 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2022-01-10 00:55:01,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:01,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213401176] [2022-01-10 00:55:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:01,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:55:02,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:02,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213401176] [2022-01-10 00:55:02,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213401176] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:55:02,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:55:02,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 00:55:02,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789372613] [2022-01-10 00:55:02,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:55:02,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:55:02,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:55:02,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:55:02,024 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:55:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:02,055 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-01-10 00:55:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:55:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-01-10 00:55:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:02,056 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:55:02,056 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 00:55:02,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 00:55:02,057 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:02,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:55:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 00:55:02,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-01-10 00:55:02,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:55:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-01-10 00:55:02,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 33 [2022-01-10 00:55:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:02,062 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-01-10 00:55:02,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:55:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-01-10 00:55:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-10 00:55:02,062 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:02,062 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:02,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 00:55:02,063 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2022-01-10 00:55:02,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:02,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717077043] [2022-01-10 00:55:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:02,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:55:02,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:02,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717077043] [2022-01-10 00:55:02,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717077043] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:02,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99592497] [2022-01-10 00:55:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:02,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:02,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:02,860 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 00:55:02,861 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 00:55:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:03,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 130 conjunts are in the unsatisfiable core [2022-01-10 00:55:03,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:03,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:55:03,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 00:55:03,328 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:55:03,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-10 00:55:03,456 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:55:03,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:03,517 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 13 treesize of output 9 [2022-01-10 00:55:03,591 INFO L353 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-01-10 00:55:03,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-01-10 00:55:03,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 00:55:03,774 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:55:03,943 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-01-10 00:55:03,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 00:55:03,955 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:04,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:04,166 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 35 treesize of output 33 [2022-01-10 00:55:04,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:04,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 00:55:04,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:04,187 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 00:55:04,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-01-10 00:55:04,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:04,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:55:04,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:04,488 INFO L353 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-01-10 00:55:04,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 78 [2022-01-10 00:55:04,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:04,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-01-10 00:55:04,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2022-01-10 00:55:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:04,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-01-10 00:55:04,513 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 00:55:04,600 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 38 treesize of output 22 [2022-01-10 00:55:04,605 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-01-10 00:55:04,652 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 00:55:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:55:04,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:55:04,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_433 Int) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_433)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_436) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_428) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_427) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-01-10 00:55:04,779 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_433 Int) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_430 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_433)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_436) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_428) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_427) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-01-10 00:55:04,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_433 Int) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_430 (Array Int Int))) (or (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_433)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_436) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_428) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_427) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-01-10 00:55:04,911 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| Int) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_433 Int) (v_ArrVal_427 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| Int) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_445))) (or (< (select (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6|) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_444))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_446))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| v_ArrVal_433))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_436) (select (select (store (store .cse3 .cse2 v_ArrVal_428) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_430) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse0 .cse2 (store (select .cse0 .cse2) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_6| 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9| v_ArrVal_427) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_9|) 0))))) is different from false [2022-01-10 00:55:04,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99592497] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:04,913 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:55:04,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2022-01-10 00:55:04,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146149222] [2022-01-10 00:55:04,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:55:04,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-10 00:55:04,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-10 00:55:04,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1843, Unknown=6, NotChecked=356, Total=2352 [2022-01-10 00:55:04,922 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:05,584 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-01-10 00:55:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:55:05,585 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-01-10 00:55:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:05,586 INFO L225 Difference]: With dead ends: 55 [2022-01-10 00:55:05,587 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 00:55:05,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=198, Invalid=2362, Unknown=6, NotChecked=404, Total=2970 [2022-01-10 00:55:05,588 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:05,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 302 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 654 Invalid, 0 Unknown, 70 Unchecked, 0.4s Time] [2022-01-10 00:55:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 00:55:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2022-01-10 00:55:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:55:05,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-01-10 00:55:05,593 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 34 [2022-01-10 00:55:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:05,594 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2022-01-10 00:55:05,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:05,594 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-01-10 00:55:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 00:55:05,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:05,595 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:05,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 00:55:05,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:05,812 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2022-01-10 00:55:05,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:05,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863694861] [2022-01-10 00:55:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:05,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:05,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:05,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:05,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 00:55:05,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:05,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863694861] [2022-01-10 00:55:05,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863694861] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:05,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023115175] [2022-01-10 00:55:05,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:55:05,906 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:05,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:05,907 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 00:55:05,919 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 00:55:06,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:55:06,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:55:06,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 00:55:06,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:55:06,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:55:06,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023115175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:55:06,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:55:06,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-01-10 00:55:06,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607791000] [2022-01-10 00:55:06,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:55:06,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 00:55:06,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:06,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 00:55:06,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:55:06,110 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:55:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:06,135 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-01-10 00:55:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 00:55:06,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-01-10 00:55:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:06,136 INFO L225 Difference]: With dead ends: 56 [2022-01-10 00:55:06,136 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 00:55:06,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:55:06,139 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 31 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:06,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:55:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 00:55:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-01-10 00:55:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:55:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2022-01-10 00:55:06,150 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 35 [2022-01-10 00:55:06,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:06,151 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2022-01-10 00:55:06,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:55:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-01-10 00:55:06,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 00:55:06,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:06,155 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:06,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 00:55:06,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:06,371 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 342309400, now seen corresponding path program 1 times [2022-01-10 00:55:06,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:06,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192871668] [2022-01-10 00:55:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:06,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,480 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 00:55:06,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192871668] [2022-01-10 00:55:06,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192871668] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:06,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087346659] [2022-01-10 00:55:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:06,480 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:06,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:06,488 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 00:55:06,489 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 00:55:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 00:55:06,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:55:06,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:55:06,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087346659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:55:06,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:55:06,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-01-10 00:55:06,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932868634] [2022-01-10 00:55:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:55:06,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:55:06,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:55:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:55:06,688 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:55:06,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:06,709 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2022-01-10 00:55:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:55:06,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2022-01-10 00:55:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:06,710 INFO L225 Difference]: With dead ends: 54 [2022-01-10 00:55:06,710 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 00:55:06,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:55:06,711 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:06,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:55:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 00:55:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 00:55:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:55:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-01-10 00:55:06,715 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 35 [2022-01-10 00:55:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:06,715 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-01-10 00:55:06,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 00:55:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-01-10 00:55:06,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:55:06,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:06,716 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:06,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:06,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:06,916 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:06,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2022-01-10 00:55:06,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:06,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915955066] [2022-01-10 00:55:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:06,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:06,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:55:06,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:06,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915955066] [2022-01-10 00:55:06,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915955066] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:06,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397710905] [2022-01-10 00:55:06,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:06,990 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:06,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:06,996 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:55:06,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 00:55:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:07,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-10 00:55:07,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:07,195 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 00:55:07,198 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 00:55:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:55:07,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:55:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 00:55:07,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397710905] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:55:07,309 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:55:07,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-01-10 00:55:07,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809527813] [2022-01-10 00:55:07,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:55:07,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 00:55:07,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:07,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 00:55:07,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-10 00:55:07,310 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:55:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:07,369 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-01-10 00:55:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 00:55:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-01-10 00:55:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:07,370 INFO L225 Difference]: With dead ends: 60 [2022-01-10 00:55:07,370 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 00:55:07,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-10 00:55:07,371 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:07,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:55:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 00:55:07,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-01-10 00:55:07,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:55:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2022-01-10 00:55:07,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 36 [2022-01-10 00:55:07,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:07,376 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-01-10 00:55:07,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:55:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-01-10 00:55:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 00:55:07,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:07,377 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:07,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:07,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:07,588 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash -268258536, now seen corresponding path program 1 times [2022-01-10 00:55:07,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:07,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441204325] [2022-01-10 00:55:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:07,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:07,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:55:07,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:07,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441204325] [2022-01-10 00:55:07,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441204325] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:07,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454564188] [2022-01-10 00:55:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:07,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:07,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:55:07,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 00:55:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:07,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-10 00:55:07,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:08,084 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 17 treesize of output 9 [2022-01-10 00:55:08,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:08,155 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 24 treesize of output 24 [2022-01-10 00:55:08,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-01-10 00:55:08,260 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:55:08,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:55:08,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| Int) (v_ArrVal_1220 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_15| v_ArrVal_1220) |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) 0)))) is different from false [2022-01-10 00:55:08,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454564188] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:08,328 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:55:08,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2022-01-10 00:55:08,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594161547] [2022-01-10 00:55:08,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:55:08,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 00:55:08,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:08,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 00:55:08,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=668, Unknown=1, NotChecked=52, Total=812 [2022-01-10 00:55:08,329 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:55:08,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:08,529 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-01-10 00:55:08,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 00:55:08,529 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2022-01-10 00:55:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:08,530 INFO L225 Difference]: With dead ends: 51 [2022-01-10 00:55:08,530 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 00:55:08,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=987, Unknown=1, NotChecked=64, Total=1190 [2022-01-10 00:55:08,531 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:08,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 246 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-01-10 00:55:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 00:55:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-01-10 00:55:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:55:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-01-10 00:55:08,536 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 36 [2022-01-10 00:55:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:08,536 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-01-10 00:55:08,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 00:55:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-01-10 00:55:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:55:08,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:08,536 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:08,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:08,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:08,747 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:08,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:08,748 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2022-01-10 00:55:08,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:08,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803308628] [2022-01-10 00:55:08,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:08,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:09,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:09,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:55:09,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803308628] [2022-01-10 00:55:09,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803308628] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:09,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809728975] [2022-01-10 00:55:09,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:09,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:09,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:09,185 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:55:09,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 00:55:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:09,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 89 conjunts are in the unsatisfiable core [2022-01-10 00:55:09,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:09,372 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:55:09,558 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:55:09,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:55:09,604 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:09,680 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:55:09,680 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 28 treesize of output 29 [2022-01-10 00:55:09,767 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 00:55:09,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 21 [2022-01-10 00:55:09,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:09,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:09,918 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:55:09,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 58 [2022-01-10 00:55:09,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:09,925 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 44 treesize of output 44 [2022-01-10 00:55:09,937 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-01-10 00:55:09,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 00:55:10,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,161 INFO L353 Elim1Store]: treesize reduction 55, result has 48.6 percent of original size [2022-01-10 00:55:10,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 108 treesize of output 132 [2022-01-10 00:55:10,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-01-10 00:55:10,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,206 INFO L353 Elim1Store]: treesize reduction 43, result has 38.6 percent of original size [2022-01-10 00:55:10,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 111 [2022-01-10 00:55:10,231 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 00:55:10,231 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 37 treesize of output 43 [2022-01-10 00:55:10,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,251 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 00:55:10,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 56 [2022-01-10 00:55:10,335 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 12 treesize of output 11 [2022-01-10 00:55:10,360 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 24 treesize of output 20 [2022-01-10 00:55:10,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,853 INFO L353 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-01-10 00:55:10,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 135 [2022-01-10 00:55:10,867 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 11 treesize of output 5 [2022-01-10 00:55:10,876 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 11 treesize of output 5 [2022-01-10 00:55:10,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:10,989 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 132 [2022-01-10 00:55:11,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 00:55:11,026 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2022-01-10 00:55:11,049 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 11 treesize of output 5 [2022-01-10 00:55:11,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:11,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:11,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2022-01-10 00:55:11,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:11,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:11,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2022-01-10 00:55:12,016 INFO L353 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-01-10 00:55:12,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 36 treesize of output 48 [2022-01-10 00:55:12,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2022-01-10 00:55:12,128 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 13 treesize of output 11 [2022-01-10 00:55:12,406 INFO L353 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-01-10 00:55:12,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 63 [2022-01-10 00:55:12,747 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 28 treesize of output 20 [2022-01-10 00:55:12,868 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 00:55:12,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2022-01-10 00:55:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:55:12,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:55:12,895 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1404) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-01-10 00:55:12,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1399 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (not (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1404) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-01-10 00:55:12,914 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1399 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int)) (not (let ((.cse0 (let ((.cse2 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1404) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1399) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-01-10 00:55:12,973 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1404 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19| Int) (v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1399 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| Int) (v_ArrVal_1409 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19|) 0)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19| |c_#StackHeapBarrier|)) (not (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19| v_ArrVal_1410))) (let ((.cse4 (select .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (store (store .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse4 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19| (store (select (store .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1404) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse4 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19| v_ArrVal_1409))) (store .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_19| v_ArrVal_1399) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-01-10 00:55:12,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809728975] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:12,975 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:55:12,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 42 [2022-01-10 00:55:12,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129709054] [2022-01-10 00:55:12,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:55:12,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-10 00:55:12,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-10 00:55:12,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1603, Unknown=7, NotChecked=332, Total=2070 [2022-01-10 00:55:12,977 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 42 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:13,688 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-01-10 00:55:13,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 00:55:13,688 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2022-01-10 00:55:13,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:13,689 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:55:13,689 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 00:55:13,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=218, Invalid=2653, Unknown=7, NotChecked=428, Total=3306 [2022-01-10 00:55:13,690 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:13,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 290 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 520 Invalid, 0 Unknown, 41 Unchecked, 0.3s Time] [2022-01-10 00:55:13,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 00:55:13,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-10 00:55:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-10 00:55:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-01-10 00:55:13,696 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 37 [2022-01-10 00:55:13,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:13,696 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-01-10 00:55:13,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 33 states have internal predecessors, (55), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2022-01-10 00:55:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 00:55:13,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:13,696 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:13,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:13,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:13,914 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:13,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:13,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1102755574, now seen corresponding path program 1 times [2022-01-10 00:55:13,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:13,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985639890] [2022-01-10 00:55:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:13,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:14,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:14,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:55:14,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:14,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985639890] [2022-01-10 00:55:14,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985639890] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:14,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948078512] [2022-01-10 00:55:14,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:14,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:14,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:14,445 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:55:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 00:55:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:14,696 WARN L261 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 191 conjunts are in the unsatisfiable core [2022-01-10 00:55:14,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:14,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:55:14,778 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 13 treesize of output 9 [2022-01-10 00:55:15,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 00:55:15,132 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:55:15,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:55:15,141 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 16 treesize of output 18 [2022-01-10 00:55:15,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:15,216 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:15,223 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 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-10 00:55:15,328 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:55:15,329 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 68 treesize of output 61 [2022-01-10 00:55:15,333 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 0 case distinctions, treesize of input 38 treesize of output 36 [2022-01-10 00:55:15,336 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 18 treesize of output 20 [2022-01-10 00:55:15,506 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:55:15,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-01-10 00:55:15,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:15,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:55:15,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 00:55:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 00:55:15,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,723 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 00:55:15,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 77 [2022-01-10 00:55:15,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-01-10 00:55:15,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:15,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-10 00:55:15,749 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 00:55:15,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 00:55:16,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:16,157 INFO L353 Elim1Store]: treesize reduction 98, result has 25.8 percent of original size [2022-01-10 00:55:16,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 210 treesize of output 130 [2022-01-10 00:55:16,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:16,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 46 [2022-01-10 00:55:16,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2022-01-10 00:55:16,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:16,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:16,187 INFO L353 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2022-01-10 00:55:16,187 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 59 [2022-01-10 00:55:16,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 00:55:17,071 INFO L353 Elim1Store]: treesize reduction 72, result has 18.2 percent of original size [2022-01-10 00:55:17,072 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 254 treesize of output 123 [2022-01-10 00:55:19,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:19,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:19,019 INFO L353 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-01-10 00:55:19,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-01-10 00:55:19,267 INFO L353 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-01-10 00:55:19,267 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 43 treesize of output 46 [2022-01-10 00:55:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:55:19,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:55:19,428 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 Int) (v_ArrVal_1607 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))) (.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1607))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1609))) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 8)))))) is different from false [2022-01-10 00:55:19,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1609 Int) (v_ArrVal_1607 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse8 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse8 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (.cse1 (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse6 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse6 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1607))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1609))) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 8)))))) is different from false [2022-01-10 00:55:19,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1609 Int) (v_ArrVal_1607 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (let ((.cse9 (select |c_#memory_$Pointer$.offset| .cse1))) (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse1 (store .cse9 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (store .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse9 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))) (.cse2 (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse1))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 (store .cse7 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse7 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1607))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1609))) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8))))))) is different from false [2022-01-10 00:55:19,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:55:19,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 541 treesize of output 542 [2022-01-10 00:55:19,640 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1625 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1624 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1609 Int) (v_ArrVal_1607 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23|) 0)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| |c_#StackHeapBarrier|)) (= (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| v_ArrVal_1624))) (let ((.cse1 (select (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| v_ArrVal_1625))) (let ((.cse10 (select .cse11 .cse1))) (let ((.cse9 (store .cse11 .cse1 (store .cse10 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| 0)))) (store .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| (store (select .cse9 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23|) 0 (select .cse10 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (.cse2 (let ((.cse7 (select .cse8 .cse1))) (let ((.cse6 (store .cse8 .cse1 (store .cse7 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23|)))) (store .cse6 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| (store (select .cse6 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23|) 0 (select .cse7 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| v_arrayElimArr_10) .cse1 v_ArrVal_1607))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_23|) 0 v_ArrVal_1609))) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8)))))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select v_arrayElimArr_10 8) |c_ULTIMATE.start_sll_circular_insert_~data#1|)))) is different from false [2022-01-10 00:55:19,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948078512] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:19,642 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:55:19,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 46 [2022-01-10 00:55:19,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17105849] [2022-01-10 00:55:19,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:55:19,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-01-10 00:55:19,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-01-10 00:55:19,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2199, Unknown=7, NotChecked=388, Total=2756 [2022-01-10 00:55:19,644 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 46 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 37 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:20,401 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2022-01-10 00:55:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-10 00:55:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 37 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2022-01-10 00:55:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:20,402 INFO L225 Difference]: With dead ends: 68 [2022-01-10 00:55:20,402 INFO L226 Difference]: Without dead ends: 66 [2022-01-10 00:55:20,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=240, Invalid=3191, Unknown=7, NotChecked=468, Total=3906 [2022-01-10 00:55:20,403 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:20,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 327 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 55 Unchecked, 0.3s Time] [2022-01-10 00:55:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-10 00:55:20,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-01-10 00:55:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 00:55:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2022-01-10 00:55:20,409 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 38 [2022-01-10 00:55:20,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:20,410 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2022-01-10 00:55:20,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 37 states have internal predecessors, (62), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-01-10 00:55:20,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-10 00:55:20,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:20,410 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:20,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:20,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:20,611 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash 14409266, now seen corresponding path program 1 times [2022-01-10 00:55:20,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:20,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053469731] [2022-01-10 00:55:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:20,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:20,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:20,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:21,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:55:21,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:21,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053469731] [2022-01-10 00:55:21,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053469731] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:21,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558213326] [2022-01-10 00:55:21,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:21,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:21,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:21,078 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:55:21,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 00:55:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:21,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 132 conjunts are in the unsatisfiable core [2022-01-10 00:55:21,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:21,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:55:21,677 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:55:21,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:55:21,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:21,799 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:55:21,799 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 28 treesize of output 29 [2022-01-10 00:55:21,920 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 00:55:21,920 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2022-01-10 00:55:21,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:21,927 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 7 treesize of output 3 [2022-01-10 00:55:22,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 00:55:22,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,508 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 00:55:22,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 53 [2022-01-10 00:55:22,523 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 00:55:22,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 00:55:22,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,790 INFO L353 Elim1Store]: treesize reduction 95, result has 15.9 percent of original size [2022-01-10 00:55:22,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 142 treesize of output 66 [2022-01-10 00:55:22,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,794 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2022-01-10 00:55:22,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-01-10 00:55:22,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:22,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 24 [2022-01-10 00:55:23,122 INFO L353 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-01-10 00:55:23,122 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 39 [2022-01-10 00:55:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:55:23,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:55:23,240 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1810 (Array Int Int))) (not (let ((.cse0 (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)))) (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1810))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1))))) is different from false [2022-01-10 00:55:23,249 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1810 (Array Int Int))) (not (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse4 (store .cse7 .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select .cse7 .cse5))))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 (store (select |c_#memory_$Pointer$.offset| .cse4) .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1810))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse1)))))) is different from false [2022-01-10 00:55:23,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558213326] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:23,418 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:55:23,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2022-01-10 00:55:23,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891239527] [2022-01-10 00:55:23,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 00:55:23,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-10 00:55:23,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:23,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-10 00:55:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1915, Unknown=16, NotChecked=178, Total=2256 [2022-01-10 00:55:23,420 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 44 states, 40 states have (on average 1.575) internal successors, (63), 35 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:25,554 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-01-10 00:55:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-10 00:55:25,554 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.575) internal successors, (63), 35 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-01-10 00:55:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:25,555 INFO L225 Difference]: With dead ends: 97 [2022-01-10 00:55:25,555 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 00:55:25,556 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=311, Invalid=3586, Unknown=17, NotChecked=246, Total=4160 [2022-01-10 00:55:25,557 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 128 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:25,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 375 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 655 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2022-01-10 00:55:25,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 00:55:25,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62. [2022-01-10 00:55:25,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 states have internal predecessors, (60), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-10 00:55:25,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-01-10 00:55:25,565 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 41 [2022-01-10 00:55:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:25,565 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-01-10 00:55:25,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.575) internal successors, (63), 35 states have internal predecessors, (63), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 00:55:25,565 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-01-10 00:55:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 00:55:25,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:25,565 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:25,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:25,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 00:55:25,779 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:25,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash 448268940, now seen corresponding path program 3 times [2022-01-10 00:55:25,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:25,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482368682] [2022-01-10 00:55:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:25,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:25,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:25,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:25,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 00:55:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:25,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 00:55:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 00:55:25,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:25,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482368682] [2022-01-10 00:55:25,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482368682] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:25,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348966753] [2022-01-10 00:55:25,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 00:55:25,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:25,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:55:25,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 00:55:26,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 00:55:26,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:55:26,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 00:55:26,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-10 00:55:26,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 00:55:26,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348966753] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:55:26,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 00:55:26,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-01-10 00:55:26,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329955414] [2022-01-10 00:55:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:55:26,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 00:55:26,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:55:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 00:55:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:55:26,180 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:55:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:55:26,194 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-01-10 00:55:26,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 00:55:26,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-01-10 00:55:26,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:55:26,195 INFO L225 Difference]: With dead ends: 78 [2022-01-10 00:55:26,195 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 00:55:26,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 00:55:26,196 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:55:26,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 37 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:55:26,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 00:55:26,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-10 00:55:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:55:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-01-10 00:55:26,202 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 42 [2022-01-10 00:55:26,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:55:26,203 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-01-10 00:55:26,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-10 00:55:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-01-10 00:55:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 00:55:26,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:55:26,204 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:55:26,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-10 00:55:26,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:26,415 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:55:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:55:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 446728416, now seen corresponding path program 2 times [2022-01-10 00:55:26,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:55:26,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262535231] [2022-01-10 00:55:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:55:26,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:55:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 00:55:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:26,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 00:55:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-10 00:55:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:55:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 00:55:27,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:55:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262535231] [2022-01-10 00:55:27,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262535231] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:55:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371412289] [2022-01-10 00:55:27,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:55:27,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:55:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:55:27,234 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 00:55:27,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 00:55:27,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:55:27,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:55:27,416 WARN L261 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 198 conjunts are in the unsatisfiable core [2022-01-10 00:55:27,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:55:27,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 00:55:27,504 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 13 treesize of output 9 [2022-01-10 00:55:27,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:27,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-01-10 00:55:27,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 00:55:27,690 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 7 treesize of output 3 [2022-01-10 00:55:27,694 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 7 treesize of output 3 [2022-01-10 00:55:27,878 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:55:27,879 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 14 treesize of output 20 [2022-01-10 00:55:27,925 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 00:55:27,926 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 14 treesize of output 20 [2022-01-10 00:55:27,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 00:55:27,960 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 00:55:27,960 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 00:55:28,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:28,091 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 19 treesize of output 18 [2022-01-10 00:55:28,100 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 00:55:28,215 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 00:55:28,215 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 104 treesize of output 66 [2022-01-10 00:55:28,219 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 31 treesize of output 26 [2022-01-10 00:55:28,222 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 0 case distinctions, treesize of input 38 treesize of output 25 [2022-01-10 00:55:28,459 INFO L353 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-01-10 00:55:28,459 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 51 [2022-01-10 00:55:28,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:28,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:28,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-01-10 00:55:28,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 00:55:28,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:55:28,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-01-10 00:55:28,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:28,746 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 00:55:28,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 101 [2022-01-10 00:55:28,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:28,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 00:55:28,770 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 00:55:28,771 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 00:55:28,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:28,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:28,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:28,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2022-01-10 00:55:29,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:29,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:29,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:29,339 INFO L353 Elim1Store]: treesize reduction 211, result has 38.3 percent of original size [2022-01-10 00:55:29,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 111 treesize of output 176 [2022-01-10 00:55:29,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:29,440 INFO L353 Elim1Store]: treesize reduction 92, result has 42.9 percent of original size [2022-01-10 00:55:29,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 217 treesize of output 223 [2022-01-10 00:55:29,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-01-10 00:55:29,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:29,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:29,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:29,512 INFO L353 Elim1Store]: treesize reduction 53, result has 33.8 percent of original size [2022-01-10 00:55:29,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 134 [2022-01-10 00:55:29,569 INFO L353 Elim1Store]: treesize reduction 54, result has 45.5 percent of original size [2022-01-10 00:55:29,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 87 [2022-01-10 00:55:29,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2022-01-10 00:55:29,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2022-01-10 00:55:29,751 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-10 00:55:29,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-10 00:55:29,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 00:55:30,001 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 00:55:30,318 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 10 treesize of output 9 [2022-01-10 00:55:30,433 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:55:30,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-01-10 00:55:30,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:30,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-01-10 00:55:31,139 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 00:55:31,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-01-10 00:55:31,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-01-10 00:55:31,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:31,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:55:31,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-01-10 00:55:31,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-01-10 00:55:31,653 INFO L353 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2022-01-10 00:55:31,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 303 treesize of output 291 [2022-01-10 00:55:31,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 00:55:32,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 279 [2022-01-10 00:55:32,666 INFO L353 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-01-10 00:55:32,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 303 treesize of output 1 [2022-01-10 00:55:33,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2022-01-10 00:55:33,651 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 00:55:33,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 42 treesize of output 40 [2022-01-10 00:55:33,912 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 106 treesize of output 82 [2022-01-10 00:55:33,984 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 52 treesize of output 38 [2022-01-10 00:55:34,243 INFO L353 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-01-10 00:55:34,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 177 treesize of output 158 [2022-01-10 00:55:35,132 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 00:55:35,379 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 00:55:36,153 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 63 treesize of output 47