./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s3lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/s3lif.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 3aac75742402b60de8e734a48b2dd5180b95add96e084901e84c53f880aa300a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:40:57,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:40:57,279 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:40:57,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:40:57,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:40:57,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:40:57,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:40:57,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:40:57,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:40:57,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:40:57,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:40:57,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:40:57,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:40:57,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:40:57,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:40:57,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:40:57,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:40:57,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:40:57,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:40:57,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:40:57,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:40:57,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:40:57,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:40:57,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:40:57,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:40:57,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:40:57,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:40:57,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:40:57,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:40:57,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:40:57,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:40:57,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:40:57,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:40:57,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:40:57,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:40:57,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:40:57,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:40:57,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:40:57,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:40:57,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:40:57,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:40:57,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:40:57,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:40:57,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:40:57,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:40:57,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:40:57,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:40:57,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:40:57,366 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:40:57,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:40:57,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:40:57,367 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:40:57,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:40:57,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:40:57,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:40:57,369 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:40:57,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:40:57,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:40:57,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:40:57,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:40:57,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:40:57,370 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:40:57,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:40:57,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:40:57,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:40:57,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:40:57,371 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:40:57,371 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:40:57,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:40:57,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 3aac75742402b60de8e734a48b2dd5180b95add96e084901e84c53f880aa300a [2022-07-19 10:40:57,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:40:57,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:40:57,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:40:57,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:40:57,561 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:40:57,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s3lif.c [2022-07-19 10:40:57,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66919d852/443af1cb3e244d6883445c47ca859691/FLAG02f7fc2b2 [2022-07-19 10:40:57,903 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:40:57,903 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s3lif.c [2022-07-19 10:40:57,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66919d852/443af1cb3e244d6883445c47ca859691/FLAG02f7fc2b2 [2022-07-19 10:40:58,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66919d852/443af1cb3e244d6883445c47ca859691 [2022-07-19 10:40:58,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:40:58,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:40:58,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:40:58,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:40:58,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:40:58,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64dbfb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58, skipping insertion in model container [2022-07-19 10:40:58,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:40:58,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:40:58,475 WARN L230 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/s3lif.c[588,601] [2022-07-19 10:40:58,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:40:58,493 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:40:58,500 WARN L230 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/s3lif.c[588,601] [2022-07-19 10:40:58,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:40:58,514 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:40:58,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58 WrapperNode [2022-07-19 10:40:58,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:40:58,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:40:58,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:40:58,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:40:58,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,536 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-19 10:40:58,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:40:58,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:40:58,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:40:58,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:40:58,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:40:58,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:40:58,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:40:58,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:40:58,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (1/1) ... [2022-07-19 10:40:58,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:40:58,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:40:58,573 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) [2022-07-19 10:40:58,575 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 [2022-07-19 10:40:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:40:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:40:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:40:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:40:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:40:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:40:58,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:40:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:40:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:40:58,645 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:40:58,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:40:58,727 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:40:58,731 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:40:58,731 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 10:40:58,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:40:58 BoogieIcfgContainer [2022-07-19 10:40:58,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:40:58,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:40:58,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:40:58,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:40:58,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:40:58" (1/3) ... [2022-07-19 10:40:58,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35bea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:40:58, skipping insertion in model container [2022-07-19 10:40:58,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:40:58" (2/3) ... [2022-07-19 10:40:58,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35bea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:40:58, skipping insertion in model container [2022-07-19 10:40:58,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:40:58" (3/3) ... [2022-07-19 10:40:58,738 INFO L111 eAbstractionObserver]: Analyzing ICFG s3lif.c [2022-07-19 10:40:58,747 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:40:58,747 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:40:58,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:40:58,790 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ad28ed1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42640ca [2022-07-19 10:40:58,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:40:58,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) [2022-07-19 10:40:58,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 10:40:58,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:40:58,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:40:58,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:40:58,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:40:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-19 10:40:58,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:40:58,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468751308] [2022-07-19 10:40:58,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:40:58,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:40:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:40:58,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:40:58,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:40:58,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468751308] [2022-07-19 10:40:58,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468751308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:40:58,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:40:58,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:40:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120518580] [2022-07-19 10:40:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:40:58,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:40:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:40:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:40:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:40:58,922 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2022-07-19 10:40:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:40:58,937 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-19 10:40:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:40:58,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2022-07-19 10:40:58,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:40:58,942 INFO L225 Difference]: With dead ends: 40 [2022-07-19 10:40:58,943 INFO L226 Difference]: Without dead ends: 18 [2022-07-19 10:40:58,944 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 [2022-07-19 10:40:58,947 INFO L413 NwaCegarLoop]: 26 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, 26 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 [2022-07-19 10:40:58,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:40:58,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-19 10:40:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-19 10:40:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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) [2022-07-19 10:40:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-19 10:40:58,975 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-19 10:40:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:40:58,976 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-19 10:40:58,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2022-07-19 10:40:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-19 10:40:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 10:40:58,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:40:58,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:40:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:40:58,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:40:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:40:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-19 10:40:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:40:58,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593244270] [2022-07-19 10:40:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:40:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:40:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:40:59,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:40:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:40:59,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593244270] [2022-07-19 10:40:59,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593244270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:40:59,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:40:59,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:40:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327656593] [2022-07-19 10:40:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:40:59,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:40:59,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:40:59,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:40:59,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:40:59,042 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-19 10:40:59,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:40:59,101 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-19 10:40:59,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:40:59,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-19 10:40:59,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:40:59,103 INFO L225 Difference]: With dead ends: 36 [2022-07-19 10:40:59,103 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 10:40:59,103 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 [2022-07-19 10:40:59,104 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:40:59,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:40:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 10:40:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-19 10:40:59,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 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) [2022-07-19 10:40:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-19 10:40:59,109 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-19 10:40:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:40:59,109 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-19 10:40:59,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-19 10:40:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-19 10:40:59,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:40:59,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:40:59,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:40:59,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:40:59,110 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:40:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:40:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-19 10:40:59,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:40:59,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564417999] [2022-07-19 10:40:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:40:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:40:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:40:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:40:59,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:40:59,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564417999] [2022-07-19 10:40:59,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564417999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:40:59,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410823264] [2022-07-19 10:40:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:40:59,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:40:59,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:40:59,510 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) [2022-07-19 10:40:59,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:40:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:40:59,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 10:40:59,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:40:59,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:40:59,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:40:59,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:40:59,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 23 [2022-07-19 10:40:59,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 23 [2022-07-19 10:40:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:40:59,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:00,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:41:00,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-07-19 10:41:00,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:41:00,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-07-19 10:41:00,238 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:41:00,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 12 [2022-07-19 10:41:00,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:41:00,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410823264] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:00,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:00,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 28 [2022-07-19 10:41:00,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839756170] [2022-07-19 10:41:00,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:00,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-19 10:41:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:00,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-19 10:41:00,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-07-19 10:41:00,259 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 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) [2022-07-19 10:41:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:00,638 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-19 10:41:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:41:00,638 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 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 20 [2022-07-19 10:41:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:00,640 INFO L225 Difference]: With dead ends: 47 [2022-07-19 10:41:00,640 INFO L226 Difference]: Without dead ends: 43 [2022-07-19 10:41:00,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=822, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:41:00,641 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:00,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 60 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 202 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-07-19 10:41:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-19 10:41:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-07-19 10:41:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 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) [2022-07-19 10:41:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-19 10:41:00,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-19 10:41:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:00,646 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-19 10:41:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 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) [2022-07-19 10:41:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-19 10:41:00,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:41:00,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:00,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:00,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:00,864 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 [2022-07-19 10:41:00,864 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-19 10:41:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:00,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164004394] [2022-07-19 10:41:00,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:00,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:00,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164004394] [2022-07-19 10:41:00,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164004394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:00,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485415356] [2022-07-19 10:41:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:00,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:00,971 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) [2022-07-19 10:41:00,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:41:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:01,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-19 10:41:01,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:01,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 14 [2022-07-19 10:41:01,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:01,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:01,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:01,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 [2022-07-19 10:41:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:01,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485415356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:01,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:01,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-19 10:41:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800017786] [2022-07-19 10:41:01,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:01,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:41:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:41:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:41:01,098 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) [2022-07-19 10:41:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:01,153 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-07-19 10:41:01,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:41:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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 20 [2022-07-19 10:41:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:01,154 INFO L225 Difference]: With dead ends: 48 [2022-07-19 10:41:01,154 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 10:41:01,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:41:01,155 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:01,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 50 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:41:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 10:41:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-19 10:41:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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) [2022-07-19 10:41:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-19 10:41:01,159 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-07-19 10:41:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:01,159 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-19 10:41:01,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 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) [2022-07-19 10:41:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-19 10:41:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:41:01,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:01,160 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:01,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:01,374 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 [2022-07-19 10:41:01,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:01,375 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-19 10:41:01,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:01,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040985909] [2022-07-19 10:41:01,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:01,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:01,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:01,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040985909] [2022-07-19 10:41:01,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040985909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:01,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376041461] [2022-07-19 10:41:01,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:41:01,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:01,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:01,421 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) [2022-07-19 10:41:01,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:41:01,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:41:01,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:01,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:41:01,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:01,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:01,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:01,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376041461] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:01,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:01,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:41:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626753413] [2022-07-19 10:41:01,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:01,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:41:01,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:01,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:41:01,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:41:01,515 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2022-07-19 10:41:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:01,590 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-19 10:41:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:41:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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 22 [2022-07-19 10:41:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:01,591 INFO L225 Difference]: With dead ends: 70 [2022-07-19 10:41:01,591 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 10:41:01,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:41:01,592 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:01,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 30 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:41:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 10:41:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-19 10:41:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2022-07-19 10:41:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-19 10:41:01,596 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-19 10:41:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:01,596 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-19 10:41:01,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 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) [2022-07-19 10:41:01,597 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-19 10:41:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:41:01,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:01,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:01,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:01,811 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 [2022-07-19 10:41:01,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:01,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-19 10:41:01,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:01,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259095615] [2022-07-19 10:41:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:01,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259095615] [2022-07-19 10:41:01,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259095615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:01,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002435938] [2022-07-19 10:41:01,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:41:01,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:01,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:01,881 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) [2022-07-19 10:41:01,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:41:01,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 10:41:01,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:01,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:41:01,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:01,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:41:02,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002435938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:02,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:02,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:41:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748753726] [2022-07-19 10:41:02,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:02,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:41:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:41:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:41:02,001 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2022-07-19 10:41:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:02,085 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-19 10:41:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:41:02,086 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 22 [2022-07-19 10:41:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:02,086 INFO L225 Difference]: With dead ends: 39 [2022-07-19 10:41:02,086 INFO L226 Difference]: Without dead ends: 31 [2022-07-19 10:41:02,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:41:02,087 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:02,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:41:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-19 10:41:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-19 10:41:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 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) [2022-07-19 10:41:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-19 10:41:02,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-19 10:41:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:02,090 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-19 10:41:02,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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) [2022-07-19 10:41:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-19 10:41:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:41:02,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:02,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:02,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:02,291 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 [2022-07-19 10:41:02,291 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-19 10:41:02,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:02,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717771424] [2022-07-19 10:41:02,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:02,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:41:03,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:03,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717771424] [2022-07-19 10:41:03,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717771424] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:03,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846520613] [2022-07-19 10:41:03,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:41:03,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:03,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:03,033 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) [2022-07-19 10:41:03,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:41:03,078 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:41:03,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:03,080 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 10:41:03,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:03,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:03,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:03,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:03,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:03,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-07-19 10:41:03,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:41:03,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2022-07-19 10:41:03,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-07-19 10:41:03,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:03,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2022-07-19 10:41:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:41:03,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:04,486 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-19 10:41:04,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 73 [2022-07-19 10:41:04,506 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 3) .cse0) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (= (* ~N~0 4) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (not (= (+ (- 3) (select v_arrayElimArr_3 .cse4)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-19 10:41:04,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((~N~0 Int) (v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (- 3) .cse0) 1)) (= (* ~N~0 4) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4) .cse3))))) (not (= (+ (- 3) (select v_arrayElimArr_3 .cse4)) 1))))) is different from false [2022-07-19 10:41:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-19 10:41:04,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846520613] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:04,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:04,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2022-07-19 10:41:04,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940372562] [2022-07-19 10:41:04,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:04,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 10:41:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 10:41:04,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2023, Unknown=2, NotChecked=190, Total=2550 [2022-07-19 10:41:04,568 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 51 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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) [2022-07-19 10:41:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:06,284 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-19 10:41:06,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 10:41:06,284 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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 27 [2022-07-19 10:41:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:06,285 INFO L225 Difference]: With dead ends: 64 [2022-07-19 10:41:06,285 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 10:41:06,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=544, Invalid=3002, Unknown=2, NotChecked=234, Total=3782 [2022-07-19 10:41:06,287 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:06,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 88 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 601 Invalid, 0 Unknown, 74 Unchecked, 0.5s Time] [2022-07-19 10:41:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 10:41:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2022-07-19 10:41:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 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) [2022-07-19 10:41:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-19 10:41:06,292 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 27 [2022-07-19 10:41:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:06,292 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-19 10:41:06,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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) [2022-07-19 10:41:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-19 10:41:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:41:06,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:06,293 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:06,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:06,503 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 [2022-07-19 10:41:06,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-19 10:41:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:06,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228510741] [2022-07-19 10:41:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:41:06,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:06,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228510741] [2022-07-19 10:41:06,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228510741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:06,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020655835] [2022-07-19 10:41:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:06,626 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) [2022-07-19 10:41:06,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:41:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:06,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 10:41:06,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:06,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:06,721 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:41:06,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-19 10:41:06,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 10:41:06,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:41:06,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:06,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2022-07-19 10:41:06,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 24 [2022-07-19 10:41:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:41:06,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020655835] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:06,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:06,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-19 10:41:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611956289] [2022-07-19 10:41:06,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:06,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:41:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:41:06,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:41:06,794 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) [2022-07-19 10:41:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:06,981 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-07-19 10:41:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:41:06,981 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) Word has length 27 [2022-07-19 10:41:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:06,982 INFO L225 Difference]: With dead ends: 62 [2022-07-19 10:41:06,982 INFO L226 Difference]: Without dead ends: 49 [2022-07-19 10:41:06,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-07-19 10:41:06,983 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:06,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 52 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:41:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-19 10:41:06,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-07-19 10:41:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 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) [2022-07-19 10:41:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-07-19 10:41:06,988 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 27 [2022-07-19 10:41:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:06,988 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-07-19 10:41:06,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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) [2022-07-19 10:41:06,988 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-07-19 10:41:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:41:06,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:06,989 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:07,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:07,203 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 [2022-07-19 10:41:07,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:07,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:07,204 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-19 10:41:07,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:07,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340991348] [2022-07-19 10:41:07,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:07,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:41:07,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:07,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340991348] [2022-07-19 10:41:07,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340991348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:07,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633006750] [2022-07-19 10:41:07,245 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:41:07,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:07,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:07,246 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) [2022-07-19 10:41:07,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:41:07,306 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-19 10:41:07,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:07,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:41:07,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:41:07,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:41:07,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633006750] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:07,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:07,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:41:07,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539462685] [2022-07-19 10:41:07,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:07,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:41:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:07,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:41:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:41:07,386 INFO L87 Difference]: Start difference. First operand 43 states and 49 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) [2022-07-19 10:41:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:07,478 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-07-19 10:41:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:41:07,478 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 29 [2022-07-19 10:41:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:07,479 INFO L225 Difference]: With dead ends: 86 [2022-07-19 10:41:07,479 INFO L226 Difference]: Without dead ends: 53 [2022-07-19 10:41:07,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:41:07,480 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 79 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:07,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 30 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:41:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-19 10:41:07,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-07-19 10:41:07,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 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) [2022-07-19 10:41:07,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-07-19 10:41:07,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-07-19 10:41:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:07,485 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-07-19 10:41:07,485 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) [2022-07-19 10:41:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-07-19 10:41:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:41:07,485 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:07,486 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:07,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:07,699 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 [2022-07-19 10:41:07,699 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:07,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-07-19 10:41:07,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:07,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051976815] [2022-07-19 10:41:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:07,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 10:41:07,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:07,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051976815] [2022-07-19 10:41:07,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051976815] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:07,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955547493] [2022-07-19 10:41:07,746 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:41:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:07,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:07,748 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) [2022-07-19 10:41:07,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:41:07,803 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-19 10:41:07,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:07,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:41:07,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:07,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:41:07,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-19 10:41:07,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955547493] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:07,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:07,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:41:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933148897] [2022-07-19 10:41:07,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:07,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:41:07,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:07,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:41:07,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:41:07,886 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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) [2022-07-19 10:41:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:07,982 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-07-19 10:41:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:41:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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 29 [2022-07-19 10:41:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:07,983 INFO L225 Difference]: With dead ends: 48 [2022-07-19 10:41:07,983 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 10:41:07,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:41:07,984 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:07,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 27 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:41:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 10:41:07,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-19 10:41:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 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) [2022-07-19 10:41:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-19 10:41:07,988 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-07-19 10:41:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:07,988 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-19 10:41:07,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 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) [2022-07-19 10:41:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-19 10:41:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:41:07,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:07,988 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:08,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:08,188 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 [2022-07-19 10:41:08,189 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:08,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:08,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-19 10:41:08,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:08,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919887885] [2022-07-19 10:41:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:41:09,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:09,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919887885] [2022-07-19 10:41:09,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919887885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:09,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192459911] [2022-07-19 10:41:09,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:41:09,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:09,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:09,234 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) [2022-07-19 10:41:09,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 10:41:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:09,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-19 10:41:09,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:09,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:09,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:09,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:09,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:09,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:09,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:09,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:09,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2022-07-19 10:41:09,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:09,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:09,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:09,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-07-19 10:41:09,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:41:09,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:09,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:09,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:09,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2022-07-19 10:41:10,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:10,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:10,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:10,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:41:10,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:10,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2022-07-19 10:41:10,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-07-19 10:41:10,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 37 [2022-07-19 10:41:10,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:41:10,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:12,382 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-19 10:41:12,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 429 treesize of output 149 [2022-07-19 10:41:12,405 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 4)) (= (* ~N~0 4) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 .cse1 4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (+ (- 3) (select v_arrayElimArr_4 .cse4)) 1)) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 3)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-19 10:41:12,435 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 4)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (= (* ~N~0 4) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 .cse1 4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (not (= (+ (- 3) (select v_arrayElimArr_4 .cse4)) 1)) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 3)) 1))))) is different from false [2022-07-19 10:41:12,484 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (= (* ~N~0 4) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 .cse1 4 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (+ (- 3) (select v_arrayElimArr_4 .cse4)) 1)) (not (= (+ (select v_arrayElimArr_4 .cse5) (- 3)) 1))))) is different from false [2022-07-19 10:41:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-19 10:41:12,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192459911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:12,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:12,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2022-07-19 10:41:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209805142] [2022-07-19 10:41:12,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:12,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-19 10:41:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:12,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-19 10:41:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=3546, Unknown=3, NotChecked=378, Total=4422 [2022-07-19 10:41:12,517 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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) [2022-07-19 10:41:25,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:25,779 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2022-07-19 10:41:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-19 10:41:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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 [2022-07-19 10:41:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:25,780 INFO L225 Difference]: With dead ends: 101 [2022-07-19 10:41:25,780 INFO L226 Difference]: Without dead ends: 83 [2022-07-19 10:41:25,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3374 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=1142, Invalid=8767, Unknown=3, NotChecked=594, Total=10506 [2022-07-19 10:41:25,783 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:25,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 135 Invalid, 1669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1172 Invalid, 0 Unknown, 213 Unchecked, 1.3s Time] [2022-07-19 10:41:25,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-19 10:41:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2022-07-19 10:41:25,789 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) [2022-07-19 10:41:25,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-19 10:41:25,789 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-19 10:41:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:25,790 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-19 10:41:25,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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) [2022-07-19 10:41:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-19 10:41:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:41:25,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:25,790 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:25,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:26,003 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 [2022-07-19 10:41:26,003 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:26,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-19 10:41:26,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:26,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900173642] [2022-07-19 10:41:26,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:26,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:41:26,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:26,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900173642] [2022-07-19 10:41:26,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900173642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:26,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005522470] [2022-07-19 10:41:26,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:41:26,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:26,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:26,154 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) [2022-07-19 10:41:26,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 10:41:26,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:41:26,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:26,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-19 10:41:26,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:26,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:26,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:26,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-07-19 10:41:26,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:26,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 24 [2022-07-19 10:41:26,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:26,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:41:26,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:26,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 14 [2022-07-19 10:41:26,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 24 [2022-07-19 10:41:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:41:26,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005522470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:26,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:26,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-19 10:41:26,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785205271] [2022-07-19 10:41:26,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:26,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-19 10:41:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-19 10:41:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-19 10:41:26,428 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 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) [2022-07-19 10:41:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:26,750 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-19 10:41:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-19 10:41:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 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) Word has length 34 [2022-07-19 10:41:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:26,751 INFO L225 Difference]: With dead ends: 76 [2022-07-19 10:41:26,751 INFO L226 Difference]: Without dead ends: 61 [2022-07-19 10:41:26,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 10:41:26,752 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:26,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 77 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:41:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-19 10:41:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-19 10:41:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 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) [2022-07-19 10:41:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-19 10:41:26,758 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-19 10:41:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:26,758 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-19 10:41:26,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 27 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) [2022-07-19 10:41:26,758 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-19 10:41:26,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:41:26,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:26,759 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:26,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:26,963 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 [2022-07-19 10:41:26,964 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:26,964 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-19 10:41:26,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:26,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139435972] [2022-07-19 10:41:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:41:27,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:27,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139435972] [2022-07-19 10:41:27,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139435972] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:27,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58130029] [2022-07-19 10:41:27,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:41:27,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:27,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:27,036 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) [2022-07-19 10:41:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 10:41:27,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:41:27,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:27,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:41:27,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:41:27,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 10:41:27,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58130029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:27,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:27,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:41:27,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88925408] [2022-07-19 10:41:27,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:27,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:41:27,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:41:27,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:41:27,198 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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) [2022-07-19 10:41:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:27,317 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-19 10:41:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:41:27,317 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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) Word has length 36 [2022-07-19 10:41:27,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:27,317 INFO L225 Difference]: With dead ends: 86 [2022-07-19 10:41:27,317 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 10:41:27,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-19 10:41:27,318 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 77 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:27,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 38 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:41:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 10:41:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-19 10:41:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 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) [2022-07-19 10:41:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-19 10:41:27,324 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-19 10:41:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:27,324 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-19 10:41:27,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 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) [2022-07-19 10:41:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-19 10:41:27,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:41:27,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:27,324 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:27,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 10:41:27,541 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 [2022-07-19 10:41:27,542 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-19 10:41:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:27,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809829867] [2022-07-19 10:41:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:27,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 10:41:27,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:27,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809829867] [2022-07-19 10:41:27,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809829867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:27,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433225181] [2022-07-19 10:41:27,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:41:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:27,606 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) [2022-07-19 10:41:27,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 10:41:27,698 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 10:41:27,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:27,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:41:27,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:41:27,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:41:27,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433225181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:27,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:27,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:41:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67278195] [2022-07-19 10:41:27,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:27,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:41:27,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:41:27,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:41:27,805 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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) [2022-07-19 10:41:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:41:27,958 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-19 10:41:27,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:41:27,958 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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 39 [2022-07-19 10:41:27,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:41:27,959 INFO L225 Difference]: With dead ends: 49 [2022-07-19 10:41:27,959 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 10:41:27,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:41:27,959 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:41:27,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 27 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:41:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 10:41:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-19 10:41:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 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) [2022-07-19 10:41:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-19 10:41:27,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-19 10:41:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:41:27,965 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-19 10:41:27,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 17 states have internal predecessors, (56), 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) [2022-07-19 10:41:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-19 10:41:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:41:27,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:41:27,965 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:41:27,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-19 10:41:28,179 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 [2022-07-19 10:41:28,180 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:41:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:41:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-19 10:41:28,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:41:28,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918194713] [2022-07-19 10:41:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:41:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:41:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:41:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 1 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:41:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:41:29,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918194713] [2022-07-19 10:41:29,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918194713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:41:29,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833474155] [2022-07-19 10:41:29,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:41:29,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:41:29,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:41:29,391 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) [2022-07-19 10:41:29,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 10:41:29,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:41:29,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:41:29,457 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-19 10:41:29,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:41:29,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:29,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:29,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:29,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:29,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:29,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:29,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:29,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:29,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:29,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:29,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:41:29,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:29,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:29,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2022-07-19 10:41:30,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 59 [2022-07-19 10:41:30,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2022-07-19 10:41:30,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:41:30,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2022-07-19 10:41:30,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:41:30,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 66 [2022-07-19 10:41:30,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:41:30,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 77 [2022-07-19 10:41:30,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-07-19 10:41:30,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:41:30,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 46 [2022-07-19 10:41:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:41:30,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:41:37,681 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-19 10:41:37,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2022-07-19 10:41:50,468 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 3) (select v_arrayElimArr_5 .cse0)) 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (= (* ~N~0 4) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse5 .cse6))))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (select v_arrayElimArr_5 .cse8) 4)) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 3)) 1)) (not (= (+ (- 3) .cse5) 1))))) is different from false [2022-07-19 10:41:50,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 3) (select v_arrayElimArr_5 .cse0)) 1)) (= (* ~N~0 4) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse5 .cse6))))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= (select v_arrayElimArr_5 .cse8) 4)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 3)) 1)) (not (= (+ (- 3) .cse5) 1))))) is different from false [2022-07-19 10:41:50,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= (+ (- 3) (select v_arrayElimArr_5 .cse0)) 1)) (= (* ~N~0 4) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (+ .cse1 .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse5 .cse6))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse5 .cse6))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= (select v_arrayElimArr_5 .cse8) 4)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (+ (select v_arrayElimArr_5 .cse7) (- 3)) 1)) (not (= (+ (- 3) .cse5) 1))))) is different from false [2022-07-19 10:41:50,682 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-19 10:41:50,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833474155] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:41:50,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:41:50,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 86 [2022-07-19 10:41:50,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679488425] [2022-07-19 10:41:50,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:41:50,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-19 10:41:50,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:41:50,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-19 10:41:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=6021, Unknown=81, NotChecked=492, Total=7310 [2022-07-19 10:41:50,686 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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) [2022-07-19 10:43:19,625 WARN L233 SmtUtils]: Spent 20.95s on a formula simplification. DAG size of input: 201 DAG size of output: 194 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:43:50,505 WARN L233 SmtUtils]: Spent 16.87s on a formula simplification. DAG size of input: 201 DAG size of output: 190 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:44:07,254 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse18 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse84 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse19 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse82 (+ .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse58 (select .cse19 .cse82)) (.cse59 (select .cse19 .cse84)) (.cse80 (+ .cse18 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse43 (+ .cse18 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (select .cse19 .cse80)) (.cse66 (store .cse19 .cse84 (+ 3 .cse59))) (.cse83 (+ .cse58 3))) (let ((.cse73 (store .cse66 .cse82 .cse83)) (.cse81 (+ 3 .cse57)) (.cse48 (select .cse19 .cse43))) (let ((.cse44 (+ 3 .cse48)) (.cse13 (* c_~N~0 4)) (.cse9 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse56 (store .cse73 .cse80 .cse81)) (.cse12 (store .cse19 .cse82 .cse83)) (.cse11 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse14 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0)) (.cse20 (select .cse19 .cse11)) (.cse27 (store .cse12 .cse80 .cse81)) (.cse15 (= .cse13 (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse56))) (let ((.cse75 (select .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse76 (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse78 (select .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse77 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse79 (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ (select (select (store .cse74 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse75 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse76 .cse77 .cse78 .cse79))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse76 .cse77 .cse78 .cse79)))))))) (.cse46 (= .cse13 (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse73))) (let ((.cse69 (select .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse70 (select .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse72 (select .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse71 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse67 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse70 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ .cse67 (select (select (store .cse68 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse69 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse67 .cse70 .cse71 .cse72))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse70 .cse71 .cse72)))))))) (.cse1 (= .cse13 (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse66))) (let ((.cse64 (select .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse61 (select .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse65 (select .cse66 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse62 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse60 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse61 .cse62 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ .cse60 .cse61 .cse62 (select (select (store .cse63 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse64 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse60 .cse61 .cse62 .cse65))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse65)))))))) (.cse0 (not (= .cse59 1))) (.cse2 (not (= .cse58 1))) (.cse16 (not (= .cse57 1))) (.cse17 (not (= |c_ULTIMATE.start_main_#t~mem8#1| 1))) (.cse47 (= .cse13 (let ((.cse55 (store .cse56 .cse43 .cse44))) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse55))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse49 (select .cse55 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse50 (select .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse51 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ .cse49 .cse50 .cse51 .cse52 (select (select (store .cse53 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse54 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse49 .cse50 .cse51 .cse52))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9)))))))))) (.cse45 (not (= .cse48 1)))) (and (or .cse0 .cse1) (or .cse2 (= (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse12))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse8 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ .cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse6 .cse7 .cse8)))))) .cse13)) .cse14 (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (or .cse15 .cse2 .cse16 .cse17) (or (< 4 c_~N~0) (and .cse14 (<= .cse18 .cse13))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or .cse14 (< 3 |c_ULTIMATE.start_main_~i~0#1|)) (= .cse13 (+ (select .cse19 0) .cse20 (select .cse19 8) (select .cse19 12))) (or .cse2 (= (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse21 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse23 (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse22 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse26 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ .cse21 .cse22 .cse23 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse21 .cse22 .cse23 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse26)))))) .cse13) .cse16) (let ((.cse28 (select .cse19 .cse10)) (.cse34 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse35 (select .cse19 .cse9))) (or (not (= .cse28 1)) (not (= .cse20 1)) (= .cse13 (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ 3 .cse34)) .cse11 (+ .cse20 3)) .cse10 (+ .cse28 3)) .cse9 (+ 3 .cse35))))) (let ((.cse32 (select .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse33 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 3 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 3 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ .cse29 .cse30 (select (select (store .cse31 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse32 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 3 .cse33 .cse34))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) 3 .cse33 .cse34))))))) (not (= .cse34 1)) (not (= .cse35 1)))) (or .cse2 .cse16 (= (let ((.cse42 (store .cse27 .cse43 .cse44))) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse42))) (let ((.cse40 (select .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse36 (select .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse37 (select .cse42 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (+ .cse36 .cse37 .cse38 (select (select (store .cse39 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse40 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse36 .cse37 .cse38 .cse41))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9) .cse41))))))) .cse13) .cse45) (or .cse15 .cse2 .cse0 .cse16) (or .cse2 .cse46 .cse17) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or .cse2 .cse0 .cse46) (or .cse1 .cse17) (<= 4 c_~N~0) (or .cse2 .cse0 .cse16 .cse47 .cse45) (or .cse2 .cse16 .cse17 .cse47 .cse45))))))))) is different from false [2022-07-19 10:44:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:44:31,029 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-07-19 10:44:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-19 10:44:31,029 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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 41 [2022-07-19 10:44:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:44:31,030 INFO L225 Difference]: With dead ends: 113 [2022-07-19 10:44:31,030 INFO L226 Difference]: Without dead ends: 93 [2022-07-19 10:44:31,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 124 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4924 ImplicationChecksByTransitivity, 177.7s TimeCoverageRelationStatistics Valid=1594, Invalid=13061, Unknown=123, NotChecked=972, Total=15750 [2022-07-19 10:44:31,033 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 99 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:44:31,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 171 Invalid, 2177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1566 Invalid, 0 Unknown, 266 Unchecked, 3.1s Time] [2022-07-19 10:44:31,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-19 10:44:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2022-07-19 10:44:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 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) [2022-07-19 10:44:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-19 10:44:31,043 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-19 10:44:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:44:31,043 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-19 10:44:31,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 86 states have internal predecessors, (110), 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) [2022-07-19 10:44:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-19 10:44:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:44:31,044 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:44:31,044 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:44:31,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 10:44:31,255 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 [2022-07-19 10:44:31,255 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:44:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:44:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-19 10:44:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:44:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274185964] [2022-07-19 10:44:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:44:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:44:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:44:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-19 10:44:31,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:44:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274185964] [2022-07-19 10:44:31,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274185964] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:44:31,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447104211] [2022-07-19 10:44:31,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:44:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:44:31,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:44:31,498 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) [2022-07-19 10:44:31,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 10:44:31,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-19 10:44:31,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:44:31,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-19 10:44:31,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:44:31,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:44:31,746 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-19 10:44:31,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-19 10:44:31,810 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-19 10:44:31,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2022-07-19 10:44:31,904 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-19 10:44:31,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-19 10:44:32,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 10:44:32,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 37 [2022-07-19 10:44:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 30 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 10:44:32,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:10,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-07-19 10:45:10,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 92 treesize of output 86 [2022-07-19 10:45:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-19 10:45:10,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447104211] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:10,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:10,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 18] total 49 [2022-07-19 10:45:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202791552] [2022-07-19 10:45:10,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:10,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-19 10:45:10,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:10,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-19 10:45:10,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1885, Unknown=24, NotChecked=0, Total=2352 [2022-07-19 10:45:10,550 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 49 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 49 states have internal predecessors, (94), 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) [2022-07-19 10:45:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:30,587 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2022-07-19 10:45:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 10:45:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 49 states have internal predecessors, (94), 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 41 [2022-07-19 10:45:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:30,588 INFO L225 Difference]: With dead ends: 95 [2022-07-19 10:45:30,588 INFO L226 Difference]: Without dead ends: 75 [2022-07-19 10:45:30,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=1050, Invalid=4459, Unknown=41, NotChecked=0, Total=5550 [2022-07-19 10:45:30,590 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:30,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 72 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 174 Invalid, 0 Unknown, 117 Unchecked, 0.1s Time] [2022-07-19 10:45:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-19 10:45:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-07-19 10:45:30,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 69 states have internal predecessors, (80), 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) [2022-07-19 10:45:30,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-07-19 10:45:30,600 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 41 [2022-07-19 10:45:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:30,600 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-07-19 10:45:30,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 49 states have internal predecessors, (94), 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) [2022-07-19 10:45:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-07-19 10:45:30,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:45:30,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:30,601 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:30,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 10:45:30,811 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 [2022-07-19 10:45:30,811 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-19 10:45:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:30,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168208825] [2022-07-19 10:45:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:30,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 10:45:30,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:30,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168208825] [2022-07-19 10:45:30,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168208825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:30,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703166144] [2022-07-19 10:45:30,900 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:45:30,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:30,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:30,901 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) [2022-07-19 10:45:30,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 10:45:31,013 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-19 10:45:31,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:45:31,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:45:31,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 10:45:31,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-19 10:45:31,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703166144] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:31,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:31,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-19 10:45:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921881729] [2022-07-19 10:45:31,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:31,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:45:31,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:45:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:45:31,187 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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) [2022-07-19 10:45:31,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:31,363 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2022-07-19 10:45:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:45:31,363 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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 43 [2022-07-19 10:45:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:31,364 INFO L225 Difference]: With dead ends: 114 [2022-07-19 10:45:31,364 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 10:45:31,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:45:31,365 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 161 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:31,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 28 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:45:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 10:45:31,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2022-07-19 10:45:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 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) [2022-07-19 10:45:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2022-07-19 10:45:31,373 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 43 [2022-07-19 10:45:31,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:31,373 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2022-07-19 10:45:31,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 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) [2022-07-19 10:45:31,373 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-07-19 10:45:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:45:31,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:31,374 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:31,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-19 10:45:31,591 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 [2022-07-19 10:45:31,592 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-19 10:45:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:31,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828471210] [2022-07-19 10:45:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 10:45:31,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:31,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828471210] [2022-07-19 10:45:31,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828471210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:31,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048160877] [2022-07-19 10:45:31,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:45:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:31,689 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) [2022-07-19 10:45:31,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 10:45:31,801 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-19 10:45:31,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:45:31,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:45:31,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 10:45:31,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:45:31,950 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 10:45:31,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048160877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:45:31,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:45:31,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-19 10:45:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729162918] [2022-07-19 10:45:31,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:45:31,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:45:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:45:31,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:45:31,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:45:31,952 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) [2022-07-19 10:45:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:45:32,177 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-07-19 10:45:32,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 10:45:32,178 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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 46 [2022-07-19 10:45:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:45:32,178 INFO L225 Difference]: With dead ends: 66 [2022-07-19 10:45:32,178 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 10:45:32,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:45:32,179 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 86 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:45:32,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 27 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:45:32,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 10:45:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-07-19 10:45:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 53 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) [2022-07-19 10:45:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-07-19 10:45:32,186 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 46 [2022-07-19 10:45:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:45:32,187 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-07-19 10:45:32,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 20 states have internal predecessors, (65), 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) [2022-07-19 10:45:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-07-19 10:45:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:45:32,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:45:32,187 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:45:32,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-19 10:45:32,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 10:45:32,399 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:45:32,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:45:32,400 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-19 10:45:32,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:45:32,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613446028] [2022-07-19 10:45:32,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:45:32,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:45:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:34,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:45:34,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613446028] [2022-07-19 10:45:34,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613446028] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:45:34,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854448629] [2022-07-19 10:45:34,355 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:45:34,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:45:34,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:45:34,356 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:45:34,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 10:45:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:45:34,442 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-19 10:45:34,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:45:34,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:45:34,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 10:45:34,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:45:34,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:45:34,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:45:34,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:45:34,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:45:34,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-19 10:45:34,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:34,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-07-19 10:45:34,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:34,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:34,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:34,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-07-19 10:45:35,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2022-07-19 10:45:35,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2022-07-19 10:45:35,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2022-07-19 10:45:35,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:35,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:35,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2022-07-19 10:45:36,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:36,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2022-07-19 10:45:36,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:45:36,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:45:36,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 75 [2022-07-19 10:45:36,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 73 [2022-07-19 10:45:36,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 37 [2022-07-19 10:45:36,629 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:45:36,629 INFO L328 TraceCheckSpWp]: Computing backward predicates...