./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 6c24879c 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-?-6c24879 [2022-07-11 23:30:31,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:30:31,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:30:31,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:30:31,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:30:31,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:30:31,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:30:31,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:30:31,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:30:31,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:30:31,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:30:31,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:30:31,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:30:31,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:30:31,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:30:31,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:30:31,267 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:30:31,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:30:31,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:30:31,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:30:31,275 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:30:31,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:30:31,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:30:31,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:30:31,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:30:31,280 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:30:31,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:30:31,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:30:31,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:30:31,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:30:31,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:30:31,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:30:31,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:30:31,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:30:31,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:30:31,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:30:31,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:30:31,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:30:31,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:30:31,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:30:31,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:30:31,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:30:31,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:30:31,319 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:30:31,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:30:31,320 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:30:31,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:30:31,321 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:30:31,321 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:30:31,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:30:31,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:30:31,321 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:30:31,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:30:31,322 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:30:31,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:30:31,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:30:31,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:30:31,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:30:31,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:30:31,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:30:31,323 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:30:31,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:30:31,323 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:30:31,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:30:31,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:30:31,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:30:31,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:30:31,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:30:31,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:30:31,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:30:31,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:30:31,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:30:31,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:30:31,325 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:30:31,326 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:30:31,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:30:31,326 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-11 23:30:31,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:30:31,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:30:31,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:30:31,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:30:31,535 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:30:31,536 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-11 23:30:31,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d84d5dd/c84c1c99bab1479581cd400da8180f9e/FLAGab2e3dd3c [2022-07-11 23:30:31,956 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:30:31,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s3lif.c [2022-07-11 23:30:31,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d84d5dd/c84c1c99bab1479581cd400da8180f9e/FLAGab2e3dd3c [2022-07-11 23:30:32,373 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30d84d5dd/c84c1c99bab1479581cd400da8180f9e [2022-07-11 23:30:32,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:30:32,375 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:30:32,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:30:32,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:30:32,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:30:32,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd18676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32, skipping insertion in model container [2022-07-11 23:30:32,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:30:32,400 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:30:32,513 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-11 23:30:32,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:30:32,539 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:30:32,550 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-11 23:30:32,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:30:32,578 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:30:32,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32 WrapperNode [2022-07-11 23:30:32,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:30:32,579 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:30:32,579 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:30:32,579 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:30:32,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,616 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-11 23:30:32,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:30:32,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:30:32,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:30:32,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:30:32,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,633 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:30:32,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:30:32,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:30:32,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:30:32,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (1/1) ... [2022-07-11 23:30:32,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:30:32,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:32,660 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-11 23:30:32,661 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-11 23:30:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:30:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:30:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-11 23:30:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:30:32,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:30:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:30:32,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:30:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:30:32,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-11 23:30:32,741 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:30:32,742 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:30:32,915 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:30:32,919 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:30:32,919 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-11 23:30:32,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:30:32 BoogieIcfgContainer [2022-07-11 23:30:32,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:30:32,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:30:32,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:30:32,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:30:32,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:30:32" (1/3) ... [2022-07-11 23:30:32,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bed740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:30:32, skipping insertion in model container [2022-07-11 23:30:32,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:30:32" (2/3) ... [2022-07-11 23:30:32,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bed740 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:30:32, skipping insertion in model container [2022-07-11 23:30:32,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:30:32" (3/3) ... [2022-07-11 23:30:32,942 INFO L111 eAbstractionObserver]: Analyzing ICFG s3lif.c [2022-07-11 23:30:32,956 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:30:32,956 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:30:32,992 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:30:33,002 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@447d97a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@690a2b41 [2022-07-11 23:30:33,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:30:33,011 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-11 23:30:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:30:33,019 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:33,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:30:33,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:33,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-11 23:30:33,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:33,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436246726] [2022-07-11 23:30:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:33,140 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-11 23:30:33,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:33,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436246726] [2022-07-11 23:30:33,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436246726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:30:33,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:30:33,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:30:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738880068] [2022-07-11 23:30:33,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:30:33,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:30:33,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:33,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:30:33,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:30:33,171 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-11 23:30:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:33,183 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-11 23:30:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:30:33,185 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-11 23:30:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:33,189 INFO L225 Difference]: With dead ends: 40 [2022-07-11 23:30:33,189 INFO L226 Difference]: Without dead ends: 18 [2022-07-11 23:30:33,192 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-11 23:30:33,195 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-11 23:30:33,196 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-11 23:30:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-11 23:30:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-11 23:30:33,215 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-11 23:30:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-11 23:30:33,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-11 23:30:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:33,217 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-11 23:30:33,218 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-11 23:30:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-11 23:30:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:30:33,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:33,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:30:33,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:30:33,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:33,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-11 23:30:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:33,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350068583] [2022-07-11 23:30:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:33,314 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-11 23:30:33,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:33,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350068583] [2022-07-11 23:30:33,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350068583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:30:33,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:30:33,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:30:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976869098] [2022-07-11 23:30:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:30:33,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:30:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:30:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:30:33,322 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-11 23:30:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:33,377 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-11 23:30:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:30:33,378 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-11 23:30:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:33,379 INFO L225 Difference]: With dead ends: 36 [2022-07-11 23:30:33,380 INFO L226 Difference]: Without dead ends: 25 [2022-07-11 23:30:33,380 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-11 23:30:33,381 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.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:30:33,383 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.0s Time] [2022-07-11 23:30:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-11 23:30:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-11 23:30:33,388 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-11 23:30:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-11 23:30:33,389 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-11 23:30:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:33,389 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-11 23:30:33,390 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-11 23:30:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-11 23:30:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:30:33,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:33,392 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-11 23:30:33,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:30:33,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-11 23:30:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:33,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184566139] [2022-07-11 23:30:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:33,791 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-11 23:30:33,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184566139] [2022-07-11 23:30:33,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184566139] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174444806] [2022-07-11 23:30:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:33,804 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-11 23:30:33,805 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-11 23:30:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:33,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-11 23:30:33,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:33,912 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-11 23:30:33,921 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-11 23:30:33,953 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-11 23:30:34,092 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-11 23:30:34,212 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-11 23:30:34,323 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-11 23:30:34,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:34,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:30:34,520 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-11 23:30:34,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:30:34,567 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-11 23:30:34,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:30:34,572 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-11 23:30:34,581 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-11 23:30:34,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174444806] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:34,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:34,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 28 [2022-07-11 23:30:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259630012] [2022-07-11 23:30:34,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:34,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-11 23:30:34,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:34,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-11 23:30:34,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2022-07-11 23:30:34,584 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-11 23:30:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:34,957 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-07-11 23:30:34,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:30:34,957 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-11 23:30:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:34,959 INFO L225 Difference]: With dead ends: 47 [2022-07-11 23:30:34,959 INFO L226 Difference]: Without dead ends: 43 [2022-07-11 23:30:34,959 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-11 23:30:34,960 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-11 23:30:34,960 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-11 23:30:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-11 23:30:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-07-11 23:30:34,965 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-11 23:30:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-11 23:30:34,965 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-11 23:30:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:34,966 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-11 23:30:34,966 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-11 23:30:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-11 23:30:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:30:34,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:34,967 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-11 23:30:34,989 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-11 23:30:35,183 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-11 23:30:35,184 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:35,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:35,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-11 23:30:35,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:35,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518804051] [2022-07-11 23:30:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:35,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:35,296 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-11 23:30:35,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:35,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518804051] [2022-07-11 23:30:35,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518804051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:35,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916882016] [2022-07-11 23:30:35,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:35,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:35,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:35,308 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-11 23:30:35,309 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-11 23:30:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:35,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-11 23:30:35,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:35,366 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-11 23:30:35,385 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-11 23:30:35,389 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-11 23:30:35,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:35,406 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-11 23:30:35,408 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-11 23:30:35,426 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-11 23:30:35,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916882016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:35,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:35,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-11 23:30:35,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856672588] [2022-07-11 23:30:35,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:35,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:30:35,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:35,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:30:35,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:30:35,428 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-11 23:30:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:35,488 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-07-11 23:30:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:30:35,489 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-11 23:30:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:35,503 INFO L225 Difference]: With dead ends: 48 [2022-07-11 23:30:35,503 INFO L226 Difference]: Without dead ends: 37 [2022-07-11 23:30:35,504 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-11 23:30:35,504 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-11 23:30:35,504 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-11 23:30:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-11 23:30:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-11 23:30:35,508 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-11 23:30:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-11 23:30:35,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-07-11 23:30:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:35,508 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-11 23:30:35,509 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-11 23:30:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-11 23:30:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:30:35,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:35,509 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-11 23:30:35,527 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-11 23:30:35,722 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-11 23:30:35,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:35,723 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-11 23:30:35,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:35,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377774502] [2022-07-11 23:30:35,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:35,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:35,811 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-11 23:30:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377774502] [2022-07-11 23:30:35,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377774502] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:35,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540130866] [2022-07-11 23:30:35,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:30:35,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:35,814 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-11 23:30:35,815 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-11 23:30:35,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:30:35,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:30:35,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:30:35,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:35,891 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-11 23:30:35,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:35,911 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-11 23:30:35,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540130866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:35,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:35,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:30:35,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770388493] [2022-07-11 23:30:35,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:35,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:30:35,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:35,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:30:35,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:30:35,913 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-11 23:30:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:36,008 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-11 23:30:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:30:36,008 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-11 23:30:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:36,009 INFO L225 Difference]: With dead ends: 70 [2022-07-11 23:30:36,009 INFO L226 Difference]: Without dead ends: 44 [2022-07-11 23:30:36,016 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-11 23:30:36,019 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:30:36,019 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.1s Time] [2022-07-11 23:30:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-11 23:30:36,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-11 23:30:36,030 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-11 23:30:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-11 23:30:36,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-11 23:30:36,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:36,030 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-11 23:30:36,031 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-11 23:30:36,031 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-11 23:30:36,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:30:36,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:36,032 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-11 23:30:36,050 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-11 23:30:36,243 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-11 23:30:36,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-11 23:30:36,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:36,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569789907] [2022-07-11 23:30:36,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:36,290 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-11 23:30:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569789907] [2022-07-11 23:30:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569789907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635480504] [2022-07-11 23:30:36,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:30:36,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:36,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:36,293 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-11 23:30:36,294 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-11 23:30:36,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-11 23:30:36,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:30:36,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:30:36,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:36,376 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-11 23:30:36,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:36,409 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-11 23:30:36,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635480504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:36,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:36,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-11 23:30:36,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909183603] [2022-07-11 23:30:36,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:30:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:36,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:30:36,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:30:36,415 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-11 23:30:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:36,501 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-11 23:30:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:30:36,502 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-11 23:30:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:36,504 INFO L225 Difference]: With dead ends: 39 [2022-07-11 23:30:36,504 INFO L226 Difference]: Without dead ends: 31 [2022-07-11 23:30:36,505 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-11 23:30:36,507 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-11 23:30:36,507 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-11 23:30:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-11 23:30:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-11 23:30:36,513 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-11 23:30:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-11 23:30:36,515 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-11 23:30:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:36,515 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-11 23:30:36,516 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-11 23:30:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-11 23:30:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:30:36,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:36,517 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-11 23:30:36,537 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-11 23:30:36,737 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-11 23:30:36,737 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-11 23:30:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:36,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610962100] [2022-07-11 23:30:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:36,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:36,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:37,447 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-11 23:30:37,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:37,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610962100] [2022-07-11 23:30:37,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610962100] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:37,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999001249] [2022-07-11 23:30:37,447 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:30:37,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:37,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:37,460 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-11 23:30:37,462 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-11 23:30:37,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:30:37,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:30:37,502 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-11 23:30:37,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:37,514 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-11 23:30:37,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:37,545 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-11 23:30:37,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:37,577 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-11 23:30:37,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:37,733 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-11 23:30:37,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:37,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:37,856 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-11 23:30:37,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:30:37,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:37,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:37,966 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-11 23:30:38,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:38,071 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-11 23:30:38,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:38,161 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-11 23:30:38,190 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-11 23:30:38,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:38,997 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-11 23:30:38,997 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-11 23:30:39,012 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-11 23:30:39,051 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-11 23:30:39,079 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-11 23:30:39,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999001249] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:39,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:39,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2022-07-11 23:30:39,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31512775] [2022-07-11 23:30:39,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:39,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-11 23:30:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:39,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-11 23:30:39,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2023, Unknown=2, NotChecked=190, Total=2550 [2022-07-11 23:30:39,083 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-11 23:30:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:40,840 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-11 23:30:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-11 23:30:40,840 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-11 23:30:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:40,841 INFO L225 Difference]: With dead ends: 64 [2022-07-11 23:30:40,841 INFO L226 Difference]: Without dead ends: 60 [2022-07-11 23:30:40,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=544, Invalid=3002, Unknown=2, NotChecked=234, Total=3782 [2022-07-11 23:30:40,842 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-11 23:30:40,843 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-11 23:30:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-11 23:30:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2022-07-11 23:30:40,847 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-11 23:30:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-07-11 23:30:40,847 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 27 [2022-07-11 23:30:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:40,848 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-07-11 23:30:40,848 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-11 23:30:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-07-11 23:30:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:30:40,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:40,848 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-11 23:30:40,871 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-11 23:30:41,056 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-11 23:30:41,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:41,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:41,056 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-11 23:30:41,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:41,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139823944] [2022-07-11 23:30:41,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:41,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:41,160 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-11 23:30:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139823944] [2022-07-11 23:30:41,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139823944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:41,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58558541] [2022-07-11 23:30:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:41,162 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-11 23:30:41,163 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-11 23:30:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:41,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-11 23:30:41,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:41,220 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-11 23:30:41,254 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:30:41,255 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-11 23:30:41,272 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-11 23:30:41,281 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-11 23:30:41,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:41,308 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-11 23:30:41,309 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-11 23:30:41,318 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-11 23:30:41,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58558541] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:41,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:41,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-11 23:30:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626300482] [2022-07-11 23:30:41,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:41,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:30:41,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:41,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:30:41,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:30:41,319 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-11 23:30:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:41,487 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-07-11 23:30:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:30:41,487 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-11 23:30:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:41,488 INFO L225 Difference]: With dead ends: 62 [2022-07-11 23:30:41,488 INFO L226 Difference]: Without dead ends: 49 [2022-07-11 23:30:41,488 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-11 23:30:41,489 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-11 23:30:41,489 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-11 23:30:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-11 23:30:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2022-07-11 23:30:41,494 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-11 23:30:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-07-11 23:30:41,495 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 27 [2022-07-11 23:30:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:41,497 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-07-11 23:30:41,497 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-11 23:30:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-07-11 23:30:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:30:41,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:41,503 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-11 23:30:41,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-11 23:30:41,721 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-11 23:30:41,722 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:41,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-11 23:30:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:41,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234695865] [2022-07-11 23:30:41,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:41,762 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-11 23:30:41,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234695865] [2022-07-11 23:30:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234695865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061099900] [2022-07-11 23:30:41,763 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-11 23:30:41,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:41,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:41,764 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-11 23:30:41,765 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-11 23:30:41,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-11 23:30:41,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:30:41,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:30:41,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:41,868 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-11 23:30:41,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:41,896 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-11 23:30:41,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061099900] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:41,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:41,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:30:41,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892677310] [2022-07-11 23:30:41,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:41,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:30:41,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:41,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:30:41,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:30:41,898 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-11 23:30:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:41,986 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-07-11 23:30:41,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:30:41,986 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-11 23:30:41,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:41,987 INFO L225 Difference]: With dead ends: 86 [2022-07-11 23:30:41,987 INFO L226 Difference]: Without dead ends: 53 [2022-07-11 23:30:41,987 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-11 23:30:41,987 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-11 23:30:41,988 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-11 23:30:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-11 23:30:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-07-11 23:30:41,992 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-11 23:30:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-07-11 23:30:41,992 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2022-07-11 23:30:41,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:41,992 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-07-11 23:30:41,992 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-11 23:30:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-07-11 23:30:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:30:41,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:41,993 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-11 23:30:42,009 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-11 23:30:42,199 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-11 23:30:42,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:42,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2022-07-11 23:30:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:42,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213274246] [2022-07-11 23:30:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:42,261 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-11 23:30:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:42,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213274246] [2022-07-11 23:30:42,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213274246] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:42,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342455450] [2022-07-11 23:30:42,262 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-11 23:30:42,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:42,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:42,263 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-11 23:30:42,269 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-11 23:30:42,318 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-11 23:30:42,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:30:42,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:30:42,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:42,381 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-11 23:30:42,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:42,409 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-11 23:30:42,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342455450] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:42,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:42,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-11 23:30:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081942559] [2022-07-11 23:30:42,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:42,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-11 23:30:42,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:42,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-11 23:30:42,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:30:42,410 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-11 23:30:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:30:42,519 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-07-11 23:30:42,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-11 23:30:42,520 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-11 23:30:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:30:42,520 INFO L225 Difference]: With dead ends: 48 [2022-07-11 23:30:42,520 INFO L226 Difference]: Without dead ends: 38 [2022-07-11 23:30:42,520 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-11 23:30:42,521 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-11 23:30:42,521 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-11 23:30:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-11 23:30:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-11 23:30:42,524 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-11 23:30:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-11 23:30:42,525 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2022-07-11 23:30:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:30:42,525 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-11 23:30:42,525 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-11 23:30:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-11 23:30:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:30:42,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:30:42,526 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-11 23:30:42,544 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-11 23:30:42,731 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-11 23:30:42,731 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:30:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:30:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-11 23:30:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:30:42,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911993223] [2022-07-11 23:30:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:30:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:30:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:43,802 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-11 23:30:43,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:30:43,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911993223] [2022-07-11 23:30:43,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911993223] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:30:43,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749068420] [2022-07-11 23:30:43,803 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-11 23:30:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:30:43,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:30:43,804 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-11 23:30:43,805 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-11 23:30:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:30:43,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-11 23:30:43,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:30:43,874 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-11 23:30:43,876 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-11 23:30:43,897 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-11 23:30:43,924 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-11 23:30:43,966 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-11 23:30:44,128 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-11 23:30:44,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,275 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-11 23:30:44,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,413 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-11 23:30:44,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:30:44,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,532 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-11 23:30:44,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:30:44,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:30:44,639 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-11 23:30:44,747 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-11 23:30:44,838 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-11 23:30:44,866 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-11 23:30:44,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:30:47,067 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-11 23:30:47,068 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-11 23:30:47,086 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-11 23:30:47,108 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-11 23:30:47,148 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-11 23:30:47,179 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-11 23:30:47,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749068420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:30:47,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:30:47,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2022-07-11 23:30:47,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26406005] [2022-07-11 23:30:47,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:30:47,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-11 23:30:47,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:30:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-11 23:30:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=3546, Unknown=3, NotChecked=378, Total=4422 [2022-07-11 23:30:47,182 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-11 23:31:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:01,140 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2022-07-11 23:31:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-11 23:31:01,141 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-11 23:31:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:01,141 INFO L225 Difference]: With dead ends: 101 [2022-07-11 23:31:01,141 INFO L226 Difference]: Without dead ends: 83 [2022-07-11 23:31:01,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3374 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=1142, Invalid=8767, Unknown=3, NotChecked=594, Total=10506 [2022-07-11 23:31:01,144 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 87 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:31:01,144 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.5s Time] [2022-07-11 23:31:01,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-11 23:31:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2022-07-11 23:31:01,150 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-11 23:31:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-11 23:31:01,151 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-11 23:31:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:01,151 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-11 23:31:01,151 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-11 23:31:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-11 23:31:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:31:01,152 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:01,152 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-11 23:31:01,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-11 23:31:01,368 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-11 23:31:01,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-11 23:31:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:01,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039667717] [2022-07-11 23:31:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:01,512 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-11 23:31:01,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:01,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039667717] [2022-07-11 23:31:01,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039667717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:01,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527333223] [2022-07-11 23:31:01,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:01,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:01,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:01,516 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-11 23:31:01,517 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-11 23:31:01,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:01,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:01,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 23:31:01,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:01,615 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-11 23:31:01,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:01,664 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-11 23:31:01,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:01,689 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-11 23:31:01,707 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-11 23:31:01,716 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-11 23:31:01,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:01,766 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-11 23:31:01,767 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-11 23:31:01,791 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-11 23:31:01,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527333223] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:01,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:01,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-11 23:31:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595964215] [2022-07-11 23:31:01,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:01,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-11 23:31:01,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-11 23:31:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-11 23:31:01,793 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-11 23:31:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:02,121 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-11 23:31:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-11 23:31:02,121 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-11 23:31:02,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:02,122 INFO L225 Difference]: With dead ends: 76 [2022-07-11 23:31:02,122 INFO L226 Difference]: Without dead ends: 61 [2022-07-11 23:31:02,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-11 23:31:02,123 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-11 23:31:02,123 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-11 23:31:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-11 23:31:02,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-11 23:31:02,129 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-11 23:31:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-11 23:31:02,129 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-11 23:31:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:02,129 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-11 23:31:02,129 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-11 23:31:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-11 23:31:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:31:02,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:02,130 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-11 23:31:02,147 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-11 23:31:02,347 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-11 23:31:02,347 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:02,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-11 23:31:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:02,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980527332] [2022-07-11 23:31:02,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:02,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:02,400 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-11 23:31:02,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980527332] [2022-07-11 23:31:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980527332] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202949392] [2022-07-11 23:31:02,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:31:02,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:02,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:02,401 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-11 23:31:02,402 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-11 23:31:02,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:31:02,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:02,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:31:02,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:02,526 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-11 23:31:02,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:02,568 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-11 23:31:02,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202949392] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:02,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:02,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:31:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063542629] [2022-07-11 23:31:02,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:02,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:31:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:31:02,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:31:02,569 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-11 23:31:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:02,690 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-11 23:31:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:31:02,690 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-11 23:31:02,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:02,691 INFO L225 Difference]: With dead ends: 86 [2022-07-11 23:31:02,691 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:31:02,691 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-11 23:31:02,691 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-11 23:31:02,691 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-11 23:31:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:31:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-11 23:31:02,696 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-11 23:31:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-11 23:31:02,696 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-11 23:31:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:02,696 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-11 23:31:02,696 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-11 23:31:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-11 23:31:02,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:31:02,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:02,696 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-11 23:31:02,715 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-11 23:31:02,899 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-11 23:31:02,899 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-11 23:31:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:02,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150419406] [2022-07-11 23:31:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:02,973 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-11 23:31:02,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:02,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150419406] [2022-07-11 23:31:02,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150419406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:02,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283501767] [2022-07-11 23:31:02,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:31:02,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:02,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:02,975 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-11 23:31:02,975 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-11 23:31:03,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:31:03,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:03,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:31:03,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:03,130 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-11 23:31:03,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:03,163 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-11 23:31:03,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283501767] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:03,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:03,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-11 23:31:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803795682] [2022-07-11 23:31:03,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:03,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:31:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:31:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:31:03,165 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-11 23:31:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:31:03,298 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-11 23:31:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:31:03,299 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-11 23:31:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:31:03,299 INFO L225 Difference]: With dead ends: 49 [2022-07-11 23:31:03,299 INFO L226 Difference]: Without dead ends: 45 [2022-07-11 23:31:03,300 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-11 23:31:03,300 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-11 23:31:03,301 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-11 23:31:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-11 23:31:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-11 23:31:03,316 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-11 23:31:03,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-11 23:31:03,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-11 23:31:03,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:31:03,316 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-11 23:31:03,317 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-11 23:31:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-11 23:31:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:31:03,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:31:03,317 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-11 23:31:03,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-11 23:31:03,526 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-11 23:31:03,526 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:31:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:31:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-11 23:31:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:31:03,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145787067] [2022-07-11 23:31:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:31:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:31:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:31:04,700 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-11 23:31:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:31:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145787067] [2022-07-11 23:31:04,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145787067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:31:04,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986760464] [2022-07-11 23:31:04,701 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:31:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:31:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:31:04,702 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-11 23:31:04,703 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-11 23:31:04,765 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:31:04,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:31:04,767 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-11 23:31:04,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:31:04,779 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-11 23:31:04,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:04,812 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-11 23:31:04,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:04,847 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-11 23:31:04,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:04,892 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-11 23:31:04,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:04,931 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-11 23:31:05,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,121 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-11 23:31:05,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,281 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-11 23:31:05,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,451 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-11 23:31:05,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,627 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-11 23:31:05,792 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:05,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,800 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-11 23:31:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:05,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:05,924 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-11 23:31:06,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-11 23:31:06,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,073 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-11 23:31:06,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,202 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-11 23:31:06,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:31:06,304 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-11 23:31:06,347 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-11 23:31:06,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:31:13,445 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-11 23:31:13,446 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-11 23:31:18,632 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-11 23:31:18,721 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-11 23:31:18,806 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-11 23:31:18,870 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-11 23:31:18,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986760464] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:31:18,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-11 23:31:18,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 86 [2022-07-11 23:31:18,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557339017] [2022-07-11 23:31:18,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-11 23:31:18,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-11 23:31:18,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:31:18,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-11 23:31:18,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=716, Invalid=6021, Unknown=81, NotChecked=492, Total=7310 [2022-07-11 23:31:18,874 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-11 23:32:53,417 WARN L233 SmtUtils]: Spent 21.90s 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-11 23:33:24,820 WARN L233 SmtUtils]: Spent 18.21s 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-11 23:34:23,716 WARN L233 SmtUtils]: Spent 7.70s on a formula simplification. DAG size of input: 268 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-11 23:34:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:34:54,807 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2022-07-11 23:34:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-11 23:34:54,807 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-11 23:34:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:34:54,808 INFO L225 Difference]: With dead ends: 113 [2022-07-11 23:34:54,808 INFO L226 Difference]: Without dead ends: 93 [2022-07-11 23:34:54,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 127 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5194 ImplicationChecksByTransitivity, 225.4s TimeCoverageRelationStatistics Valid=1721, Invalid=13909, Unknown=132, NotChecked=750, Total=16512 [2022-07-11 23:34:54,811 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 102 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:34:54,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 171 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1547 Invalid, 0 Unknown, 265 Unchecked, 3.7s Time] [2022-07-11 23:34:54,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-11 23:34:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2022-07-11 23:34:54,827 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-11 23:34:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-11 23:34:54,828 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-11 23:34:54,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:34:54,828 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-11 23:34:54,828 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-11 23:34:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-11 23:34:54,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-11 23:34:54,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:34:54,829 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-11 23:34:54,848 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-11 23:34:55,045 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-11 23:34:55,046 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:34:55,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:34:55,046 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-11 23:34:55,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:34:55,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610927556] [2022-07-11 23:34:55,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:34:55,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:34:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:34:55,315 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-11 23:34:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:34:55,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610927556] [2022-07-11 23:34:55,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610927556] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:34:55,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176527843] [2022-07-11 23:34:55,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:34:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:34:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:34:55,317 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-11 23:34:55,317 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-11 23:34:55,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:34:55,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:34:55,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-11 23:34:55,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:34:55,442 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-11 23:34:55,603 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-11 23:34:55,603 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-11 23:34:55,667 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:34:55,667 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-11 23:34:55,782 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-11 23:34:55,782 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 40 treesize of output 47 [2022-07-11 23:34:55,936 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-11 23:34:55,937 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-11 23:34:56,161 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-11 23:34:56,161 INFO L328 TraceCheckSpWp]: Computing backward predicates...