./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 e8d55036 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-?-e8d5503-m [2023-02-15 19:47:11,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 19:47:11,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 19:47:11,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 19:47:11,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 19:47:11,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 19:47:11,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 19:47:11,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 19:47:11,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 19:47:11,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 19:47:11,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 19:47:11,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 19:47:11,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 19:47:11,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 19:47:11,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 19:47:11,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 19:47:11,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 19:47:11,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 19:47:11,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 19:47:11,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 19:47:11,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 19:47:11,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 19:47:11,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 19:47:11,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 19:47:11,133 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 19:47:11,133 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 19:47:11,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 19:47:11,135 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 19:47:11,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 19:47:11,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 19:47:11,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 19:47:11,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 19:47:11,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 19:47:11,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 19:47:11,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 19:47:11,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 19:47:11,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 19:47:11,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 19:47:11,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 19:47:11,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 19:47:11,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 19:47:11,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 19:47:11,171 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 19:47:11,172 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 19:47:11,172 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 19:47:11,172 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 19:47:11,173 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 19:47:11,173 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 19:47:11,174 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 19:47:11,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 19:47:11,174 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 19:47:11,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 19:47:11,175 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 19:47:11,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 19:47:11,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 19:47:11,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 19:47:11,175 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 19:47:11,175 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 19:47:11,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 19:47:11,176 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 19:47:11,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 19:47:11,176 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 19:47:11,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 19:47:11,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 19:47:11,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 19:47:11,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 19:47:11,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:47:11,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 19:47:11,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 19:47:11,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 19:47:11,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 19:47:11,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 19:47:11,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 19:47:11,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 19:47:11,178 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 19:47:11,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 19:47:11,179 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 19:47:11,179 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-15 19:47:11,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 19:47:11,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 19:47:11,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 19:47:11,366 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 19:47:11,366 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 19:47:11,367 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-15 19:47:12,311 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 19:47:12,494 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 19:47:12,494 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-02-15 19:47:12,503 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae88dd35b/7a2c1d2eded94f848f847148c676e8d7/FLAG509642b79 [2023-02-15 19:47:12,511 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae88dd35b/7a2c1d2eded94f848f847148c676e8d7 [2023-02-15 19:47:12,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 19:47:12,514 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 19:47:12,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 19:47:12,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 19:47:12,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 19:47:12,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,531 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60efe174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12, skipping insertion in model container [2023-02-15 19:47:12,531 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 19:47:12,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 19:47:12,772 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-15 19:47:12,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:47:12,789 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 19:47:12,821 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-15 19:47:12,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 19:47:12,839 INFO L208 MainTranslator]: Completed translation [2023-02-15 19:47:12,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12 WrapperNode [2023-02-15 19:47:12,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 19:47:12,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 19:47:12,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 19:47:12,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 19:47:12,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,861 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,879 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2023-02-15 19:47:12,879 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 19:47:12,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 19:47:12,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 19:47:12,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 19:47:12,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 19:47:12,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 19:47:12,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 19:47:12,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 19:47:12,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (1/1) ... [2023-02-15 19:47:12,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 19:47:12,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:47:12,961 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-15 19:47:12,962 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-15 19:47:12,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 19:47:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 19:47:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 19:47:12,994 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 19:47:12,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 19:47:12,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 19:47:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 19:47:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 19:47:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 19:47:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 19:47:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 19:47:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 19:47:12,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 19:47:12,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 19:47:13,078 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 19:47:13,081 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 19:47:13,251 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 19:47:13,256 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 19:47:13,256 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 19:47:13,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:47:13 BoogieIcfgContainer [2023-02-15 19:47:13,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 19:47:13,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 19:47:13,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 19:47:13,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 19:47:13,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 07:47:12" (1/3) ... [2023-02-15 19:47:13,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cae541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:47:13, skipping insertion in model container [2023-02-15 19:47:13,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 07:47:12" (2/3) ... [2023-02-15 19:47:13,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cae541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 07:47:13, skipping insertion in model container [2023-02-15 19:47:13,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 07:47:13" (3/3) ... [2023-02-15 19:47:13,263 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-02-15 19:47:13,274 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 19:47:13,274 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 19:47:13,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 19:47:13,319 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;@c032c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 19:47:13,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 19:47:13,322 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-15 19:47:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 19:47:13,327 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:13,328 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-15 19:47:13,328 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2023-02-15 19:47:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:13,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703637138] [2023-02-15 19:47:13,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:13,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:47:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:13,618 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-15 19:47:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703637138] [2023-02-15 19:47:13,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703637138] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:47:13,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:47:13,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 19:47:13,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735145945] [2023-02-15 19:47:13,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:47:13,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 19:47:13,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 19:47:13,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 19:47:13,664 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-15 19:47:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:13,726 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2023-02-15 19:47:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 19:47:13,727 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-15 19:47:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:13,732 INFO L225 Difference]: With dead ends: 65 [2023-02-15 19:47:13,733 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 19:47:13,735 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-15 19:47:13,739 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:47:13,739 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.0s Time] [2023-02-15 19:47:13,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 19:47:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 19:47:13,766 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-15 19:47:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-02-15 19:47:13,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2023-02-15 19:47:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:13,770 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-02-15 19:47:13,770 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-15 19:47:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-02-15 19:47:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 19:47:13,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:13,773 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-15 19:47:13,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 19:47:13,773 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:13,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2023-02-15 19:47:13,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:13,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280782082] [2023-02-15 19:47:13,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:13,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:14,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 19:47:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:14,015 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-15 19:47:14,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:14,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280782082] [2023-02-15 19:47:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280782082] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:47:14,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:47:14,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:47:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327565507] [2023-02-15 19:47:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:47:14,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:47:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:47:14,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:47:14,023 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-15 19:47:14,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:14,067 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-02-15 19:47:14,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:47:14,069 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-15 19:47:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:14,071 INFO L225 Difference]: With dead ends: 52 [2023-02-15 19:47:14,071 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 19:47:14,074 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-15 19:47:14,075 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-15 19:47:14,076 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-15 19:47:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 19:47:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-02-15 19:47:14,083 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-15 19:47:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-02-15 19:47:14,085 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2023-02-15 19:47:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:14,085 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-02-15 19:47:14,085 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-15 19:47:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-02-15 19:47:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 19:47:14,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:14,088 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-15 19:47:14,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 19:47:14,088 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:14,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2023-02-15 19:47:14,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:14,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404947237] [2023-02-15 19:47:14,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:14,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:14,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:47:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:14,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:47:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:14,235 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-15 19:47:14,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:14,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404947237] [2023-02-15 19:47:14,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404947237] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:47:14,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 19:47:14,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 19:47:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156919675] [2023-02-15 19:47:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:47:14,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:47:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:14,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:47:14,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 19:47:14,239 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-15 19:47:14,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:14,288 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2023-02-15 19:47:14,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:47:14,288 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-15 19:47:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:14,291 INFO L225 Difference]: With dead ends: 47 [2023-02-15 19:47:14,291 INFO L226 Difference]: Without dead ends: 39 [2023-02-15 19:47:14,292 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-15 19:47:14,293 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-15 19:47:14,293 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-15 19:47:14,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-15 19:47:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2023-02-15 19:47:14,297 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-15 19:47:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-02-15 19:47:14,297 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 33 [2023-02-15 19:47:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:14,298 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-02-15 19:47:14,298 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-15 19:47:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-02-15 19:47:14,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 19:47:14,299 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:14,299 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-15 19:47:14,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 19:47:14,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2023-02-15 19:47:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:14,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132167624] [2023-02-15 19:47:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:16,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:16,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:47:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:47:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:16,645 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-15 19:47:16,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:16,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132167624] [2023-02-15 19:47:16,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132167624] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:16,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837790897] [2023-02-15 19:47:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:16,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:47:16,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:47:16,648 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-15 19:47:16,676 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-15 19:47:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:16,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 157 conjunts are in the unsatisfiable core [2023-02-15 19:47:16,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:47:16,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-15 19:47:17,184 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-15 19:47:17,249 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-15 19:47:17,323 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:47:17,326 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-15 19:47:17,402 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-15 19:47:17,408 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-15 19:47:17,496 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:47:17,497 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-15 19:47:17,510 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-15 19:47:17,669 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:47:17,670 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-15 19:47:17,677 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-15 19:47:17,684 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-15 19:47:17,801 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-15 19:47:17,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:17,946 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:47:17,946 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-15 19:47:17,959 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 19:47:17,959 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-15 19:47:17,967 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-15 19:47:17,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:17,975 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-15 19:47:18,309 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 19:47:18,310 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-15 19:47:18,333 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:47:18,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 194 treesize of output 141 [2023-02-15 19:47:18,341 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-15 19:47:18,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:18,353 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-15 19:47:18,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:18,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:18,359 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-15 19:47:18,426 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 19:47:18,427 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-15 19:47:18,431 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-15 19:47:18,488 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-15 19:47:18,524 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-15 19:47:18,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:47:19,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:47:19,517 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-15 19:47:19,551 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-15 19:47:19,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837790897] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:19,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:47:19,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2023-02-15 19:47:19,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711800270] [2023-02-15 19:47:19,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:47:19,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-15 19:47:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:19,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-15 19:47:19,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2070, Unknown=46, NotChecked=92, Total=2352 [2023-02-15 19:47:19,556 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-15 19:47:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:22,867 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2023-02-15 19:47:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 19:47:22,868 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-15 19:47:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:22,870 INFO L225 Difference]: With dead ends: 75 [2023-02-15 19:47:22,870 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 19:47:22,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=395, Invalid=4118, Unknown=47, NotChecked=132, Total=4692 [2023-02-15 19:47:22,871 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 197 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2023-02-15 19:47:22,872 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.0s Time] [2023-02-15 19:47:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 19:47:22,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2023-02-15 19:47:22,888 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-15 19:47:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2023-02-15 19:47:22,889 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 34 [2023-02-15 19:47:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:22,889 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2023-02-15 19:47:22,890 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-15 19:47:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2023-02-15 19:47:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:47:22,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:22,890 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-15 19:47:22,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 19:47:23,096 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-15 19:47:23,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2023-02-15 19:47:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269028600] [2023-02-15 19:47:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:47:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:47:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,247 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-15 19:47:23,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:23,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269028600] [2023-02-15 19:47:23,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269028600] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:23,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351591165] [2023-02-15 19:47:23,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 19:47:23,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:47:23,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:47:23,248 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-15 19:47:23,251 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-15 19:47:23,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 19:47:23,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 19:47:23,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 19:47:23,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:47:23,398 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-15 19:47:23,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:47:23,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351591165] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:47:23,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:47:23,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-15 19:47:23,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801174952] [2023-02-15 19:47:23,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:47:23,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 19:47:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:23,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 19:47:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 19:47:23,400 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-15 19:47:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:23,420 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2023-02-15 19:47:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 19:47:23,421 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-15 19:47:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:23,421 INFO L225 Difference]: With dead ends: 59 [2023-02-15 19:47:23,421 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 19:47:23,422 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-15 19:47:23,422 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-15 19:47:23,422 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-15 19:47:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 19:47:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-15 19:47:23,429 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-15 19:47:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2023-02-15 19:47:23,429 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 35 [2023-02-15 19:47:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:23,430 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2023-02-15 19:47:23,430 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-15 19:47:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2023-02-15 19:47:23,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 19:47:23,431 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:23,431 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-15 19:47:23,444 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-15 19:47:23,636 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-15 19:47:23,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:23,637 INFO L85 PathProgramCache]: Analyzing trace with hash 342309400, now seen corresponding path program 1 times [2023-02-15 19:47:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:23,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572049129] [2023-02-15 19:47:23,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:47:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:47:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,756 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-15 19:47:23,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:23,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572049129] [2023-02-15 19:47:23,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572049129] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800541199] [2023-02-15 19:47:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:47:23,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:47:23,758 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-15 19:47:23,760 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-15 19:47:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:23,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 19:47:23,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:47:23,901 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-15 19:47:23,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 19:47:23,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800541199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 19:47:23,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 19:47:23,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-15 19:47:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861809335] [2023-02-15 19:47:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 19:47:23,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 19:47:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 19:47:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 19:47:23,903 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-15 19:47:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:23,919 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2023-02-15 19:47:23,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 19:47:23,919 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-15 19:47:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:23,920 INFO L225 Difference]: With dead ends: 62 [2023-02-15 19:47:23,920 INFO L226 Difference]: Without dead ends: 45 [2023-02-15 19:47:23,920 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-15 19:47:23,921 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-15 19:47:23,921 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-15 19:47:23,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-15 19:47:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-15 19:47:23,929 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-15 19:47:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2023-02-15 19:47:23,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 35 [2023-02-15 19:47:23,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:23,930 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2023-02-15 19:47:23,930 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-15 19:47:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2023-02-15 19:47:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 19:47:23,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:23,931 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-15 19:47:23,944 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-15 19:47:24,136 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-15 19:47:24,138 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:24,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2023-02-15 19:47:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:24,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676553171] [2023-02-15 19:47:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:47:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:47:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:24,234 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-15 19:47:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676553171] [2023-02-15 19:47:24,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676553171] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:24,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264539572] [2023-02-15 19:47:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:24,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:47:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:47:24,236 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-15 19:47:24,238 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-15 19:47:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:24,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 19:47:24,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:47:24,382 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-15 19:47:24,385 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-15 19:47:24,386 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-15 19:47:24,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:47:24,430 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-15 19:47:24,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264539572] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 19:47:24,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 19:47:24,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-02-15 19:47:24,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521090806] [2023-02-15 19:47:24,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 19:47:24,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 19:47:24,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:24,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 19:47:24,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 19:47:24,434 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-15 19:47:24,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:24,505 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2023-02-15 19:47:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 19:47:24,506 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-15 19:47:24,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:24,506 INFO L225 Difference]: With dead ends: 65 [2023-02-15 19:47:24,506 INFO L226 Difference]: Without dead ends: 56 [2023-02-15 19:47:24,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 19:47:24,507 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-15 19:47:24,507 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-15 19:47:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-15 19:47:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2023-02-15 19:47:24,513 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-15 19:47:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2023-02-15 19:47:24,514 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 36 [2023-02-15 19:47:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:24,514 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2023-02-15 19:47:24,514 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-15 19:47:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2023-02-15 19:47:24,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 19:47:24,515 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:24,515 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-15 19:47:24,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 19:47:24,720 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-15 19:47:24,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2023-02-15 19:47:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:24,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443687653] [2023-02-15 19:47:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:25,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:25,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:47:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:47:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:25,306 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-15 19:47:25,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:25,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443687653] [2023-02-15 19:47:25,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443687653] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:25,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730346] [2023-02-15 19:47:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:25,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:47:25,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:47:25,308 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-15 19:47:25,310 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-15 19:47:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:25,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2023-02-15 19:47:25,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:47:25,441 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-15 19:47:25,610 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:47:25,611 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-15 19:47:25,656 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-15 19:47:25,724 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 19:47:25,724 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-15 19:47:25,814 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 19:47:25,817 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-15 19:47:25,822 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-15 19:47:25,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:25,948 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 19:47:25,948 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-15 19:47:25,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:25,953 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-15 19:47:25,969 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 19:47:25,969 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-15 19:47:26,113 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 19:47:26,113 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-15 19:47:26,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:26,132 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 19:47:26,133 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-15 19:47:26,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:26,200 INFO L321 Elim1Store]: treesize reduction 98, result has 42.4 percent of original size [2023-02-15 19:47:26,201 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-15 19:47:26,229 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-15 19:47:26,457 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-15 19:47:26,534 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 19:47:26,534 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-15 19:47:26,543 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-15 19:47:26,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:47:28,674 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_~new_node~0#1.base|)))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#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_~new_node~0#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-15 19:47:28,696 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-15 19:47:28,755 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-15 19:47:28,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:28,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 19:47:28,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 39 [2023-02-15 19:47:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041374564] [2023-02-15 19:47:28,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 19:47:28,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-15 19:47:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 19:47:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-15 19:47:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1435, Unknown=15, NotChecked=234, Total=1806 [2023-02-15 19:47:28,759 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-15 19:47:30,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 19:47:30,552 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2023-02-15 19:47:30,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 19:47:30,553 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-15 19:47:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 19:47:30,553 INFO L225 Difference]: With dead ends: 84 [2023-02-15 19:47:30,553 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 19:47:30,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=418, Invalid=3485, Unknown=15, NotChecked=372, Total=4290 [2023-02-15 19:47:30,555 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 233 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-02-15 19:47:30,555 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.5s Time] [2023-02-15 19:47:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 19:47:30,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2023-02-15 19:47:30,562 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-15 19:47:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-15 19:47:30,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 37 [2023-02-15 19:47:30,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 19:47:30,563 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-15 19:47:30,563 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-15 19:47:30,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-15 19:47:30,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 19:47:30,564 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 19:47:30,564 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-15 19:47:30,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 19:47:30,769 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-15 19:47:30,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 19:47:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 19:47:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1102755574, now seen corresponding path program 1 times [2023-02-15 19:47:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 19:47:30,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688257879] [2023-02-15 19:47:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 19:47:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 19:47:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 19:47:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 19:47:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:31,577 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-15 19:47:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 19:47:31,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688257879] [2023-02-15 19:47:31,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688257879] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 19:47:31,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988209704] [2023-02-15 19:47:31,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 19:47:31,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 19:47:31,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 19:47:31,579 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-15 19:47:31,581 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-15 19:47:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 19:47:31,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 156 conjunts are in the unsatisfiable core [2023-02-15 19:47:31,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 19:47:31,902 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-15 19:47:32,092 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-15 19:47:32,160 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 19:47:32,161 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-15 19:47:32,238 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-15 19:47:32,336 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-15 19:47:32,488 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-15 19:47:32,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:32,492 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-15 19:47:32,496 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-15 19:47:32,580 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-15 19:47:32,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:32,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:32,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:32,658 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-15 19:47:32,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:32,673 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-15 19:47:32,690 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 19:47:32,690 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-15 19:47:32,949 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 19:47:32,949 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-15 19:47:32,972 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 19:47:32,972 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-15 19:47:32,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:32,987 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-15 19:47:32,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:32,999 INFO L321 Elim1Store]: treesize reduction 48, result has 9.4 percent of original size [2023-02-15 19:47:32,999 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-15 19:47:33,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:33,037 INFO L321 Elim1Store]: treesize reduction 142, result has 9.6 percent of original size [2023-02-15 19:47:33,037 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-15 19:47:33,044 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-15 19:47:33,053 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-15 19:47:33,059 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-15 19:47:33,064 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-15 19:47:33,336 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 19:47:33,336 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-15 19:47:33,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:33,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 19:47:33,343 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-15 19:47:33,438 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-15 19:47:33,469 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-15 19:47:33,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 19:47:34,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:47:34,830 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-15 19:47:34,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 19:47:34,876 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-15 19:47:34,903 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-15 19:47:34,929 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-15 19:47:35,675 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-15 19:47:36,605 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-15 19:47:36,615 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-15 19:47:36,740 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-15 19:47:36,813 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-15 19:47:36,828 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