./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:07:55,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:07:55,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:07:55,846 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:07:55,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:07:55,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:07:55,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:07:55,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:07:55,857 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:07:55,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:07:55,864 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:07:55,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:07:55,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:07:55,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:07:55,869 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:07:55,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:07:55,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:07:55,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:07:55,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:07:55,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:07:55,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:07:55,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:07:55,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:07:55,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:07:55,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:07:55,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:07:55,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:07:55,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:07:55,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:07:55,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:07:55,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:07:55,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:07:55,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:07:55,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:07:55,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:07:55,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:07:55,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:07:55,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:07:55,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:07:55,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:07:55,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:07:55,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:07:55,933 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:07:55,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:07:55,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:07:55,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:07:55,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:07:55,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:07:55,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:07:55,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:07:55,936 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:07:55,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:07:55,937 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:07:55,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:07:55,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:07:55,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:07:55,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:07:55,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:07:55,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:07:55,938 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:07:55,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:07:55,939 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:07:55,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:07:55,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:07:55,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:07:55,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:07:55,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:07:55,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:07:55,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:07:55,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:07:55,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:07:55,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:07:55,941 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:07:55,941 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:07:55,942 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:07:55,942 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:07:55,942 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:07:55,942 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-02-16 01:07:56,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:07:56,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:07:56,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:07:56,230 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:07:56,230 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:07:56,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-02-16 01:07:57,426 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:07:57,703 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:07:57,703 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-02-16 01:07:57,713 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1590f677b/d284589fe4374b7d8ea84a371552fb2d/FLAG0e82de0ec [2023-02-16 01:07:57,723 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1590f677b/d284589fe4374b7d8ea84a371552fb2d [2023-02-16 01:07:57,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:07:57,727 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:07:57,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:07:57,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:07:57,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:07:57,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:07:57" (1/1) ... [2023-02-16 01:07:57,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39daf8c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:57, skipping insertion in model container [2023-02-16 01:07:57,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:07:57" (1/1) ... [2023-02-16 01:07:57,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:07:57,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:07:58,001 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-02-16 01:07:58,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:07:58,012 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:07:58,047 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i[24601,24614] [2023-02-16 01:07:58,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:07:58,070 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:07:58,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58 WrapperNode [2023-02-16 01:07:58,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:07:58,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:07:58,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:07:58,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:07:58,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,124 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-02-16 01:07:58,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:07:58,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:07:58,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:07:58,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:07:58,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,169 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:07:58,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:07:58,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:07:58,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:07:58,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (1/1) ... [2023-02-16 01:07:58,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:07:58,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:58,211 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) [2023-02-16 01:07:58,213 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 [2023-02-16 01:07:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:07:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:07:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 01:07:58,245 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 01:07:58,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:07:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:07:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:07:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:07:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:07:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:07:58,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 01:07:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:07:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:07:58,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:07:58,427 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:07:58,428 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:07:58,697 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:07:58,702 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:07:58,710 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 01:07:58,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:07:58 BoogieIcfgContainer [2023-02-16 01:07:58,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:07:58,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:07:58,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:07:58,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:07:58,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:07:57" (1/3) ... [2023-02-16 01:07:58,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9b65ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:07:58, skipping insertion in model container [2023-02-16 01:07:58,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:58" (2/3) ... [2023-02-16 01:07:58,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9b65ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:07:58, skipping insertion in model container [2023-02-16 01:07:58,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:07:58" (3/3) ... [2023-02-16 01:07:58,722 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-02-16 01:07:58,739 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:07:58,739 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:07:58,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:07:58,809 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7baa4b87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:07:58,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:07:58,825 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) [2023-02-16 01:07:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 01:07:58,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:58,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:58,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:58,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:58,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2023-02-16 01:07:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:58,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284613842] [2023-02-16 01:07:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:07:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:07:59,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:59,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284613842] [2023-02-16 01:07:59,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284613842] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:07:59,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:07:59,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:07:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523253213] [2023-02-16 01:07:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:07:59,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:07:59,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:59,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:07:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:07:59,243 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) [2023-02-16 01:07:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:59,328 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2023-02-16 01:07:59,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:07:59,331 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 [2023-02-16 01:07:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:59,337 INFO L225 Difference]: With dead ends: 65 [2023-02-16 01:07:59,337 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 01:07:59,341 INFO L412 NwaCegarLoop]: 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 [2023-02-16 01:07:59,346 INFO L413 NwaCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:59,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:07:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 01:07:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-16 01:07:59,380 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) [2023-02-16 01:07:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-02-16 01:07:59,384 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2023-02-16 01:07:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:59,386 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-02-16 01:07:59,386 INFO L496 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) [2023-02-16 01:07:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-02-16 01:07:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 01:07:59,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:59,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:59,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:07:59,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:59,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:59,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2023-02-16 01:07:59,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:59,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684023181] [2023-02-16 01:07:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:59,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:07:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:07:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:59,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684023181] [2023-02-16 01:07:59,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684023181] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:07:59,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:07:59,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:07:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647741115] [2023-02-16 01:07:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:07:59,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:07:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:07:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:07:59,616 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) [2023-02-16 01:07:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:59,676 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-02-16 01:07:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:07:59,677 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 [2023-02-16 01:07:59,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:59,678 INFO L225 Difference]: With dead ends: 52 [2023-02-16 01:07:59,681 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 01:07:59,686 INFO L412 NwaCegarLoop]: 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 [2023-02-16 01:07:59,689 INFO L413 NwaCegarLoop]: 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 [2023-02-16 01:07:59,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:07:59,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 01:07:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-16 01:07:59,708 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) [2023-02-16 01:07:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-16 01:07:59,714 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2023-02-16 01:07:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:59,715 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-16 01:07:59,715 INFO L496 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) [2023-02-16 01:07:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-16 01:07:59,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 01:07:59,717 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:59,717 INFO L195 NwaCegarLoop]: 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] [2023-02-16 01:07:59,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:07:59,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2023-02-16 01:07:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:59,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255752218] [2023-02-16 01:07:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:59,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 01:07:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:59,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255752218] [2023-02-16 01:07:59,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255752218] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:07:59,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:07:59,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:07:59,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52993699] [2023-02-16 01:07:59,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:07:59,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:07:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:59,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:07:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:07:59,979 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) [2023-02-16 01:08:00,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:00,041 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2023-02-16 01:08:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:08:00,042 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 [2023-02-16 01:08:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:00,045 INFO L225 Difference]: With dead ends: 47 [2023-02-16 01:08:00,045 INFO L226 Difference]: Without dead ends: 39 [2023-02-16 01:08:00,047 INFO L412 NwaCegarLoop]: 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 [2023-02-16 01:08:00,051 INFO L413 NwaCegarLoop]: 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 [2023-02-16 01:08:00,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 87 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:08:00,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-16 01:08:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2023-02-16 01:08:00,063 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) [2023-02-16 01:08:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-02-16 01:08:00,065 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 33 [2023-02-16 01:08:00,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:00,066 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-02-16 01:08:00,066 INFO L496 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) [2023-02-16 01:08:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-02-16 01:08:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 01:08:00,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:00,069 INFO L195 NwaCegarLoop]: 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] [2023-02-16 01:08:00,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 01:08:00,069 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:00,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2023-02-16 01:08:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:00,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47092973] [2023-02-16 01:08:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:02,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:03,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:03,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47092973] [2023-02-16 01:08:03,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47092973] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:03,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679175458] [2023-02-16 01:08:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:03,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:03,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:03,170 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) [2023-02-16 01:08:03,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 01:08:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:03,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 157 conjunts are in the unsatisfiable core [2023-02-16 01:08:03,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:03,581 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:03,822 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:03,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:03,997 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:03,998 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:04,107 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:04,116 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2023-02-16 01:08:04,223 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:04,224 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 42 [2023-02-16 01:08:04,235 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:04,426 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:08:04,426 INFO L350 Elim1Store]: Elim1 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 61 treesize of output 32 [2023-02-16 01:08:04,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2023-02-16 01:08:04,442 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:04,588 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 12 [2023-02-16 01:08:04,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:04,738 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:04,739 INFO L350 Elim1Store]: Elim1 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 69 treesize of output 59 [2023-02-16 01:08:04,787 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:08:04,787 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:04,806 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:04,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:04,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:08:05,242 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 01:08:05,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 164 treesize of output 112 [2023-02-16 01:08:05,270 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:08:05,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 194 treesize of output 141 [2023-02-16 01:08:05,279 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 63 [2023-02-16 01:08:05,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:05,287 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 58 [2023-02-16 01:08:05,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:05,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:05,293 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:05,384 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:08:05,385 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 41 [2023-02-16 01:08:05,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 01:08:05,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 01:08:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:08:05,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:08,413 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_433 Int) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= (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|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) .cse2 v_ArrVal_437)))) (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_433))) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 01:08:08,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:08,604 INFO L350 Elim1Store]: Elim1 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 183 treesize of output 178 [2023-02-16 01:08:08,651 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| Int) (v_ArrVal_433 Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_450 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_437 Int) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|))) (= (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_450)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_451))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_arrayElimArr_4))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_437))))) (store .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| (store (select .cse0 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|) 0 v_ArrVal_433))) (select (select (store (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_434) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse5 .cse2 (store (select .cse5 .cse2) .cse3 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= (select v_arrayElimArr_4 4) |c_ULTIMATE.start_sll_circular_insert_~data#1|)) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| |c_#StackHeapBarrier|)))) is different from false [2023-02-16 01:08:08,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679175458] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:08,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:08,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2023-02-16 01:08:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563188517] [2023-02-16 01:08:08,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:08,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-16 01:08:08,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:08,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-16 01:08:08,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1991, Unknown=37, NotChecked=182, Total=2352 [2023-02-16 01:08:08,660 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), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:13,068 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2023-02-16 01:08:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 01:08:13,069 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), 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 34 [2023-02-16 01:08:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:13,070 INFO L225 Difference]: With dead ends: 75 [2023-02-16 01:08:13,070 INFO L226 Difference]: Without dead ends: 73 [2023-02-16 01:08:13,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=392, Invalid=4001, Unknown=37, NotChecked=262, Total=4692 [2023-02-16 01:08:13,073 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 197 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:13,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 300 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-16 01:08:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-16 01:08:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2023-02-16 01:08:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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) [2023-02-16 01:08:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2023-02-16 01:08:13,103 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 34 [2023-02-16 01:08:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:13,103 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2023-02-16 01:08:13,103 INFO L496 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), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2023-02-16 01:08:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 01:08:13,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:13,107 INFO L195 NwaCegarLoop]: 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] [2023-02-16 01:08:13,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:13,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:13,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:13,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:13,317 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2023-02-16 01:08:13,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:13,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926295399] [2023-02-16 01:08:13,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:13,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:13,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:13,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:13,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 01:08:13,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926295399] [2023-02-16 01:08:13,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926295399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003910528] [2023-02-16 01:08:13,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:08:13,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:13,526 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) [2023-02-16 01:08:13,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 01:08:13,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:08:13,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:08:13,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 01:08:13,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 01:08:13,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:08:13,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003910528] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:13,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 01:08:13,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-16 01:08:13,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70068903] [2023-02-16 01:08:13,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:13,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 01:08:13,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:13,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 01:08:13,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 01:08:13,791 INFO L87 Difference]: Start difference. First operand 47 states and 62 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) [2023-02-16 01:08:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:13,829 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-02-16 01:08:13,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 01:08:13,830 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 [2023-02-16 01:08:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:13,833 INFO L225 Difference]: With dead ends: 59 [2023-02-16 01:08:13,833 INFO L226 Difference]: Without dead ends: 47 [2023-02-16 01:08:13,833 INFO L412 NwaCegarLoop]: 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 [2023-02-16 01:08:13,834 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 56 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 [2023-02-16 01:08:13,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:08:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-16 01:08:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-16 01:08:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 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) [2023-02-16 01:08:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2023-02-16 01:08:13,851 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 35 [2023-02-16 01:08:13,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:13,852 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2023-02-16 01:08:13,852 INFO L496 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) [2023-02-16 01:08:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2023-02-16 01:08:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 01:08:13,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:13,857 INFO L195 NwaCegarLoop]: 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] [2023-02-16 01:08:13,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:14,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:14,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash 342309400, now seen corresponding path program 1 times [2023-02-16 01:08:14,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:14,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787430140] [2023-02-16 01:08:14,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:14,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 01:08:14,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:14,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787430140] [2023-02-16 01:08:14,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787430140] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724208454] [2023-02-16 01:08:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:14,238 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) [2023-02-16 01:08:14,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 01:08:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 01:08:14,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 01:08:14,442 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 01:08:14,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724208454] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:08:14,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 01:08:14,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-16 01:08:14,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7304980] [2023-02-16 01:08:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:08:14,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:08:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:14,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:08:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 01:08:14,445 INFO L87 Difference]: Start difference. First operand 47 states and 60 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) [2023-02-16 01:08:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:14,467 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2023-02-16 01:08:14,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:08:14,468 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 [2023-02-16 01:08:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:14,468 INFO L225 Difference]: With dead ends: 62 [2023-02-16 01:08:14,469 INFO L226 Difference]: Without dead ends: 45 [2023-02-16 01:08:14,469 INFO L412 NwaCegarLoop]: 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 [2023-02-16 01:08:14,470 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:14,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:08:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-16 01:08:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-16 01:08:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 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) [2023-02-16 01:08:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-02-16 01:08:14,487 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 35 [2023-02-16 01:08:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:14,488 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-02-16 01:08:14,488 INFO L496 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) [2023-02-16 01:08:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-02-16 01:08:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 01:08:14,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:14,489 INFO L195 NwaCegarLoop]: 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] [2023-02-16 01:08:14,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:14,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:14,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:14,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:14,697 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2023-02-16 01:08:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:14,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979194530] [2023-02-16 01:08:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:14,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 01:08:14,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:14,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979194530] [2023-02-16 01:08:14,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979194530] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:14,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855367000] [2023-02-16 01:08:14,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:14,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:14,836 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) [2023-02-16 01:08:14,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 01:08:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:15,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 01:08:15,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:15,042 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:15,047 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 01:08:15,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 01:08:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855367000] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 01:08:15,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 01:08:15,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-02-16 01:08:15,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540565887] [2023-02-16 01:08:15,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 01:08:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 01:08:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 01:08:15,144 INFO L87 Difference]: Start difference. First operand 45 states and 56 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) [2023-02-16 01:08:15,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:15,239 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2023-02-16 01:08:15,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 01:08:15,239 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 [2023-02-16 01:08:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:15,240 INFO L225 Difference]: With dead ends: 65 [2023-02-16 01:08:15,240 INFO L226 Difference]: Without dead ends: 56 [2023-02-16 01:08:15,240 INFO L412 NwaCegarLoop]: 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 [2023-02-16 01:08:15,241 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:15,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:08:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-16 01:08:15,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2023-02-16 01:08:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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) [2023-02-16 01:08:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-02-16 01:08:15,251 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 36 [2023-02-16 01:08:15,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:15,251 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-16 01:08:15,252 INFO L496 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) [2023-02-16 01:08:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-02-16 01:08:15,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 01:08:15,252 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:15,253 INFO L195 NwaCegarLoop]: 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] [2023-02-16 01:08:15,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:15,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:15,464 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:15,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2023-02-16 01:08:15,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:15,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325966646] [2023-02-16 01:08:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:15,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:16,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:16,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325966646] [2023-02-16 01:08:16,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325966646] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:16,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949249809] [2023-02-16 01:08:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:16,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:16,301 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) [2023-02-16 01:08:16,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 01:08:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:16,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-16 01:08:16,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:16,485 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:16,732 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:16,733 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:16,798 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:16,883 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:16,883 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:16,999 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-16 01:08:17,000 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:17,009 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:17,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:17,188 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:17,188 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:17,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:17,197 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:17,216 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-16 01:08:17,216 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:17,447 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-16 01:08:17,448 INFO L350 Elim1Store]: Elim1 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 51 treesize of output 57 [2023-02-16 01:08:17,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:17,469 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-16 01:08:17,470 INFO L350 Elim1Store]: Elim1 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 57 treesize of output 66 [2023-02-16 01:08:17,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:17,549 INFO L321 Elim1Store]: treesize reduction 98, result has 42.4 percent of original size [2023-02-16 01:08:17,550 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 101 [2023-02-16 01:08:17,588 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 48 [2023-02-16 01:08:17,980 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:18,082 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 01:08:18,083 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:18,094 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:08:18,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:24,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1237 (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 ((.cse1 (let ((.cse3 (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse3 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|))))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (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_1237) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-16 01:08:24,594 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1249 (Array Int Int)) (|ULTIMATE.start_sll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1248 (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_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| Int)) (or (not (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_1248))) (let ((.cse4 (select .cse5 |ULTIMATE.start_sll_circular_insert_~last~1#1.base|))) (let ((.cse3 (store .cse5 |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_12|)))) (store .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| (store (select .cse3 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12|) |ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select .cse4 |ULTIMATE.start_sll_circular_insert_~last~1#1.offset|)))))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| v_ArrVal_1249))) (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_12| v_ArrVal_1237) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12|))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2023-02-16 01:08:24,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949249809] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:24,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:24,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 39 [2023-02-16 01:08:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864839134] [2023-02-16 01:08:24,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:24,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-16 01:08:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:24,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-16 01:08:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1481, Unknown=43, NotChecked=158, Total=1806 [2023-02-16 01:08:24,600 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 39 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 31 states have internal predecessors, (57), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:08:27,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:27,194 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2023-02-16 01:08:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-16 01:08:27,195 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 31 states have internal predecessors, (57), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2023-02-16 01:08:27,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:27,195 INFO L225 Difference]: With dead ends: 84 [2023-02-16 01:08:27,195 INFO L226 Difference]: Without dead ends: 81 [2023-02-16 01:08:27,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=431, Invalid=3566, Unknown=43, NotChecked=250, Total=4290 [2023-02-16 01:08:27,198 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 233 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:27,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 358 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 01:08:27,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-16 01:08:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2023-02-16 01:08:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 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) [2023-02-16 01:08:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-16 01:08:27,221 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 37 [2023-02-16 01:08:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:27,223 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-16 01:08:27,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 31 states have internal predecessors, (57), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:08:27,223 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-16 01:08:27,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 01:08:27,224 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:27,225 INFO L195 NwaCegarLoop]: 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] [2023-02-16 01:08:27,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:27,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:27,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1102755574, now seen corresponding path program 1 times [2023-02-16 01:08:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:27,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033809638] [2023-02-16 01:08:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:28,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:28,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033809638] [2023-02-16 01:08:28,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033809638] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:28,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419899142] [2023-02-16 01:08:28,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:28,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:28,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:28,593 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) [2023-02-16 01:08:28,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 01:08:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:28,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 156 conjunts are in the unsatisfiable core [2023-02-16 01:08:28,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:28,974 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:29,265 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 15 [2023-02-16 01:08:29,349 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:29,350 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:29,438 INFO L350 Elim1Store]: Elim1 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 11 [2023-02-16 01:08:29,536 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:29,713 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 20 [2023-02-16 01:08:29,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:29,721 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2023-02-16 01:08:29,732 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:29,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:29,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:29,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:29,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:29,926 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 30 [2023-02-16 01:08:29,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:29,944 INFO L350 Elim1Store]: Elim1 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 40 [2023-02-16 01:08:29,971 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 01:08:29,972 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-16 01:08:30,292 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 01:08:30,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 95 [2023-02-16 01:08:30,332 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:08:30,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 169 [2023-02-16 01:08:30,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:30,363 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 35 [2023-02-16 01:08:30,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:30,384 INFO L321 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2023-02-16 01:08:30,384 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 238 treesize of output 183 [2023-02-16 01:08:30,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:30,421 INFO L321 Elim1Store]: treesize reduction 142, result has 9.6 percent of original size [2023-02-16 01:08:30,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 188 [2023-02-16 01:08:30,433 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 42 [2023-02-16 01:08:30,442 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 59 [2023-02-16 01:08:30,451 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 19 [2023-02-16 01:08:30,458 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 19 [2023-02-16 01:08:30,836 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:08:30,837 INFO L350 Elim1Store]: Elim1 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 137 treesize of output 60 [2023-02-16 01:08:30,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:30,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:30,845 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2023-02-16 01:08:30,939 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 01:08:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:08:30,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:32,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:32,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1345 treesize of output 1322 [2023-02-16 01:08:32,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 01:08:32,906 INFO L350 Elim1Store]: Elim1 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 8768 treesize of output 8774 [2023-02-16 01:08:32,936 INFO L350 Elim1Store]: Elim1 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 8927 treesize of output 8095 [2023-02-16 01:08:32,968 INFO L350 Elim1Store]: Elim1 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 8939 treesize of output 8107 [2023-02-16 01:08:34,655 INFO L350 Elim1Store]: Elim1 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 211 treesize of output 3 [2023-02-16 01:08:36,098 INFO L350 Elim1Store]: Elim1 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 211 treesize of output 3 [2023-02-16 01:08:36,124 INFO L350 Elim1Store]: Elim1 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 211 treesize of output 3 [2023-02-16 01:08:36,508 INFO L350 Elim1Store]: Elim1 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 211 treesize of output 3 [2023-02-16 01:08:36,647 INFO L350 Elim1Store]: Elim1 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 211 treesize of output 3 [2023-02-16 01:08:36,862 INFO L350 Elim1Store]: Elim1 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 211 treesize of output 3