./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_unequal.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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 01:07:51,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 01:07:51,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 01:07:51,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 01:07:51,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 01:07:51,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 01:07:51,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 01:07:51,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 01:07:51,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 01:07:51,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 01:07:51,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 01:07:51,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 01:07:51,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 01:07:51,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 01:07:51,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 01:07:51,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 01:07:51,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 01:07:51,240 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 01:07:51,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 01:07:51,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 01:07:51,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 01:07:51,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 01:07:51,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 01:07:51,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 01:07:51,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 01:07:51,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 01:07:51,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 01:07:51,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 01:07:51,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 01:07:51,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 01:07:51,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 01:07:51,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 01:07:51,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 01:07:51,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 01:07:51,259 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 01:07:51,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 01:07:51,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 01:07:51,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 01:07:51,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 01:07:51,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 01:07:51,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 01:07:51,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 01:07:51,284 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 01:07:51,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 01:07:51,291 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 01:07:51,291 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 01:07:51,292 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 01:07:51,292 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 01:07:51,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 01:07:51,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 01:07:51,293 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 01:07:51,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 01:07:51,294 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 01:07:51,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 01:07:51,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 01:07:51,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 01:07:51,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 01:07:51,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 01:07:51,295 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 01:07:51,295 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 01:07:51,295 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 01:07:51,295 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 01:07:51,296 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 01:07:51,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 01:07:51,296 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 01:07:51,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 01:07:51,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:07:51,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 01:07:51,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 01:07:51,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 01:07:51,298 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 01:07:51,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 01:07:51,298 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 01:07:51,298 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 01:07:51,298 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 01:07:51,299 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 01:07:51,299 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 01:07:51,299 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2023-02-16 01:07:51,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 01:07:51,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 01:07:51,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 01:07:51,550 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 01:07:51,550 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 01:07:51,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-02-16 01:07:52,694 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 01:07:52,970 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 01:07:52,970 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2023-02-16 01:07:52,980 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece35e9d6/e76ba443ddbc4a6b9c379bc228779e48/FLAGe812ff89f [2023-02-16 01:07:53,002 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ece35e9d6/e76ba443ddbc4a6b9c379bc228779e48 [2023-02-16 01:07:53,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 01:07:53,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 01:07:53,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 01:07:53,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 01:07:53,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 01:07:53,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173fc527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53, skipping insertion in model container [2023-02-16 01:07:53,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 01:07:53,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 01:07:53,270 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_append_unequal.i[24587,24600] [2023-02-16 01:07:53,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:07:53,288 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 01:07:53,352 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_append_unequal.i[24587,24600] [2023-02-16 01:07:53,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 01:07:53,428 INFO L208 MainTranslator]: Completed translation [2023-02-16 01:07:53,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53 WrapperNode [2023-02-16 01:07:53,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 01:07:53,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 01:07:53,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 01:07:53,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 01:07:53,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,518 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2023-02-16 01:07:53,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 01:07:53,522 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 01:07:53,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 01:07:53,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 01:07:53,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,549 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,561 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 01:07:53,576 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 01:07:53,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 01:07:53,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 01:07:53,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (1/1) ... [2023-02-16 01:07:53,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 01:07:53,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:53,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 01:07:53,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 01:07:53,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 01:07:53,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 01:07:53,651 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 01:07:53,651 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 01:07:53,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 01:07:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 01:07:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 01:07:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 01:07:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 01:07:53,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 01:07:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 01:07:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 01:07:53,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 01:07:53,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 01:07:53,773 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 01:07:53,775 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 01:07:54,104 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 01:07:54,117 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 01:07:54,122 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-16 01:07:54,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:07:54 BoogieIcfgContainer [2023-02-16 01:07:54,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 01:07:54,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 01:07:54,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 01:07:54,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 01:07:54,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 01:07:53" (1/3) ... [2023-02-16 01:07:54,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394aa1bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:07:54, skipping insertion in model container [2023-02-16 01:07:54,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 01:07:53" (2/3) ... [2023-02-16 01:07:54,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394aa1bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 01:07:54, skipping insertion in model container [2023-02-16 01:07:54,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 01:07:54" (3/3) ... [2023-02-16 01:07:54,134 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2023-02-16 01:07:54,145 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 01:07:54,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 01:07:54,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 01:07:54,182 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;@1cd88011, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 01:07:54,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 01:07:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 01:07:54,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:54,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:54,192 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:54,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2119803949, now seen corresponding path program 1 times [2023-02-16 01:07:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:54,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345766427] [2023-02-16 01:07:54,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:54,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:07:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:07:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:54,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345766427] [2023-02-16 01:07:54,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345766427] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:07:54,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:07:54,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 01:07:54,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179042698] [2023-02-16 01:07:54,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:07:54,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 01:07:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 01:07:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:07:54,420 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:54,470 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2023-02-16 01:07:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 01:07:54,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-02-16 01:07:54,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:54,477 INFO L225 Difference]: With dead ends: 71 [2023-02-16 01:07:54,477 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 01:07:54,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 01:07:54,481 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:54,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:07:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 01:07:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-16 01:07:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:54,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2023-02-16 01:07:54,518 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2023-02-16 01:07:54,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:54,519 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2023-02-16 01:07:54,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2023-02-16 01:07:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 01:07:54,521 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:54,521 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, 1] [2023-02-16 01:07:54,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 01:07:54,522 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:54,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -826043684, now seen corresponding path program 1 times [2023-02-16 01:07:54,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:54,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733630845] [2023-02-16 01:07:54,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:54,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-16 01:07:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 01:07:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:54,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733630845] [2023-02-16 01:07:54,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733630845] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 01:07:54,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 01:07:54,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 01:07:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793703048] [2023-02-16 01:07:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 01:07:54,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 01:07:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:54,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 01:07:54,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:07:54,700 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:54,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:54,742 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2023-02-16 01:07:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 01:07:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2023-02-16 01:07:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:54,747 INFO L225 Difference]: With dead ends: 58 [2023-02-16 01:07:54,747 INFO L226 Difference]: Without dead ends: 34 [2023-02-16 01:07:54,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 01:07:54,750 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:54,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 86 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 01:07:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-16 01:07:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-16 01:07:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2023-02-16 01:07:54,758 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 26 [2023-02-16 01:07:54,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:54,759 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2023-02-16 01:07:54,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 01:07:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2023-02-16 01:07:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 01:07:54,762 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:54,762 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:54,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 01:07:54,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:54,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1959720012, now seen corresponding path program 1 times [2023-02-16 01:07:54,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:54,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942653179] [2023-02-16 01:07:54,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:54,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:55,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942653179] [2023-02-16 01:07:55,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942653179] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146167152] [2023-02-16 01:07:55,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:55,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:55,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:55,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:07:55,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 01:07:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:55,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-16 01:07:55,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:55,481 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 17 treesize of output 9 [2023-02-16 01:07:55,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:55,562 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 24 treesize of output 24 [2023-02-16 01:07:55,592 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 25 treesize of output 13 [2023-02-16 01:07:55,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 01:07:55,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:55,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146167152] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:55,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:55,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-02-16 01:07:55,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329793047] [2023-02-16 01:07:55,721 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:55,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 01:07:55,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:55,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 01:07:55,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=520, Unknown=5, NotChecked=0, Total=600 [2023-02-16 01:07:55,723 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:07:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:07:56,112 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2023-02-16 01:07:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 01:07:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 34 [2023-02-16 01:07:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:07:56,115 INFO L225 Difference]: With dead ends: 45 [2023-02-16 01:07:56,115 INFO L226 Difference]: Without dead ends: 34 [2023-02-16 01:07:56,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=837, Unknown=5, NotChecked=0, Total=992 [2023-02-16 01:07:56,119 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 102 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 01:07:56,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 191 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 01:07:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-16 01:07:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2023-02-16 01:07:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:07:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-16 01:07:56,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 34 [2023-02-16 01:07:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:07:56,135 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-16 01:07:56,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 17 states have internal predecessors, (42), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 01:07:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-16 01:07:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 01:07:56,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:07:56,138 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:07:56,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 01:07:56,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:56,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:07:56,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:07:56,347 INFO L85 PathProgramCache]: Analyzing trace with hash -158694653, now seen corresponding path program 1 times [2023-02-16 01:07:56,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:07:56,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479003226] [2023-02-16 01:07:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:07:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:07:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:56,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:07:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:57,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:07:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:07:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:07:57,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479003226] [2023-02-16 01:07:57,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479003226] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:57,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903363612] [2023-02-16 01:07:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:07:57,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:07:57,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:07:57,246 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:07:57,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 01:07:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:07:57,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 108 conjunts are in the unsatisfiable core [2023-02-16 01:07:57,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:07:57,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:07:57,625 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:07:57,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:07:57,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:57,759 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:07:57,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-16 01:07:57,910 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:07:57,910 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 46 treesize of output 21 [2023-02-16 01:07:57,915 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 7 treesize of output 3 [2023-02-16 01:07:57,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:07:58,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:58,099 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:07:58,103 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 54 treesize of output 50 [2023-02-16 01:07:58,119 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:07:58,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 01:07:58,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:58,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:07:58,354 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 01:07:58,355 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 85 treesize of output 61 [2023-02-16 01:07:58,378 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 01:07:58,378 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 97 treesize of output 72 [2023-02-16 01:07:58,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:58,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:07:58,392 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 52 treesize of output 54 [2023-02-16 01:07:58,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:07:58,490 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 01:07:58,492 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 57 treesize of output 24 [2023-02-16 01:07:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:07:58,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:07:58,587 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_503))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_504) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-16 01:07:58,611 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_503))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_504) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-02-16 01:07:58,627 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_503))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_504) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_502) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-02-16 01:07:58,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903363612] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:07:58,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:07:58,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 37 [2023-02-16 01:07:58,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356755726] [2023-02-16 01:07:58,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:07:58,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 01:07:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:07:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 01:07:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1432, Unknown=4, NotChecked=234, Total=1806 [2023-02-16 01:07:58,800 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 37 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:00,462 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2023-02-16 01:08:00,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 01:08:00,463 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-02-16 01:08:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:00,464 INFO L225 Difference]: With dead ends: 61 [2023-02-16 01:08:00,464 INFO L226 Difference]: Without dead ends: 49 [2023-02-16 01:08:00,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=369, Invalid=2719, Unknown=4, NotChecked=330, Total=3422 [2023-02-16 01:08:00,466 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 144 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:00,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 411 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-16 01:08:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-16 01:08:00,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2023-02-16 01:08:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 01:08:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2023-02-16 01:08:00,473 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 37 [2023-02-16 01:08:00,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:00,473 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2023-02-16 01:08:00,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 29 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2023-02-16 01:08:00,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 01:08:00,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:00,474 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, 1] [2023-02-16 01:08:00,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:00,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 01:08:00,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:00,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1887720382, now seen corresponding path program 1 times [2023-02-16 01:08:00,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:00,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369081540] [2023-02-16 01:08:00,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:00,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:01,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:01,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369081540] [2023-02-16 01:08:01,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369081540] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:01,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702671365] [2023-02-16 01:08:01,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:01,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:01,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:01,800 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:08:01,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 01:08:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:01,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-16 01:08:01,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:01,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:08:02,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:08:02,159 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:02,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:08:02,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:02,271 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:02,271 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 37 treesize of output 36 [2023-02-16 01:08:02,379 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2023-02-16 01:08:02,380 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 64 treesize of output 36 [2023-02-16 01:08:02,384 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 13 treesize of output 9 [2023-02-16 01:08:02,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:02,560 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:02,560 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 70 treesize of output 62 [2023-02-16 01:08:02,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:02,564 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 61 treesize of output 59 [2023-02-16 01:08:02,578 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-16 01:08:02,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-16 01:08:02,879 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2023-02-16 01:08:02,879 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 64 [2023-02-16 01:08:02,904 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:08:02,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 107 [2023-02-16 01:08:02,927 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-02-16 01:08:02,928 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 2 case distinctions, treesize of input 152 treesize of output 148 [2023-02-16 01:08:03,002 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 122 treesize of output 94 [2023-02-16 01:08:03,072 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-02-16 01:08:03,072 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 44 [2023-02-16 01:08:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 01:08:03,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:03,124 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_698 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_701))) (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| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-16 01:08:03,138 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_698 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_701))) (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| .cse2 v_ArrVal_702) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-16 01:08:03,249 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_698 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_701))) (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| .cse2 v_ArrVal_702) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_698) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-16 01:08:03,314 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| Int) (v_ArrVal_702 (Array Int Int)) (v_ArrVal_701 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| Int) (v_ArrVal_709 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_710)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_709))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_9| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_701))) (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 .cse2 .cse3 v_ArrVal_702) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_14| v_ArrVal_698) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-16 01:08:03,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702671365] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:03,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:03,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2023-02-16 01:08:03,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481222656] [2023-02-16 01:08:03,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:03,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-16 01:08:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:03,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-16 01:08:03,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1581, Unknown=32, NotChecked=332, Total=2070 [2023-02-16 01:08:03,318 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 41 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 32 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:05,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-16 01:08:06,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:06,927 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2023-02-16 01:08:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-16 01:08:06,927 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 32 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2023-02-16 01:08:06,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:06,928 INFO L225 Difference]: With dead ends: 73 [2023-02-16 01:08:06,928 INFO L226 Difference]: Without dead ends: 65 [2023-02-16 01:08:06,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=327, Invalid=2959, Unknown=36, NotChecked=460, Total=3782 [2023-02-16 01:08:06,930 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 281 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:06,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 369 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 662 Invalid, 2 Unknown, 0 Unchecked, 2.4s Time] [2023-02-16 01:08:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-16 01:08:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 50. [2023-02-16 01:08:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:08:06,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2023-02-16 01:08:06,941 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 39 [2023-02-16 01:08:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:06,942 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2023-02-16 01:08:06,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 32 states have internal predecessors, (57), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2023-02-16 01:08:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 01:08:06,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:06,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:06,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:07,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:07,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1669816953, now seen corresponding path program 1 times [2023-02-16 01:08:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:07,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777546202] [2023-02-16 01:08:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:08,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777546202] [2023-02-16 01:08:08,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777546202] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:08,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830492144] [2023-02-16 01:08:08,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:08,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:08,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:08,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:08:08,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 01:08:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:09,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 149 conjunts are in the unsatisfiable core [2023-02-16 01:08:09,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:09,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:08:09,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 01:08:09,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:09,637 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:09,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:08:09,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:09,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 01:08:09,825 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 01:08:09,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-16 01:08:09,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 01:08:10,010 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 01:08:10,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2023-02-16 01:08:10,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:10,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 01:08:10,026 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 7 treesize of output 3 [2023-02-16 01:08:10,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:10,243 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 01:08:10,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2023-02-16 01:08:10,262 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 01:08:10,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 01:08:10,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 01:08:10,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:10,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 01:08:10,794 INFO L321 Elim1Store]: treesize reduction 107, result has 17.1 percent of original size [2023-02-16 01:08:10,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 158 treesize of output 88 [2023-02-16 01:08:10,828 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-16 01:08:10,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 239 treesize of output 144 [2023-02-16 01:08:10,843 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 01:08:10,844 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 213 treesize of output 166 [2023-02-16 01:08:10,856 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 41 treesize of output 45 [2023-02-16 01:08:10,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:10,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:10,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-02-16 01:08:10,993 INFO L321 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2023-02-16 01:08:10,994 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 50 [2023-02-16 01:08:11,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:11,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 01:08:11,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 01:08:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 01:08:11,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 01:08:11,271 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_907 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_911) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_909) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-16 01:08:11,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| Int) (v_ArrVal_907 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_911) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_909) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-16 01:08:11,308 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| Int) (v_ArrVal_907 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_911) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_909) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-16 01:08:11,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| Int) (v_ArrVal_907 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_911) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_909) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-16 01:08:11,423 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| Int) (v_ArrVal_922 (Array Int Int)) (v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| Int) (v_ArrVal_907 (Array Int Int)) (v_ArrVal_909 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_922)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_923))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_924) .cse0 v_ArrVal_911) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_909) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_907) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_12| 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_17| v_ArrVal_910) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2023-02-16 01:08:11,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830492144] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:11,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 01:08:11,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2023-02-16 01:08:11,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147616334] [2023-02-16 01:08:11,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 01:08:11,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-16 01:08:11,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 01:08:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-16 01:08:11,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2436, Unknown=5, NotChecked=510, Total=3080 [2023-02-16 01:08:11,429 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 48 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 39 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 01:08:16,596 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2023-02-16 01:08:16,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 01:08:16,596 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 39 states have internal predecessors, (67), 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 41 [2023-02-16 01:08:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 01:08:16,599 INFO L225 Difference]: With dead ends: 77 [2023-02-16 01:08:16,599 INFO L226 Difference]: Without dead ends: 69 [2023-02-16 01:08:16,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=479, Invalid=4792, Unknown=5, NotChecked=730, Total=6006 [2023-02-16 01:08:16,601 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 382 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 01:08:16,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 756 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 01:08:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-02-16 01:08:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2023-02-16 01:08:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-16 01:08:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-02-16 01:08:16,625 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 41 [2023-02-16 01:08:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 01:08:16,625 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-02-16 01:08:16,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 39 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 01:08:16,625 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-02-16 01:08:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 01:08:16,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 01:08:16,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 01:08:16,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 01:08:16,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:16,838 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 01:08:16,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 01:08:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1397547449, now seen corresponding path program 2 times [2023-02-16 01:08:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 01:08:16,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905078909] [2023-02-16 01:08:16,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 01:08:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 01:08:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:17,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 01:08:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:17,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 01:08:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-16 01:08:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 01:08:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 01:08:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 01:08:17,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905078909] [2023-02-16 01:08:17,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905078909] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 01:08:17,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651632377] [2023-02-16 01:08:17,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 01:08:17,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 01:08:17,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 01:08:17,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 01:08:17,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 01:08:17,909 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 01:08:17,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 01:08:17,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 140 conjunts are in the unsatisfiable core [2023-02-16 01:08:17,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 01:08:17,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 01:08:18,037 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 01:08:18,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 01:08:18,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:18,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:18,145 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-16 01:08:18,145 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 37 [2023-02-16 01:08:18,152 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 26 treesize of output 28 [2023-02-16 01:08:18,236 INFO L321 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-02-16 01:08:18,236 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 38 [2023-02-16 01:08:18,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 01:08:18,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:18,367 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-16 01:08:18,368 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 5 case distinctions, treesize of input 97 treesize of output 89 [2023-02-16 01:08:18,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:18,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:18,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:18,374 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 79 treesize of output 78 [2023-02-16 01:08:18,386 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-16 01:08:18,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2023-02-16 01:08:19,041 INFO L321 Elim1Store]: treesize reduction 364, result has 29.9 percent of original size [2023-02-16 01:08:19,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 27 case distinctions, treesize of input 307 treesize of output 253 [2023-02-16 01:08:19,189 INFO L321 Elim1Store]: treesize reduction 202, result has 33.1 percent of original size [2023-02-16 01:08:19,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 266 treesize of output 328 [2023-02-16 01:08:19,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:19,283 INFO L321 Elim1Store]: treesize reduction 172, result has 34.1 percent of original size [2023-02-16 01:08:19,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 236 treesize of output 237 [2023-02-16 01:08:19,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:19,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 01:08:19,356 INFO L321 Elim1Store]: treesize reduction 96, result has 37.7 percent of original size [2023-02-16 01:08:19,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 148 treesize of output 194