./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e1ff0e6 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/array-fpi/s4if.c -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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-14 22:22:06,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 22:22:06,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 22:22:06,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 22:22:06,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 22:22:06,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 22:22:06,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 22:22:06,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 22:22:06,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 22:22:06,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 22:22:06,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 22:22:06,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 22:22:06,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 22:22:06,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 22:22:06,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 22:22:06,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 22:22:06,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 22:22:06,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 22:22:06,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 22:22:06,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 22:22:06,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 22:22:06,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 22:22:06,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 22:22:06,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 22:22:06,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 22:22:06,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 22:22:06,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 22:22:06,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 22:22:06,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 22:22:06,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 22:22:06,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 22:22:06,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 22:22:06,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 22:22:06,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 22:22:06,250 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 22:22:06,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 22:22:06,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 22:22:06,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 22:22:06,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 22:22:06,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 22:22:06,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 22:22:06,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 22:22:06,267 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 22:22:06,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 22:22:06,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 22:22:06,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 22:22:06,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 22:22:06,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 22:22:06,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 22:22:06,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 22:22:06,270 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 22:22:06,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 22:22:06,270 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 22:22:06,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 22:22:06,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 22:22:06,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 22:22:06,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 22:22:06,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 22:22:06,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 22:22:06,271 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 22:22:06,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 22:22:06,272 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 22:22:06,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 22:22:06,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 22:22:06,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 22:22:06,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 22:22:06,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:22:06,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 22:22:06,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 22:22:06,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 22:22:06,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 22:22:06,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 22:22:06,273 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 22:22:06,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 22:22:06,274 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 22:22:06,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 22:22:06,274 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 22:22:06,274 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2023-02-14 22:22:06,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 22:22:06,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 22:22:06,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 22:22:06,510 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 22:22:06,511 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 22:22:06,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2023-02-14 22:22:07,584 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 22:22:07,748 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 22:22:07,749 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2023-02-14 22:22:07,754 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388f3bfbc/0e33808e736f40a0b332fc0723e0f62e/FLAG001a35310 [2023-02-14 22:22:07,765 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/388f3bfbc/0e33808e736f40a0b332fc0723e0f62e [2023-02-14 22:22:07,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 22:22:07,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 22:22:07,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 22:22:07,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 22:22:07,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 22:22:07,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:07,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec8713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07, skipping insertion in model container [2023-02-14 22:22:07,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:07,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 22:22:07,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 22:22:07,911 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/array-fpi/s4if.c[587,600] [2023-02-14 22:22:07,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:22:07,933 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 22:22:07,941 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/array-fpi/s4if.c[587,600] [2023-02-14 22:22:07,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 22:22:07,959 INFO L208 MainTranslator]: Completed translation [2023-02-14 22:22:07,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07 WrapperNode [2023-02-14 22:22:07,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 22:22:07,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 22:22:07,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 22:22:07,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 22:22:07,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:07,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:07,986 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2023-02-14 22:22:07,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 22:22:07,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 22:22:07,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 22:22:07,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 22:22:07,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:07,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:07,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:08,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:08,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:08,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:08,015 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:08,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:08,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 22:22:08,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 22:22:08,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 22:22:08,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 22:22:08,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (1/1) ... [2023-02-14 22:22:08,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 22:22:08,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:08,046 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-14 22:22:08,059 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-14 22:22:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 22:22:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 22:22:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 22:22:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 22:22:08,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 22:22:08,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 22:22:08,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 22:22:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 22:22:08,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 22:22:08,139 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 22:22:08,141 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 22:22:08,278 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 22:22:08,282 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 22:22:08,282 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-14 22:22:08,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:22:08 BoogieIcfgContainer [2023-02-14 22:22:08,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 22:22:08,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 22:22:08,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 22:22:08,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 22:22:08,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 10:22:07" (1/3) ... [2023-02-14 22:22:08,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b8e88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:22:08, skipping insertion in model container [2023-02-14 22:22:08,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 10:22:07" (2/3) ... [2023-02-14 22:22:08,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b8e88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 10:22:08, skipping insertion in model container [2023-02-14 22:22:08,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 10:22:08" (3/3) ... [2023-02-14 22:22:08,311 INFO L112 eAbstractionObserver]: Analyzing ICFG s4if.c [2023-02-14 22:22:08,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 22:22:08,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 22:22:08,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 22:22:08,390 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;@601e6e87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 22:22:08,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 22:22:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:08,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 22:22:08,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:08,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:08,401 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:08,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:08,406 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2023-02-14 22:22:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:08,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544265953] [2023-02-14 22:22:08,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:08,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544265953] [2023-02-14 22:22:08,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544265953] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:22:08,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:22:08,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 22:22:08,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313400355] [2023-02-14 22:22:08,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:22:08,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 22:22:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:08,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 22:22:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:22:08,656 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:08,672 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2023-02-14 22:22:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 22:22:08,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-14 22:22:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:08,680 INFO L225 Difference]: With dead ends: 34 [2023-02-14 22:22:08,680 INFO L226 Difference]: Without dead ends: 15 [2023-02-14 22:22:08,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 22:22:08,687 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:08,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:22:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-14 22:22:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-02-14 22:22:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-02-14 22:22:08,713 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2023-02-14 22:22:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:08,713 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-02-14 22:22:08,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-02-14 22:22:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-14 22:22:08,714 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:08,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:08,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 22:22:08,716 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:08,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:08,716 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2023-02-14 22:22:08,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:08,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79651114] [2023-02-14 22:22:08,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:08,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:08,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:08,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79651114] [2023-02-14 22:22:08,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79651114] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 22:22:08,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 22:22:08,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 22:22:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075903095] [2023-02-14 22:22:08,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 22:22:08,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 22:22:08,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 22:22:08,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 22:22:08,898 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:08,949 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2023-02-14 22:22:08,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 22:22:08,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-14 22:22:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:08,966 INFO L225 Difference]: With dead ends: 28 [2023-02-14 22:22:08,966 INFO L226 Difference]: Without dead ends: 20 [2023-02-14 22:22:08,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-14 22:22:08,968 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:08,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:22:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-14 22:22:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2023-02-14 22:22:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2023-02-14 22:22:08,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2023-02-14 22:22:08,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:08,973 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2023-02-14 22:22:08,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:08,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2023-02-14 22:22:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 22:22:08,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:08,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:08,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 22:22:08,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:08,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2023-02-14 22:22:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:08,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864236918] [2023-02-14 22:22:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:08,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:09,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864236918] [2023-02-14 22:22:09,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864236918] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:09,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6703193] [2023-02-14 22:22:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:09,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:09,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:09,657 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-14 22:22:09,662 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-14 22:22:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:09,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 22:22:09,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:09,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 22:22:09,820 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 10 treesize of output 8 [2023-02-14 22:22:09,859 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-14 22:22:09,954 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-14 22:22:10,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2023-02-14 22:22:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:10,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:10,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:22:10,444 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 79 treesize of output 72 [2023-02-14 22:22:10,447 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 22:22:10,449 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 66 treesize of output 54 [2023-02-14 22:22:10,454 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 22 treesize of output 10 [2023-02-14 22:22:10,459 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 22 treesize of output 10 [2023-02-14 22:22:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:10,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6703193] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:10,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:10,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2023-02-14 22:22:10,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555025707] [2023-02-14 22:22:10,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:10,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 22:22:10,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:10,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 22:22:10,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=1, NotChecked=0, Total=342 [2023-02-14 22:22:10,475 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:10,862 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-14 22:22:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 22:22:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 22:22:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:10,864 INFO L225 Difference]: With dead ends: 39 [2023-02-14 22:22:10,864 INFO L226 Difference]: Without dead ends: 35 [2023-02-14 22:22:10,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=530, Unknown=1, NotChecked=0, Total=702 [2023-02-14 22:22:10,865 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 54 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:10,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 37 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:22:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-14 22:22:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2023-02-14 22:22:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-14 22:22:10,871 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 16 [2023-02-14 22:22:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:10,871 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-14 22:22:10,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-14 22:22:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-14 22:22:10,872 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:10,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:10,889 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-14 22:22:11,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:11,080 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2023-02-14 22:22:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:11,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325537694] [2023-02-14 22:22:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:11,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:22:11,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1244877149] [2023-02-14 22:22:11,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:11,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:11,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:11,097 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-14 22:22:11,106 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-14 22:22:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:11,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 22:22:11,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:11,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 22:22:11,199 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-14 22:22:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:11,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:11,231 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 14 treesize of output 12 [2023-02-14 22:22:11,233 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 18 treesize of output 16 [2023-02-14 22:22:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:11,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:11,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325537694] [2023-02-14 22:22:11,250 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:22:11,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244877149] [2023-02-14 22:22:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244877149] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:11,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:22:11,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-02-14 22:22:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509620063] [2023-02-14 22:22:11,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-14 22:22:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-14 22:22:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-02-14 22:22:11,254 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:11,317 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2023-02-14 22:22:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 22:22:11,318 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-14 22:22:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:11,319 INFO L225 Difference]: With dead ends: 38 [2023-02-14 22:22:11,319 INFO L226 Difference]: Without dead ends: 26 [2023-02-14 22:22:11,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-02-14 22:22:11,321 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:11,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 22:22:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-14 22:22:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-14 22:22:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-02-14 22:22:11,338 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2023-02-14 22:22:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:11,338 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-02-14 22:22:11,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-02-14 22:22:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 22:22:11,340 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:11,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:11,355 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-14 22:22:11,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-14 22:22:11,551 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:11,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2023-02-14 22:22:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679537156] [2023-02-14 22:22:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:11,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:11,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679537156] [2023-02-14 22:22:11,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679537156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:11,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083092968] [2023-02-14 22:22:11,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:22:11,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:11,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:11,624 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-14 22:22:11,646 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-14 22:22:11,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:22:11,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:11,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 22:22:11,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:11,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:11,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083092968] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:11,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:11,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-14 22:22:11,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920403117] [2023-02-14 22:22:11,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:11,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 22:22:11,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 22:22:11,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-14 22:22:11,791 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:11,918 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-14 22:22:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 22:22:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-14 22:22:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:11,921 INFO L225 Difference]: With dead ends: 33 [2023-02-14 22:22:11,921 INFO L226 Difference]: Without dead ends: 29 [2023-02-14 22:22:11,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-14 22:22:11,923 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:11,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:22:11,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-14 22:22:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2023-02-14 22:22:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2023-02-14 22:22:11,935 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2023-02-14 22:22:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:11,936 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2023-02-14 22:22:11,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2023-02-14 22:22:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 22:22:11,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:11,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:11,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:12,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:12,145 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:12,145 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2023-02-14 22:22:12,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:12,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851318557] [2023-02-14 22:22:12,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:12,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:12,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:12,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851318557] [2023-02-14 22:22:12,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851318557] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:12,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252178187] [2023-02-14 22:22:12,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:22:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:12,220 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-14 22:22:12,223 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-14 22:22:12,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-14 22:22:12,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:12,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 22:22:12,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:12,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:12,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252178187] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:12,355 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:12,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-14 22:22:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139364908] [2023-02-14 22:22:12,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:12,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 22:22:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:12,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 22:22:12,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-14 22:22:12,357 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:12,434 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-02-14 22:22:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 22:22:12,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-14 22:22:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:12,435 INFO L225 Difference]: With dead ends: 37 [2023-02-14 22:22:12,435 INFO L226 Difference]: Without dead ends: 25 [2023-02-14 22:22:12,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-14 22:22:12,436 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:12,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 30 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:22:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-14 22:22:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-02-14 22:22:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2023-02-14 22:22:12,441 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2023-02-14 22:22:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:12,441 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2023-02-14 22:22:12,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2023-02-14 22:22:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 22:22:12,442 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:12,442 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:12,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:12,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:12,648 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2023-02-14 22:22:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:12,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88016488] [2023-02-14 22:22:12,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:13,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:13,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88016488] [2023-02-14 22:22:13,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88016488] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:13,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740740112] [2023-02-14 22:22:13,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:22:13,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:13,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:13,107 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-14 22:22:13,140 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-14 22:22:13,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:22:13,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:13,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 22:22:13,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:13,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 22:22:13,195 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 10 treesize of output 8 [2023-02-14 22:22:13,229 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-14 22:22:13,258 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-14 22:22:13,385 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-14 22:22:13,531 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:22:13,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-14 22:22:13,646 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:22:13,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2023-02-14 22:22:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:13,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:18,600 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (not (= .cse0 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse6 .cse7 .cse8)) (not (= .cse8 4)) (not (= .cse6 4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_42|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|))))))))) is different from false [2023-02-14 22:22:18,659 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4)))) (.cse3 (* |v_ULTIMATE.start_main_~i~0#1_42| 4))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse3)))) (or (< (+ .cse0 .cse1 .cse2) (+ 5 .cse3)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse2 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse0 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_43| Int) (|v_ULTIMATE.start_main_~i~0#1_42| Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select v_ArrVal_153 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_43| 4))))) (let ((.cse7 (select (select (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_42| 4))))) (or (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse7 .cse8 .cse9)) (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_43|)) (not (= .cse9 4)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_42|) (not (= .cse7 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_43| 1) |v_ULTIMATE.start_main_~i~0#1_42|)))))))))) is different from false [2023-02-14 22:22:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-14 22:22:18,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740740112] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:18,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:18,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35 [2023-02-14 22:22:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622441406] [2023-02-14 22:22:18,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:18,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-14 22:22:18,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:18,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-14 22:22:18,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=934, Unknown=4, NotChecked=126, Total=1190 [2023-02-14 22:22:18,732 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:23,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:22:25,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:22:32,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 22:22:34,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:22:36,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:22:39,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-14 22:22:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:42,452 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2023-02-14 22:22:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-14 22:22:42,456 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 22:22:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:42,458 INFO L225 Difference]: With dead ends: 52 [2023-02-14 22:22:42,458 INFO L226 Difference]: Without dead ends: 41 [2023-02-14 22:22:42,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=349, Invalid=2303, Unknown=8, NotChecked=202, Total=2862 [2023-02-14 22:22:42,460 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:42,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 500 Invalid, 5 Unknown, 75 Unchecked, 12.6s Time] [2023-02-14 22:22:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-14 22:22:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2023-02-14 22:22:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2023-02-14 22:22:42,468 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 21 [2023-02-14 22:22:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:42,469 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2023-02-14 22:22:42,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4) internal successors, (49), 35 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2023-02-14 22:22:42,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-14 22:22:42,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:42,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:42,479 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-14 22:22:42,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:42,675 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2023-02-14 22:22:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218231985] [2023-02-14 22:22:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:42,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:22:42,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150940436] [2023-02-14 22:22:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:42,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:42,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:42,689 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-14 22:22:42,692 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-14 22:22:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:42,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 22:22:42,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:42,790 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-14 22:22:42,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:42,845 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-14 22:22:42,873 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-14 22:22:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:42,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:42,930 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2023-02-14 22:22:42,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:22:42,941 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 24 treesize of output 25 [2023-02-14 22:22:42,948 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:22:42,948 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 38 treesize of output 34 [2023-02-14 22:22:42,951 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-14 22:22:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-14 22:22:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:42,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218231985] [2023-02-14 22:22:42,993 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:22:42,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150940436] [2023-02-14 22:22:42,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150940436] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:42,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:22:42,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-14 22:22:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471677511] [2023-02-14 22:22:42,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:42,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 22:22:42,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 22:22:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=145, Unknown=3, NotChecked=24, Total=210 [2023-02-14 22:22:42,995 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:43,148 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2023-02-14 22:22:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 22:22:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-14 22:22:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:43,150 INFO L225 Difference]: With dead ends: 52 [2023-02-14 22:22:43,150 INFO L226 Difference]: Without dead ends: 40 [2023-02-14 22:22:43,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=242, Unknown=3, NotChecked=32, Total=342 [2023-02-14 22:22:43,151 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:43,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 50 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2023-02-14 22:22:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-02-14 22:22:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-02-14 22:22:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-02-14 22:22:43,159 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 21 [2023-02-14 22:22:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:43,159 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-02-14 22:22:43,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-02-14 22:22:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-14 22:22:43,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:43,160 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:43,169 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-14 22:22:43,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:43,368 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2023-02-14 22:22:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:43,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986933885] [2023-02-14 22:22:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986933885] [2023-02-14 22:22:43,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986933885] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862737507] [2023-02-14 22:22:43,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:22:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:43,505 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-14 22:22:43,508 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-14 22:22:43,582 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-14 22:22:43,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:43,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 22:22:43,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:43,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:43,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862737507] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:43,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:43,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-14 22:22:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001526923] [2023-02-14 22:22:43,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:43,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 22:22:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:43,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 22:22:43,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-14 22:22:43,693 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:43,850 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-02-14 22:22:43,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-14 22:22:43,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-14 22:22:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:43,851 INFO L225 Difference]: With dead ends: 47 [2023-02-14 22:22:43,851 INFO L226 Difference]: Without dead ends: 43 [2023-02-14 22:22:43,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-14 22:22:43,852 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:43,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:22:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-14 22:22:43,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2023-02-14 22:22:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2023-02-14 22:22:43,861 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 23 [2023-02-14 22:22:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:43,861 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2023-02-14 22:22:43,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2023-02-14 22:22:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-14 22:22:43,862 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:43,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:43,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:44,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:44,071 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -981578845, now seen corresponding path program 2 times [2023-02-14 22:22:44,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:44,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401405966] [2023-02-14 22:22:44,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:44,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:22:44,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436583542] [2023-02-14 22:22:44,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:22:44,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:44,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:44,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:44,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-14 22:22:44,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:22:44,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:44,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 22:22:44,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:44,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401405966] [2023-02-14 22:22:44,274 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:22:44,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436583542] [2023-02-14 22:22:44,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436583542] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:44,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:22:44,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-02-14 22:22:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60441907] [2023-02-14 22:22:44,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:44,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 22:22:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:44,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 22:22:44,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-02-14 22:22:44,275 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:22:44,396 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2023-02-14 22:22:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 22:22:44,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-14 22:22:44,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:22:44,397 INFO L225 Difference]: With dead ends: 51 [2023-02-14 22:22:44,397 INFO L226 Difference]: Without dead ends: 30 [2023-02-14 22:22:44,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-02-14 22:22:44,398 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:22:44,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:22:44,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-14 22:22:44,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2023-02-14 22:22:44,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:44,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-02-14 22:22:44,403 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2023-02-14 22:22:44,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:22:44,404 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-02-14 22:22:44,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:22:44,404 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-02-14 22:22:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 22:22:44,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:22:44,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:22:44,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-14 22:22:44,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-14 22:22:44,605 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:22:44,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:22:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 6 times [2023-02-14 22:22:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:22:44,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895841341] [2023-02-14 22:22:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:22:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:22:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:22:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:45,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:22:45,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895841341] [2023-02-14 22:22:45,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895841341] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:22:45,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886950742] [2023-02-14 22:22:45,235 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-14 22:22:45,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:22:45,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:22:45,236 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:22:45,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-14 22:22:45,321 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-14 22:22:45,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:22:45,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-14 22:22:45,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:22:45,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 22:22:45,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:45,364 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-14 22:22:45,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:45,398 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-14 22:22:45,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:45,441 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-14 22:22:45,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:45,585 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-14 22:22:45,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:45,745 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:22:45,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2023-02-14 22:22:45,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:45,962 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-14 22:22:45,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 55 [2023-02-14 22:22:46,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:22:46,108 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-02-14 22:22:46,108 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 33 [2023-02-14 22:22:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:22:46,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:22:50,646 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse4 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse4)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ .cse1 .cse2 .cse3 .cse0) (+ 5 .cse4)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse8 (select (select (store .cse11 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 3) (+ .cse8 .cse9 .cse10 .cse7)) (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|)))))))))) is different from false [2023-02-14 22:22:50,765 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ 7 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (+ .cse1 .cse2 .cse3 .cse0)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2023-02-14 22:22:50,966 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_83| 4))))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse0)) (< (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 11) (+ .cse1 .cse2 .cse3 .cse0)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse2 4)) (not (= .cse1 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_85| Int) (|v_ULTIMATE.start_main_~i~0#1_84| Int) (|v_ULTIMATE.start_main_~i~0#1_83| Int) (v_ArrVal_301 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_301))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select v_ArrVal_301 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_85| 4))))) (let ((.cse9 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_84| 4)))) (.cse11 (* |v_ULTIMATE.start_main_~i~0#1_83| 4))) (let ((.cse8 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse11)))) (or (not (<= 0 |v_ULTIMATE.start_main_~i~0#1_85|)) (not (= 4 .cse7)) (< (+ .cse8 .cse9 .cse10 .cse7) (+ 5 .cse11)) (< .cse4 |v_ULTIMATE.start_main_~i~0#1_83|) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_85| 1) |v_ULTIMATE.start_main_~i~0#1_84|)) (not (= .cse9 4)) (not (= .cse8 4)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_84| 1) |v_ULTIMATE.start_main_~i~0#1_83|))))))))))) is different from false [2023-02-14 22:22:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-02-14 22:22:51,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886950742] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:22:51,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:22:51,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2023-02-14 22:22:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938007301] [2023-02-14 22:22:51,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:22:51,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-14 22:22:51,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:22:51,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-14 22:22:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1720, Unknown=4, NotChecked=258, Total=2162 [2023-02-14 22:22:51,087 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:03,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:23:15,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 22:23:17,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:23:18,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:23:21,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:23:25,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-14 22:23:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:23:31,998 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2023-02-14 22:23:31,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-14 22:23:31,999 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 22:23:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:23:32,000 INFO L225 Difference]: With dead ends: 70 [2023-02-14 22:23:32,000 INFO L226 Difference]: Without dead ends: 59 [2023-02-14 22:23:32,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=656, Invalid=5203, Unknown=5, NotChecked=456, Total=6320 [2023-02-14 22:23:32,003 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 99 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-02-14 22:23:32,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 77 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 569 Invalid, 5 Unknown, 147 Unchecked, 13.8s Time] [2023-02-14 22:23:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-14 22:23:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2023-02-14 22:23:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2023-02-14 22:23:32,015 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 26 [2023-02-14 22:23:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:23:32,015 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2023-02-14 22:23:32,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2023-02-14 22:23:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-14 22:23:32,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:23:32,016 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:23:32,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-14 22:23:32,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:23:32,222 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:23:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:23:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 3 times [2023-02-14 22:23:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:23:32,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543681887] [2023-02-14 22:23:32,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:23:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:23:32,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:23:32,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1809281778] [2023-02-14 22:23:32,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:23:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:23:32,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:23:32,243 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:23:32,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-14 22:23:32,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-14 22:23:32,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:23:32,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 22:23:32,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:23:32,346 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 15 treesize of output 11 [2023-02-14 22:23:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:32,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 22:23:32,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:32,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-14 22:23:32,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:23:32,483 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 23 treesize of output 19 [2023-02-14 22:23:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-02-14 22:23:32,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:23:32,582 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_349 (Array Int Int))) (or (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) c_~N~0) (not (< |ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2023-02-14 22:23:32,697 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:23:32,697 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 26 treesize of output 27 [2023-02-14 22:23:32,705 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-02-14 22:23:32,705 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 42 treesize of output 30 [2023-02-14 22:23:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 8 not checked. [2023-02-14 22:23:32,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:23:32,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543681887] [2023-02-14 22:23:32,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:23:32,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809281778] [2023-02-14 22:23:32,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809281778] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:23:32,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:23:32,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-02-14 22:23:32,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416109161] [2023-02-14 22:23:32,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:23:32,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-14 22:23:32,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:23:32,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-14 22:23:32,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=4, NotChecked=26, Total=240 [2023-02-14 22:23:32,726 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:23:40,955 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2023-02-14 22:23:40,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 22:23:40,956 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-14 22:23:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:23:40,957 INFO L225 Difference]: With dead ends: 59 [2023-02-14 22:23:40,957 INFO L226 Difference]: Without dead ends: 55 [2023-02-14 22:23:40,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=4, NotChecked=36, Total=420 [2023-02-14 22:23:40,958 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:23:40,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2023-02-14 22:23:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-14 22:23:40,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-02-14 22:23:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-02-14 22:23:40,970 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 26 [2023-02-14 22:23:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:23:40,970 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-02-14 22:23:40,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-02-14 22:23:40,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 22:23:40,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:23:40,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:23:40,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-14 22:23:41,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-14 22:23:41,177 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:23:41,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:23:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 7 times [2023-02-14 22:23:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:23:41,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529830781] [2023-02-14 22:23:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:23:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:23:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:23:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:23:41,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:23:41,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529830781] [2023-02-14 22:23:41,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529830781] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:23:41,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326710631] [2023-02-14 22:23:41,319 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-14 22:23:41,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:23:41,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:23:41,321 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:23:41,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-14 22:23:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:23:41,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 22:23:41,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:23:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:23:41,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:23:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:23:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326710631] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:23:41,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:23:41,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-14 22:23:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029075578] [2023-02-14 22:23:41,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:23:41,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 22:23:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:23:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 22:23:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-14 22:23:41,573 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:41,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:23:41,781 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2023-02-14 22:23:41,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 22:23:41,782 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-14 22:23:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:23:41,782 INFO L225 Difference]: With dead ends: 69 [2023-02-14 22:23:41,782 INFO L226 Difference]: Without dead ends: 65 [2023-02-14 22:23:41,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-14 22:23:41,783 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:23:41,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 25 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:23:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-14 22:23:41,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2023-02-14 22:23:41,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2023-02-14 22:23:41,798 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 28 [2023-02-14 22:23:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:23:41,799 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2023-02-14 22:23:41,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:23:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2023-02-14 22:23:41,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 22:23:41,800 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:23:41,800 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:23:41,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-14 22:23:42,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-14 22:23:42,005 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:23:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:23:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 8 times [2023-02-14 22:23:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:23:42,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836868818] [2023-02-14 22:23:42,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:23:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:23:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:23:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:23:42,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:23:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836868818] [2023-02-14 22:23:42,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836868818] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:23:42,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697978877] [2023-02-14 22:23:42,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 22:23:42,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:23:42,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:23:42,835 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:23:42,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-14 22:23:42,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 22:23:42,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:23:42,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-14 22:23:42,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:23:42,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 22:23:42,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:42,962 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-14 22:23:43,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,009 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-14 22:23:43,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,050 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-14 22:23:43,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,086 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-14 22:23:43,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,239 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-14 22:23:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,363 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:23:43,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2023-02-14 22:23:43,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,502 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:23:43,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2023-02-14 22:23:43,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,624 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:23:43,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2023-02-14 22:23:43,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 22:23:43,726 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 22:23:43,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2023-02-14 22:23:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:23:43,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:23:52,876 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse5 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (< (+ .cse0 3) (+ .cse1 .cse2 .cse3 .cse4 .cse5)) (not (= 4 .cse5)) (not (= .cse4 4)) (not (= .cse3 4)) (not (= .cse2 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ 5 .cse0)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse10 4)))))))))))) is different from false [2023-02-14 22:23:52,959 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse2 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (< (+ 7 .cse3) (+ .cse4 .cse5 .cse2 .cse1 .cse0)) (not (= .cse5 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse9 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse9 .cse10 .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse8 4)) (< (+ .cse9 .cse10 .cse11 .cse12 .cse8) (+ .cse3 9)) (not (= .cse11 4)) (not (= .cse12 4)) (not (= .cse10 4)))))))))))) is different from false [2023-02-14 22:23:53,103 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse2 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (< (+ .cse1 .cse2 .cse3 .cse4 .cse0) (+ .cse5 13)) (not (= .cse3 4)) (not (= .cse4 4)) (not (= .cse2 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse10 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 .cse10 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse8)) (not (= .cse9 4)) (not (= .cse10 4)) (< (+ .cse5 11) (+ .cse11 .cse12 .cse10 .cse9 .cse8)) (not (= .cse12 4)))))))))))) is different from false [2023-02-14 22:23:53,334 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_5 Int) (v_subst_3 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_129| Int) (v_subst_1 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_5))))) (let ((.cse3 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_3))))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse3 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_1))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (< (+ .cse2 .cse3 .cse1 .cse4 .cse0) (+ .cse5 17)) (not (= .cse4 4)) (not (= .cse3 4)))))))))) (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_subst_6 Int) (v_subst_4 Int) (v_ArrVal_443 (Array Int Int)) (v_subst_2 Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_443))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select v_ArrVal_443 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_128| 4))))) (let ((.cse12 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_6))))) (let ((.cse9 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_4))))) (let ((.cse11 (select (select (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse10 .cse12 .cse9 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* 4 v_subst_2))))) (or (not (= 4 .cse8)) (not (= .cse9 4)) (< (+ .cse5 15) (+ .cse10 .cse11 .cse12 .cse9 .cse8)) (not (= .cse12 4)) (not (= .cse11 4)))))))))))) is different from false [2023-02-14 22:23:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2023-02-14 22:23:53,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697978877] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:23:53,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:23:53,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 52 [2023-02-14 22:23:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317893418] [2023-02-14 22:23:53,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:23:53,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 22:23:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:23:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 22:23:53,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2084, Unknown=6, NotChecked=380, Total=2652 [2023-02-14 22:23:53,468 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:00,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:24:02,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-14 22:24:09,482 WARN L233 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 117 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-14 22:24:25,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-02-14 22:24:33,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-14 22:24:36,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2023-02-14 22:24:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:24:36,414 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2023-02-14 22:24:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-14 22:24:36,415 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-14 22:24:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:24:36,415 INFO L225 Difference]: With dead ends: 78 [2023-02-14 22:24:36,415 INFO L226 Difference]: Without dead ends: 74 [2023-02-14 22:24:36,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=326, Invalid=3715, Unknown=7, NotChecked=508, Total=4556 [2023-02-14 22:24:36,417 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 33 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2023-02-14 22:24:36,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 140 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 966 Invalid, 5 Unknown, 167 Unchecked, 13.9s Time] [2023-02-14 22:24:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-14 22:24:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2023-02-14 22:24:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2023-02-14 22:24:36,433 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 31 [2023-02-14 22:24:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:24:36,434 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2023-02-14 22:24:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2023-02-14 22:24:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-14 22:24:36,435 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:24:36,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:24:36,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-14 22:24:36,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-14 22:24:36,643 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:24:36,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:24:36,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1338916473, now seen corresponding path program 4 times [2023-02-14 22:24:36,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:24:36,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518628831] [2023-02-14 22:24:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:24:36,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:24:36,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 22:24:36,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080682052] [2023-02-14 22:24:36,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:24:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:24:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:24:36,654 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:24:36,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-14 22:24:36,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:24:36,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:24:36,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-14 22:24:36,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:24:36,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-14 22:24:36,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-14 22:24:36,777 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 27 [2023-02-14 22:24:36,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-14 22:24:36,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-14 22:24:37,016 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 31 treesize of output 31 [2023-02-14 22:24:37,093 INFO L321 Elim1Store]: treesize reduction 14, result has 60.0 percent of original size [2023-02-14 22:24:37,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2023-02-14 22:24:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-14 22:24:37,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:24:37,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 22:24:37,759 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 2 case distinctions, treesize of input 66 treesize of output 51 [2023-02-14 22:24:37,770 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-02-14 22:24:37,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 50 [2023-02-14 22:24:37,777 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 22 treesize of output 18 [2023-02-14 22:24:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:37,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:24:37,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518628831] [2023-02-14 22:24:37,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 22:24:37,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080682052] [2023-02-14 22:24:37,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080682052] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:24:37,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 22:24:37,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2023-02-14 22:24:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249939608] [2023-02-14 22:24:37,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 22:24:37,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-14 22:24:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:24:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-14 22:24:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2023-02-14 22:24:37,855 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:41,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:24:41,683 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2023-02-14 22:24:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-02-14 22:24:41,684 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-14 22:24:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:24:41,686 INFO L225 Difference]: With dead ends: 123 [2023-02-14 22:24:41,686 INFO L226 Difference]: Without dead ends: 119 [2023-02-14 22:24:41,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1354, Invalid=5288, Unknown=0, NotChecked=0, Total=6642 [2023-02-14 22:24:41,690 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 156 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 22:24:41,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 57 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-14 22:24:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-14 22:24:41,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 61. [2023-02-14 22:24:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2023-02-14 22:24:41,714 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 31 [2023-02-14 22:24:41,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:24:41,714 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2023-02-14 22:24:41,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2023-02-14 22:24:41,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-14 22:24:41,718 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:24:41,718 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:24:41,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-14 22:24:41,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-02-14 22:24:41,924 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:24:41,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:24:41,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 9 times [2023-02-14 22:24:41,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:24:41,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157500925] [2023-02-14 22:24:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:24:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:24:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:24:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:24:42,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157500925] [2023-02-14 22:24:42,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157500925] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:24:42,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564863398] [2023-02-14 22:24:42,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 22:24:42,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:24:42,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:24:42,093 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:24:42,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-14 22:24:42,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-14 22:24:42,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:24:42,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 22:24:42,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:24:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:42,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:24:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:42,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564863398] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:24:42,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:24:42,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-14 22:24:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904689949] [2023-02-14 22:24:42,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:24:42,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 22:24:42,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:24:42,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 22:24:42,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-14 22:24:42,404 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:24:42,742 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2023-02-14 22:24:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-14 22:24:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-02-14 22:24:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:24:42,743 INFO L225 Difference]: With dead ends: 100 [2023-02-14 22:24:42,743 INFO L226 Difference]: Without dead ends: 96 [2023-02-14 22:24:42,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2023-02-14 22:24:42,744 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 40 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 22:24:42,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 22:24:42,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-14 22:24:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 53. [2023-02-14 22:24:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 52 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2023-02-14 22:24:42,762 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 33 [2023-02-14 22:24:42,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:24:42,762 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2023-02-14 22:24:42,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:42,763 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2023-02-14 22:24:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-14 22:24:42,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:24:42,763 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:24:42,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-14 22:24:42,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:24:42,969 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:24:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:24:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 10 times [2023-02-14 22:24:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:24:42,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458076657] [2023-02-14 22:24:42,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:24:42,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:24:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:24:43,124 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:43,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:24:43,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458076657] [2023-02-14 22:24:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458076657] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:24:43,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855870533] [2023-02-14 22:24:43,125 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 22:24:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:24:43,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:24:43,129 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:24:43,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-14 22:24:43,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 22:24:43,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:24:43,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 22:24:43,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:24:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:43,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:24:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:43,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855870533] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:24:43,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:24:43,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2023-02-14 22:24:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217996199] [2023-02-14 22:24:43,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:24:43,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 22:24:43,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:24:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 22:24:43,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-02-14 22:24:43,454 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 22:24:43,723 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2023-02-14 22:24:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 22:24:43,724 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-14 22:24:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 22:24:43,724 INFO L225 Difference]: With dead ends: 101 [2023-02-14 22:24:43,724 INFO L226 Difference]: Without dead ends: 50 [2023-02-14 22:24:43,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=641, Unknown=0, NotChecked=0, Total=870 [2023-02-14 22:24:43,725 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 22:24:43,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 29 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 22:24:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-14 22:24:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2023-02-14 22:24:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-02-14 22:24:43,735 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 34 [2023-02-14 22:24:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 22:24:43,735 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-02-14 22:24:43,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 22:24:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-02-14 22:24:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-14 22:24:43,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 22:24:43,735 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 22:24:43,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-02-14 22:24:43,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 22:24:43,936 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 22:24:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 22:24:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 11 times [2023-02-14 22:24:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 22:24:43,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608061319] [2023-02-14 22:24:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 22:24:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 22:24:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 22:24:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 22:24:44,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608061319] [2023-02-14 22:24:44,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608061319] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 22:24:44,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371646084] [2023-02-14 22:24:44,985 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-14 22:24:44,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 22:24:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 22:24:44,989 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-14 22:24:45,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-14 22:24:45,096 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-02-14 22:24:45,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 22:24:45,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-14 22:24:45,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 22:24:45,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 22:24:45,112 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 10 treesize of output 8 [2023-02-14 22:24:45,141 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-14 22:24:45,179 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-14 22:24:45,220 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-14 22:24:45,264 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-14 22:24:45,306 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-14 22:24:45,443 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-14 22:24:45,605 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-14 22:24:45,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2023-02-14 22:24:45,791 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-02-14 22:24:45,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 51 [2023-02-14 22:24:46,005 INFO L321 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-02-14 22:24:46,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 66 [2023-02-14 22:24:46,255 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-02-14 22:24:46,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 77 [2023-02-14 22:24:46,695 INFO L321 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2023-02-14 22:24:46,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 41 [2023-02-14 22:24:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:24:46,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 22:26:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 44 refuted. 16 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 22:26:28,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371646084] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 22:26:28,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 22:26:28,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 72 [2023-02-14 22:26:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780556149] [2023-02-14 22:26:28,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 22:26:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-14 22:26:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 22:26:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-14 22:26:28,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=4565, Unknown=147, NotChecked=0, Total=5112 [2023-02-14 22:26:28,162 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 72 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)