./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 23:24:42,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 23:24:42,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 23:24:42,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 23:24:42,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 23:24:42,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 23:24:42,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 23:24:42,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 23:24:42,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 23:24:42,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 23:24:42,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 23:24:42,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 23:24:42,625 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 23:24:42,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 23:24:42,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 23:24:42,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 23:24:42,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 23:24:42,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 23:24:42,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 23:24:42,638 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 23:24:42,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 23:24:42,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 23:24:42,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 23:24:42,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 23:24:42,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 23:24:42,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 23:24:42,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 23:24:42,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 23:24:42,649 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 23:24:42,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 23:24:42,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 23:24:42,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 23:24:42,651 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 23:24:42,651 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 23:24:42,652 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 23:24:42,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 23:24:42,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 23:24:42,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 23:24:42,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 23:24:42,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 23:24:42,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 23:24:42,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 23:24:42,691 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 23:24:42,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 23:24:42,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 23:24:42,692 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 23:24:42,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 23:24:42,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 23:24:42,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 23:24:42,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 23:24:42,693 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 23:24:42,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 23:24:42,693 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 23:24:42,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 23:24:42,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 23:24:42,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 23:24:42,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 23:24:42,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 23:24:42,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 23:24:42,694 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 23:24:42,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 23:24:42,695 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 23:24:42,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 23:24:42,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 23:24:42,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 23:24:42,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 23:24:42,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 23:24:42,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 23:24:42,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 23:24:42,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 23:24:42,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 23:24:42,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 23:24:42,696 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 23:24:42,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 23:24:42,696 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 23:24:42,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 23:24:42,697 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 23:24:42,697 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-02-17 23:24:42,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 23:24:42,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 23:24:42,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 23:24:42,894 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 23:24:42,895 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 23:24:42,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-17 23:24:43,871 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 23:24:44,118 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 23:24:44,120 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-17 23:24:44,128 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16d1fff6/bee25755016d4408898ed5992c443c51/FLAGc411a01ea [2023-02-17 23:24:44,138 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e16d1fff6/bee25755016d4408898ed5992c443c51 [2023-02-17 23:24:44,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 23:24:44,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 23:24:44,142 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 23:24:44,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 23:24:44,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 23:24:44,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa5d79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44, skipping insertion in model container [2023-02-17 23:24:44,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 23:24:44,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 23:24:44,324 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-17 23:24:44,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 23:24:44,332 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 23:24:44,361 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-17 23:24:44,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 23:24:44,379 INFO L208 MainTranslator]: Completed translation [2023-02-17 23:24:44,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44 WrapperNode [2023-02-17 23:24:44,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 23:24:44,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 23:24:44,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 23:24:44,381 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 23:24:44,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,431 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 172 [2023-02-17 23:24:44,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 23:24:44,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 23:24:44,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 23:24:44,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 23:24:44,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,464 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 23:24:44,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 23:24:44,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 23:24:44,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 23:24:44,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (1/1) ... [2023-02-17 23:24:44,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 23:24:44,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:44,496 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-17 23:24:44,502 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-17 23:24:44,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 23:24:44,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 23:24:44,521 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-17 23:24:44,521 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-17 23:24:44,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 23:24:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 23:24:44,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 23:24:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 23:24:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 23:24:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 23:24:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 23:24:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 23:24:44,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 23:24:44,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 23:24:44,646 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 23:24:44,647 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 23:24:44,844 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 23:24:44,848 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 23:24:44,853 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 23:24:44,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 11:24:44 BoogieIcfgContainer [2023-02-17 23:24:44,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 23:24:44,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 23:24:44,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 23:24:44,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 23:24:44,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 11:24:44" (1/3) ... [2023-02-17 23:24:44,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430de423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 11:24:44, skipping insertion in model container [2023-02-17 23:24:44,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 11:24:44" (2/3) ... [2023-02-17 23:24:44,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430de423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 11:24:44, skipping insertion in model container [2023-02-17 23:24:44,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 11:24:44" (3/3) ... [2023-02-17 23:24:44,862 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-02-17 23:24:44,874 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 23:24:44,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 23:24:44,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 23:24:44,922 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;@6131cb84, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 23:24:44,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 23:24:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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-17 23:24:44,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 23:24:44,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:44,932 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-17 23:24:44,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1111347289, now seen corresponding path program 1 times [2023-02-17 23:24:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:44,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304446721] [2023-02-17 23:24:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 23:24:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,278 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-17 23:24:45,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:45,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304446721] [2023-02-17 23:24:45,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304446721] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:24:45,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:24:45,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 23:24:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964307666] [2023-02-17 23:24:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:24:45,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 23:24:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 23:24:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 23:24:45,305 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 37 states have internal predecessors, (55), 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-17 23:24:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:45,368 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2023-02-17 23:24:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 23:24:45,370 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-17 23:24:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:45,374 INFO L225 Difference]: With dead ends: 77 [2023-02-17 23:24:45,374 INFO L226 Difference]: Without dead ends: 34 [2023-02-17 23:24:45,376 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-17 23:24:45,380 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:45,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:24:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-17 23:24:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-17 23:24:45,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-17 23:24:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2023-02-17 23:24:45,407 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2023-02-17 23:24:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:45,408 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2023-02-17 23:24:45,408 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-17 23:24:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2023-02-17 23:24:45,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 23:24:45,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:45,410 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-17 23:24:45,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 23:24:45,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:45,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:45,411 INFO L85 PathProgramCache]: Analyzing trace with hash -234931549, now seen corresponding path program 1 times [2023-02-17 23:24:45,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:45,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944131996] [2023-02-17 23:24:45,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:45,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 23:24:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,609 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-17 23:24:45,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:45,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944131996] [2023-02-17 23:24:45,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944131996] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:24:45,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:24:45,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 23:24:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191424069] [2023-02-17 23:24:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:24:45,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 23:24:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:45,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 23:24:45,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 23:24:45,616 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 23:24:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:45,667 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2023-02-17 23:24:45,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 23:24:45,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2023-02-17 23:24:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:45,672 INFO L225 Difference]: With dead ends: 64 [2023-02-17 23:24:45,672 INFO L226 Difference]: Without dead ends: 37 [2023-02-17 23:24:45,676 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-17 23:24:45,677 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:45,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 97 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:24:45,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-17 23:24:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-02-17 23:24:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-17 23:24:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2023-02-17 23:24:45,689 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 25 [2023-02-17 23:24:45,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:45,689 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2023-02-17 23:24:45,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-17 23:24:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2023-02-17 23:24:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-17 23:24:45,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:45,691 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:24:45,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 23:24:45,691 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1702704619, now seen corresponding path program 1 times [2023-02-17 23:24:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:45,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002284206] [2023-02-17 23:24:45,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:45,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:45,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:45,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002284206] [2023-02-17 23:24:45,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002284206] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:24:45,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 23:24:45,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 23:24:45,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714244426] [2023-02-17 23:24:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:24:45,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 23:24:45,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 23:24:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 23:24:45,805 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 23:24:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:45,865 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2023-02-17 23:24:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 23:24:45,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2023-02-17 23:24:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:45,868 INFO L225 Difference]: With dead ends: 65 [2023-02-17 23:24:45,868 INFO L226 Difference]: Without dead ends: 51 [2023-02-17 23:24:45,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 23:24:45,873 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:45,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 122 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:24:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-02-17 23:24:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 37. [2023-02-17 23:24:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-17 23:24:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2023-02-17 23:24:45,883 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 33 [2023-02-17 23:24:45,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:45,884 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2023-02-17 23:24:45,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 23:24:45,884 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2023-02-17 23:24:45,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 23:24:45,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:45,886 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-17 23:24:45,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 23:24:45,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:45,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:45,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1515040147, now seen corresponding path program 1 times [2023-02-17 23:24:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:45,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49973118] [2023-02-17 23:24:45,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:45,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:46,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:46,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:47,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 23:24:47,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49973118] [2023-02-17 23:24:47,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49973118] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:47,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051090819] [2023-02-17 23:24:47,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:47,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:47,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:47,221 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-17 23:24:47,222 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-17 23:24:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:47,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 137 conjunts are in the unsatisfiable core [2023-02-17 23:24:47,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:24:47,419 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-17 23:24:47,461 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-17 23:24:47,526 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:47,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 23:24:47,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:47,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 27 [2023-02-17 23:24:47,643 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 13 treesize of output 9 [2023-02-17 23:24:47,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:47,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 89 [2023-02-17 23:24:47,771 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 21 treesize of output 20 [2023-02-17 23:24:47,837 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 16 treesize of output 18 [2023-02-17 23:24:47,999 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 115 treesize of output 79 [2023-02-17 23:24:48,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 80 [2023-02-17 23:24:48,010 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-17 23:24:48,015 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 9 treesize of output 3 [2023-02-17 23:24:48,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:48,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 23:24:48,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:48,193 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 121 treesize of output 107 [2023-02-17 23:24:48,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:48,199 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 139 [2023-02-17 23:24:48,220 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 20 treesize of output 22 [2023-02-17 23:24:48,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,370 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 108 treesize of output 97 [2023-02-17 23:24:48,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 94 [2023-02-17 23:24:48,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,384 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 120 treesize of output 140 [2023-02-17 23:24:48,390 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-17 23:24:48,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,395 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 155 treesize of output 169 [2023-02-17 23:24:48,402 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 20 treesize of output 22 [2023-02-17 23:24:48,412 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,419 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 237 treesize of output 209 [2023-02-17 23:24:48,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 486 treesize of output 341 [2023-02-17 23:24:48,501 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 305 treesize of output 292 [2023-02-17 23:24:48,561 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,565 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,569 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,574 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,578 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,582 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,596 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 7 treesize of output 3 [2023-02-17 23:24:48,597 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,602 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,618 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,643 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,671 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,674 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,678 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,686 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,690 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,695 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,710 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,715 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,717 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,743 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,757 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,766 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:48,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 65 [2023-02-17 23:24:48,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 1 [2023-02-17 23:24:48,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 1 [2023-02-17 23:24:48,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2023-02-17 23:24:48,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 1 [2023-02-17 23:24:48,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:48,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 65 [2023-02-17 23:24:49,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:49,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 59 [2023-02-17 23:24:49,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 1 [2023-02-17 23:24:49,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 1 [2023-02-17 23:24:49,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 1 [2023-02-17 23:24:49,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 1 [2023-02-17 23:24:49,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:49,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 61 [2023-02-17 23:24:49,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 1 [2023-02-17 23:24:49,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 1 [2023-02-17 23:24:49,042 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:49,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2023-02-17 23:24:49,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 48 [2023-02-17 23:24:49,055 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,061 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 102 treesize of output 72 [2023-02-17 23:24:49,071 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,077 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,081 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,085 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,091 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,096 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,101 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 106 treesize of output 72 [2023-02-17 23:24:49,107 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,111 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,116 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,122 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,127 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,136 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,144 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,148 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,153 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,157 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,161 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,165 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,204 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,210 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,214 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,218 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,222 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,226 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,230 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,238 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,243 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,248 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 79 treesize of output 55 [2023-02-17 23:24:49,253 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,258 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,263 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 79 treesize of output 55 [2023-02-17 23:24:49,268 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,273 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,278 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,284 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,291 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,294 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,302 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 85 treesize of output 59 [2023-02-17 23:24:49,308 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,313 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,317 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,325 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,331 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,338 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 77 treesize of output 53 [2023-02-17 23:24:49,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,344 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 85 treesize of output 59 [2023-02-17 23:24:49,349 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,356 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 77 treesize of output 53 [2023-02-17 23:24:49,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,362 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 85 treesize of output 59 [2023-02-17 23:24:49,367 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,372 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,376 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,382 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,388 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 69 treesize of output 51 [2023-02-17 23:24:49,398 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,402 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,407 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,415 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,421 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,425 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,431 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,437 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,443 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,448 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,454 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,459 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,465 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 96 treesize of output 66 [2023-02-17 23:24:49,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:49,472 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 102 treesize of output 72 [2023-02-17 23:24:49,479 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,484 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,489 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,494 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:49,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:49,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 650 treesize of output 480 [2023-02-17 23:24:49,577 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:49,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 156 [2023-02-17 23:24:49,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:49,649 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2023-02-17 23:24:49,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 23:24:49,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:24:52,785 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| Int) (v_ArrVal_447 (Array Int Int)) (v_ArrVal_436 (Array Int Int)) (v_ArrVal_446 (Array Int Int)) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_431 (Array Int Int)) (v_ArrVal_445 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_447)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_446))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_445))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_430))) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_428) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8|)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_431) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 0)) |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| v_ArrVal_436) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base_8| |c_#StackHeapBarrier|)))) is different from false [2023-02-17 23:24:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051090819] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:52,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 23:24:52,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2023-02-17 23:24:52,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121978792] [2023-02-17 23:24:52,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 23:24:52,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-17 23:24:52,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:52,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-17 23:24:52,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2024, Unknown=86, NotChecked=92, Total=2352 [2023-02-17 23:24:52,790 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-17 23:24:54,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:54,195 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2023-02-17 23:24:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-17 23:24:54,196 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-02-17 23:24:54,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:54,196 INFO L225 Difference]: With dead ends: 79 [2023-02-17 23:24:54,196 INFO L226 Difference]: Without dead ends: 77 [2023-02-17 23:24:54,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=390, Invalid=3433, Unknown=87, NotChecked=122, Total=4032 [2023-02-17 23:24:54,198 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 516 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:54,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 396 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-17 23:24:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-17 23:24:54,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2023-02-17 23:24:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 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-17 23:24:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-02-17 23:24:54,207 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 34 [2023-02-17 23:24:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:54,207 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-02-17 23:24:54,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 34 states have internal predecessors, (54), 6 states have call successors, (6), 3 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-17 23:24:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-02-17 23:24:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 23:24:54,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:54,208 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:24:54,217 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-17 23:24:54,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:54,415 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:54,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1814087211, now seen corresponding path program 2 times [2023-02-17 23:24:54,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:54,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170843046] [2023-02-17 23:24:54,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:54,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:54,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 23:24:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:54,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170843046] [2023-02-17 23:24:54,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170843046] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:54,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729145825] [2023-02-17 23:24:54,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 23:24:54,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:54,552 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-17 23:24:54,554 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-17 23:24:54,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 23:24:54,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 23:24:54,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 23:24:54,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:24:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:54,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 23:24:54,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729145825] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:24:54,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 23:24:54,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-17 23:24:54,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248228937] [2023-02-17 23:24:54,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:24:54,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 23:24:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 23:24:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 23:24:54,697 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 23:24:54,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:54,716 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2023-02-17 23:24:54,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 23:24:54,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2023-02-17 23:24:54,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:54,717 INFO L225 Difference]: With dead ends: 58 [2023-02-17 23:24:54,717 INFO L226 Difference]: Without dead ends: 40 [2023-02-17 23:24:54,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 23:24:54,718 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 74 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:54,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 65 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:24:54,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-17 23:24:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-02-17 23:24:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 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-17 23:24:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2023-02-17 23:24:54,726 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 35 [2023-02-17 23:24:54,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:54,727 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2023-02-17 23:24:54,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 23:24:54,727 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2023-02-17 23:24:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 23:24:54,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:54,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:24:54,736 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-17 23:24:54,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:54,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:54,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1514019345, now seen corresponding path program 1 times [2023-02-17 23:24:54,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:54,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879203065] [2023-02-17 23:24:54,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:54,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 23:24:55,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:55,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879203065] [2023-02-17 23:24:55,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879203065] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:55,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408511178] [2023-02-17 23:24:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:55,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:55,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:55,043 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-17 23:24:55,045 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-17 23:24:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 23:24:55,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:24:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:55,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 23:24:55,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408511178] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 23:24:55,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 23:24:55,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-17 23:24:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655528889] [2023-02-17 23:24:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 23:24:55,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 23:24:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:55,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 23:24:55,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 23:24:55,184 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 23:24:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:55,198 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2023-02-17 23:24:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 23:24:55,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2023-02-17 23:24:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:55,199 INFO L225 Difference]: With dead ends: 56 [2023-02-17 23:24:55,199 INFO L226 Difference]: Without dead ends: 39 [2023-02-17 23:24:55,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-17 23:24:55,199 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 27 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:55,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 87 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 23:24:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-02-17 23:24:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-02-17 23:24:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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-17 23:24:55,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2023-02-17 23:24:55,210 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 35 [2023-02-17 23:24:55,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:55,210 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2023-02-17 23:24:55,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 23:24:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2023-02-17 23:24:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 23:24:55,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:55,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:24:55,223 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-17 23:24:55,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:55,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1637752339, now seen corresponding path program 1 times [2023-02-17 23:24:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684036472] [2023-02-17 23:24:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:55,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684036472] [2023-02-17 23:24:55,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684036472] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:55,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821731022] [2023-02-17 23:24:55,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:55,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:55,514 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-17 23:24:55,516 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-17 23:24:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:55,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 23:24:55,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:24:55,656 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-17 23:24:55,657 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-17 23:24:55,658 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:55,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:24:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:55,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821731022] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 23:24:55,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 23:24:55,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2023-02-17 23:24:55,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632628625] [2023-02-17 23:24:55,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 23:24:55,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 23:24:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 23:24:55,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 23:24:55,674 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 23:24:55,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:55,744 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2023-02-17 23:24:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 23:24:55,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-02-17 23:24:55,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:55,745 INFO L225 Difference]: With dead ends: 67 [2023-02-17 23:24:55,745 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 23:24:55,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-17 23:24:55,746 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:55,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 167 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 23:24:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 23:24:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 39. [2023-02-17 23:24:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-17 23:24:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2023-02-17 23:24:55,753 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 36 [2023-02-17 23:24:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:55,754 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2023-02-17 23:24:55,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 23:24:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2023-02-17 23:24:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-17 23:24:55,754 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:55,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:24:55,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-17 23:24:55,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:55,961 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1695010641, now seen corresponding path program 1 times [2023-02-17 23:24:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:55,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268348620] [2023-02-17 23:24:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:55,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:56,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 23:24:56,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:56,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268348620] [2023-02-17 23:24:56,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268348620] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:56,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375213070] [2023-02-17 23:24:56,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:56,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:56,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:56,157 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-17 23:24:56,176 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-17 23:24:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:56,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-17 23:24:56,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:24:56,391 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 21 treesize of output 13 [2023-02-17 23:24:56,418 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= |node_create_~temp~0#1.base| (+ (- 1) |c_#StackHeapBarrier|)) (exists ((v_ArrVal_1216 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1216))))) is different from true [2023-02-17 23:24:56,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:56,427 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 28 treesize of output 28 [2023-02-17 23:24:56,446 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 29 treesize of output 17 [2023-02-17 23:24:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-17 23:24:56,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:24:56,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375213070] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:56,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 23:24:56,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2023-02-17 23:24:56,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454422891] [2023-02-17 23:24:56,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 23:24:56,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 23:24:56,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:56,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 23:24:56,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=4, NotChecked=48, Total=702 [2023-02-17 23:24:56,543 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 23:24:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:56,798 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-02-17 23:24:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 23:24:56,799 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 36 [2023-02-17 23:24:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:56,800 INFO L225 Difference]: With dead ends: 54 [2023-02-17 23:24:56,800 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 23:24:56,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=4, NotChecked=64, Total=1190 [2023-02-17 23:24:56,801 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 143 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:56,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 276 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 42 Unchecked, 0.2s Time] [2023-02-17 23:24:56,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 23:24:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-02-17 23:24:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 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-17 23:24:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-02-17 23:24:56,810 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 36 [2023-02-17 23:24:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:56,811 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-02-17 23:24:56,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0) internal successors, (46), 19 states have internal predecessors, (46), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 23:24:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-02-17 23:24:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 23:24:56,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:56,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 23:24:56,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-17 23:24:57,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:57,018 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash 108256579, now seen corresponding path program 1 times [2023-02-17 23:24:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:57,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157584457] [2023-02-17 23:24:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:57,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:57,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 23:24:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:57,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157584457] [2023-02-17 23:24:57,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157584457] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:57,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774070963] [2023-02-17 23:24:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:57,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:57,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:57,189 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 23:24:57,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 23:24:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:57,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 23:24:57,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:24:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:57,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:24:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 23:24:57,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774070963] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 23:24:57,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 23:24:57,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2023-02-17 23:24:57,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789085348] [2023-02-17 23:24:57,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 23:24:57,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-17 23:24:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 23:24:57,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-17 23:24:57,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-17 23:24:57,408 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 23:24:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 23:24:57,558 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2023-02-17 23:24:57,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 23:24:57,558 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 38 [2023-02-17 23:24:57,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 23:24:57,559 INFO L225 Difference]: With dead ends: 51 [2023-02-17 23:24:57,559 INFO L226 Difference]: Without dead ends: 38 [2023-02-17 23:24:57,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-02-17 23:24:57,559 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 85 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 23:24:57,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 202 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 23:24:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-17 23:24:57,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-02-17 23:24:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 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-17 23:24:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-02-17 23:24:57,568 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 38 [2023-02-17 23:24:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 23:24:57,568 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-02-17 23:24:57,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 14 states have internal predecessors, (44), 5 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 23:24:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-02-17 23:24:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 23:24:57,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 23:24:57,569 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, 1] [2023-02-17 23:24:57,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 23:24:57,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:57,776 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 23:24:57,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 23:24:57,777 INFO L85 PathProgramCache]: Analyzing trace with hash 108212869, now seen corresponding path program 1 times [2023-02-17 23:24:57,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 23:24:57,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572828929] [2023-02-17 23:24:57,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:57,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 23:24:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 23:24:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 23:24:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-17 23:24:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:58,752 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 23:24:58,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 23:24:58,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572828929] [2023-02-17 23:24:58,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572828929] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 23:24:58,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95380222] [2023-02-17 23:24:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 23:24:58,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 23:24:58,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 23:24:58,754 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 23:24:58,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 23:24:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 23:24:59,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 141 conjunts are in the unsatisfiable core [2023-02-17 23:24:59,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 23:24:59,007 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-17 23:24:59,041 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-17 23:24:59,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:59,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 23:24:59,211 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-17 23:24:59,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:59,258 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 39 [2023-02-17 23:24:59,389 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 37 treesize of output 27 [2023-02-17 23:24:59,391 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 32 treesize of output 20 [2023-02-17 23:24:59,394 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-17 23:24:59,439 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 13 treesize of output 9 [2023-02-17 23:24:59,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:59,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-17 23:24:59,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:59,488 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 51 treesize of output 47 [2023-02-17 23:24:59,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:59,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:59,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2023-02-17 23:24:59,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:59,608 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 94 treesize of output 87 [2023-02-17 23:24:59,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 114 [2023-02-17 23:24:59,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:59,617 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 36 treesize of output 25 [2023-02-17 23:24:59,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:59,620 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 79 treesize of output 103 [2023-02-17 23:24:59,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 23:24:59,626 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 23 treesize of output 28 [2023-02-17 23:24:59,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2023-02-17 23:24:59,634 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 23:24:59,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:59,737 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 186 treesize of output 136 [2023-02-17 23:24:59,742 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 51 treesize of output 39 [2023-02-17 23:24:59,745 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 51 treesize of output 39 [2023-02-17 23:24:59,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 79 [2023-02-17 23:24:59,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:24:59,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 138 [2023-02-17 23:24:59,832 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 19 treesize of output 7 [2023-02-17 23:24:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 23:24:59,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 23:25:00,429 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1569 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1566)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1564))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1563))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1569))) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))) is different from false [2023-02-17 23:25:00,438 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1566 (Array Int Int)) (v_ArrVal_1564 (Array Int Int)) (v_ArrVal_1563 (Array Int Int)) (v_ArrVal_1569 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1566)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1564))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1563))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1569))) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))))) is different from false [2023-02-17 23:25:00,467 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:25:00,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 309 treesize of output 300 [2023-02-17 23:25:00,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 23:25:00,474 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 6486 treesize of output 6098 [2023-02-17 23:25:00,487 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 7020 treesize of output 5980