./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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/s5lif.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 ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-20 22:18:01,843 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 22:18:01,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 22:18:01,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 22:18:01,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 22:18:01,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 22:18:01,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 22:18:01,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 22:18:01,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 22:18:01,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 22:18:01,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 22:18:01,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 22:18:01,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 22:18:01,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 22:18:01,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 22:18:01,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 22:18:01,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 22:18:01,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 22:18:01,911 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 22:18:01,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 22:18:01,918 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 22:18:01,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 22:18:01,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 22:18:01,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 22:18:01,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 22:18:01,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 22:18:01,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 22:18:01,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 22:18:01,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 22:18:01,932 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 22:18:01,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 22:18:01,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 22:18:01,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 22:18:01,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 22:18:01,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 22:18:01,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 22:18:01,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 22:18:01,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 22:18:01,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 22:18:01,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 22:18:01,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 22:18:01,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 22:18:01,941 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-20 22:18:01,973 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 22:18:01,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 22:18:01,973 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 22:18:01,974 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 22:18:01,974 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 22:18:01,974 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 22:18:01,975 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 22:18:01,975 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 22:18:01,975 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 22:18:01,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 22:18:01,976 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 22:18:01,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 22:18:01,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 22:18:01,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 22:18:01,977 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 22:18:01,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 22:18:01,977 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 22:18:01,978 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 22:18:01,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 22:18:01,979 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 22:18:01,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 22:18:01,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 22:18:01,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 22:18:01,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 22:18:01,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:18:01,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 22:18:01,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 22:18:01,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 22:18:01,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 22:18:01,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 22:18:01,981 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 22:18:01,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 22:18:01,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 22:18:01,981 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 -> ee6d96902bdd4af72f7a2fd5e7663f1e77332d6bd0663b847529c708e308110b [2022-07-20 22:18:02,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 22:18:02,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 22:18:02,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 22:18:02,257 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 22:18:02,258 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 22:18:02,259 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5lif.c [2022-07-20 22:18:02,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd7b9128/b596a7b1cd014b27b01c77c33e459cb6/FLAG0c199d0ab [2022-07-20 22:18:02,677 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 22:18:02,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5lif.c [2022-07-20 22:18:02,688 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd7b9128/b596a7b1cd014b27b01c77c33e459cb6/FLAG0c199d0ab [2022-07-20 22:18:03,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bd7b9128/b596a7b1cd014b27b01c77c33e459cb6 [2022-07-20 22:18:03,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 22:18:03,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 22:18:03,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 22:18:03,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 22:18:03,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 22:18:03,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e29241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03, skipping insertion in model container [2022-07-20 22:18:03,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 22:18:03,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 22:18:03,229 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/s5lif.c[588,601] [2022-07-20 22:18:03,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:18:03,272 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 22:18:03,288 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/s5lif.c[588,601] [2022-07-20 22:18:03,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 22:18:03,317 INFO L208 MainTranslator]: Completed translation [2022-07-20 22:18:03,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03 WrapperNode [2022-07-20 22:18:03,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 22:18:03,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 22:18:03,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 22:18:03,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 22:18:03,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,354 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-07-20 22:18:03,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 22:18:03,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 22:18:03,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 22:18:03,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 22:18:03,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 22:18:03,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 22:18:03,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 22:18:03,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 22:18:03,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (1/1) ... [2022-07-20 22:18:03,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 22:18:03,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:03,409 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-20 22:18:03,434 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-20 22:18:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 22:18:03,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 22:18:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 22:18:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 22:18:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 22:18:03,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 22:18:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 22:18:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 22:18:03,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 22:18:03,512 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 22:18:03,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 22:18:03,625 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 22:18:03,630 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 22:18:03,631 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 22:18:03,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:18:03 BoogieIcfgContainer [2022-07-20 22:18:03,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 22:18:03,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 22:18:03,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 22:18:03,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 22:18:03,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 10:18:03" (1/3) ... [2022-07-20 22:18:03,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47aadf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:18:03, skipping insertion in model container [2022-07-20 22:18:03,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 10:18:03" (2/3) ... [2022-07-20 22:18:03,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47aadf5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 10:18:03, skipping insertion in model container [2022-07-20 22:18:03,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 10:18:03" (3/3) ... [2022-07-20 22:18:03,640 INFO L111 eAbstractionObserver]: Analyzing ICFG s5lif.c [2022-07-20 22:18:03,653 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 22:18:03,653 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-20 22:18:03,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 22:18:03,714 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@1e6eac3d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5a5d3ab2 [2022-07-20 22:18:03,727 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-20 22:18:03,731 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-20 22:18:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 22:18:03,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:03,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:18:03,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:03,742 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-07-20 22:18:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015264845] [2022-07-20 22:18:03,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:03,955 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-20 22:18:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:03,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015264845] [2022-07-20 22:18:03,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015264845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:18:03,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:18:03,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 22:18:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338042759] [2022-07-20 22:18:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:18:03,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 22:18:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 22:18:03,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 22:18:04,001 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-20 22:18:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:04,020 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-07-20 22:18:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 22:18:04,022 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-20 22:18:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:04,029 INFO L225 Difference]: With dead ends: 40 [2022-07-20 22:18:04,029 INFO L226 Difference]: Without dead ends: 18 [2022-07-20 22:18:04,034 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-20 22:18:04,041 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-20 22:18:04,042 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-20 22:18:04,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-20 22:18:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-20 22:18:04,072 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-20 22:18:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-07-20 22:18:04,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-07-20 22:18:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:04,075 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-07-20 22:18:04,076 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-20 22:18:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-07-20 22:18:04,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 22:18:04,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:04,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:18:04,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 22:18:04,078 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:04,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:04,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-07-20 22:18:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:04,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877869502] [2022-07-20 22:18:04,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:04,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:04,216 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-20 22:18:04,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:04,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877869502] [2022-07-20 22:18:04,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877869502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 22:18:04,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 22:18:04,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 22:18:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113112640] [2022-07-20 22:18:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 22:18:04,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 22:18:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:04,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 22:18:04,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 22:18:04,221 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-20 22:18:04,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:04,293 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-20 22:18:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 22:18:04,294 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-20 22:18:04,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:04,295 INFO L225 Difference]: With dead ends: 36 [2022-07-20 22:18:04,296 INFO L226 Difference]: Without dead ends: 25 [2022-07-20 22:18:04,296 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-20 22:18:04,298 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:04,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:04,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-20 22:18:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-07-20 22:18:04,308 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-20 22:18:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-20 22:18:04,309 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-07-20 22:18:04,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:04,309 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-20 22:18:04,309 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-20 22:18:04,309 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-20 22:18:04,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 22:18:04,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:04,310 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-20 22:18:04,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 22:18:04,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:04,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-07-20 22:18:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:04,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870636669] [2022-07-20 22:18:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:04,881 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-20 22:18:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:04,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870636669] [2022-07-20 22:18:04,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870636669] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:04,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391153579] [2022-07-20 22:18:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:04,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:04,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:04,891 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-20 22:18:04,919 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-20 22:18:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:04,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 22:18:04,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:05,053 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-20 22:18:05,067 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-20 22:18:05,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:18:05,274 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-20 22:18:05,405 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-20 22:18:05,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-07-20 22:18:05,534 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-20 22:18:05,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:05,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:18:05,868 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 56 treesize of output 44 [2022-07-20 22:18:05,941 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:18:05,941 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 1 [2022-07-20 22:18:05,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:18:05,948 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-20 22:18:05,951 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:18:05,953 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-20 22:18:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:18:05,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391153579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:05,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:05,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-07-20 22:18:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234589264] [2022-07-20 22:18:05,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:05,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 22:18:05,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:05,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 22:18:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-07-20 22:18:05,968 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-20 22:18:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:06,386 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-20 22:18:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 22:18:06,387 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-20 22:18:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:06,389 INFO L225 Difference]: With dead ends: 46 [2022-07-20 22:18:06,389 INFO L226 Difference]: Without dead ends: 42 [2022-07-20 22:18:06,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 22:18:06,391 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:06,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 182 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-07-20 22:18:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-20 22:18:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-07-20 22:18:06,402 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-20 22:18:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-07-20 22:18:06,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-07-20 22:18:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:06,404 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-07-20 22:18:06,404 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-20 22:18:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-07-20 22:18:06,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 22:18:06,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:06,406 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-20 22:18:06,435 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-20 22:18:06,618 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-20 22:18:06,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-07-20 22:18:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:06,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760029926] [2022-07-20 22:18:06,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:06,744 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-20 22:18:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:06,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760029926] [2022-07-20 22:18:06,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760029926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:06,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493191574] [2022-07-20 22:18:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:06,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:06,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:06,752 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-20 22:18:06,754 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-20 22:18:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:06,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 22:18:06,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:06,822 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-20 22:18:06,844 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-20 22:18:06,850 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-20 22:18:06,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:06,872 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-20 22:18:06,875 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-20 22:18:06,883 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-20 22:18:06,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493191574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:06,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:06,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-20 22:18:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536449984] [2022-07-20 22:18:06,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:06,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 22:18:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:06,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 22:18:06,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-20 22:18:06,886 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-20 22:18:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:06,952 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-07-20 22:18:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 22:18:06,952 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-20 22:18:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:06,953 INFO L225 Difference]: With dead ends: 48 [2022-07-20 22:18:06,953 INFO L226 Difference]: Without dead ends: 37 [2022-07-20 22:18:06,954 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-20 22:18:06,955 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:06,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 22:18:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-20 22:18:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-20 22:18:06,961 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-20 22:18:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-20 22:18:06,962 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-07-20 22:18:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:06,962 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-20 22:18:06,962 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-20 22:18:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-20 22:18:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 22:18:06,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:06,964 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-20 22:18:06,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 22:18:07,183 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-20 22:18:07,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-07-20 22:18:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028812706] [2022-07-20 22:18:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:07,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:07,240 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-20 22:18:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:07,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028812706] [2022-07-20 22:18:07,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028812706] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:07,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379903184] [2022-07-20 22:18:07,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:18:07,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:07,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:07,245 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-20 22:18:07,247 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-20 22:18:07,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:18:07,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:07,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:18:07,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:07,353 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-20 22:18:07,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:07,379 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-20 22:18:07,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379903184] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:07,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:07,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 22:18:07,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730375729] [2022-07-20 22:18:07,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:07,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:18:07,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:07,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:18:07,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:18:07,383 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-20 22:18:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:07,483 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-07-20 22:18:07,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:18:07,484 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-20 22:18:07,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:07,485 INFO L225 Difference]: With dead ends: 70 [2022-07-20 22:18:07,485 INFO L226 Difference]: Without dead ends: 44 [2022-07-20 22:18:07,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-20 22:18:07,486 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:07,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-20 22:18:07,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-07-20 22:18:07,505 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-20 22:18:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-20 22:18:07,505 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-07-20 22:18:07,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:07,506 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-20 22:18:07,506 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-20 22:18:07,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-20 22:18:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 22:18:07,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:07,507 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-20 22:18:07,535 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-20 22:18:07,732 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-20 22:18:07,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:07,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-07-20 22:18:07,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:07,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860602796] [2022-07-20 22:18:07,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:07,814 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-20 22:18:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:07,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860602796] [2022-07-20 22:18:07,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860602796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:07,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074659665] [2022-07-20 22:18:07,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:18:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:07,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:07,817 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-20 22:18:07,828 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-20 22:18:07,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 22:18:07,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:07,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 22:18:07,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:07,926 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-20 22:18:07,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:07,969 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-20 22:18:07,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074659665] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:07,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:07,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 22:18:07,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684679533] [2022-07-20 22:18:07,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:07,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 22:18:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:07,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 22:18:07,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-20 22:18:07,973 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-20 22:18:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:08,065 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-07-20 22:18:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 22:18:08,065 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-20 22:18:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:08,066 INFO L225 Difference]: With dead ends: 39 [2022-07-20 22:18:08,066 INFO L226 Difference]: Without dead ends: 31 [2022-07-20 22:18:08,067 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-20 22:18:08,067 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:08,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:08,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-20 22:18:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-07-20 22:18:08,072 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-20 22:18:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-20 22:18:08,072 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-07-20 22:18:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:08,073 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-20 22:18:08,073 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-20 22:18:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-20 22:18:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 22:18:08,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:08,074 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-20 22:18:08,102 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-20 22:18:08,287 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-20 22:18:08,288 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-07-20 22:18:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:08,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570385419] [2022-07-20 22:18:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:09,027 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-20 22:18:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:09,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570385419] [2022-07-20 22:18:09,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570385419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:09,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041506005] [2022-07-20 22:18:09,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:18:09,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:09,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:09,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:18:09,033 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-20 22:18:09,086 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:18:09,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:09,088 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 22:18:09,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:09,106 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-20 22:18:09,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,143 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-20 22:18:09,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,184 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-20 22:18:09,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,399 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-20 22:18:09,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,560 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-20 22:18:09,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:18:09,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,702 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 51 treesize of output 41 [2022-07-20 22:18:09,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,821 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-20 22:18:09,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:09,916 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 58 treesize of output 34 [2022-07-20 22:18:09,958 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-20 22:18:09,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:10,949 INFO L356 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-07-20 22:18:10,949 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 260 treesize of output 120 [2022-07-20 22:18:11,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (select v_arrayElimArr_4 .cse0) (- 5)) 1)) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ 6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse5))))) (.cse1 (* 6 ~N~0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-20 22:18:11,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (select v_arrayElimArr_4 .cse0) (- 5)) 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 6)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ 6 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse5))))) (.cse1 (* 6 ~N~0))) (and (<= .cse1 .cse2) (<= .cse2 .cse1)))))) is different from false [2022-07-20 22:18:11,289 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-20 22:18:11,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041506005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:11,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:11,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 50 [2022-07-20 22:18:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771768914] [2022-07-20 22:18:11,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:11,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 22:18:11,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:11,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 22:18:11,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1949, Unknown=2, NotChecked=186, Total=2450 [2022-07-20 22:18:11,293 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-20 22:18:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:14,933 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-07-20 22:18:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-20 22:18:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-20 22:18:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:14,934 INFO L225 Difference]: With dead ends: 85 [2022-07-20 22:18:14,935 INFO L226 Difference]: Without dead ends: 69 [2022-07-20 22:18:14,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=867, Invalid=4839, Unknown=2, NotChecked=298, Total=6006 [2022-07-20 22:18:14,937 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:14,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 113 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 605 Invalid, 0 Unknown, 124 Unchecked, 0.7s Time] [2022-07-20 22:18:14,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-20 22:18:14,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2022-07-20 22:18:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 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-20 22:18:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-20 22:18:14,946 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 27 [2022-07-20 22:18:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:14,947 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-20 22:18:14,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 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-20 22:18:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-20 22:18:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 22:18:14,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:14,948 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-20 22:18:14,973 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-20 22:18:15,171 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-20 22:18:15,172 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:15,172 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-07-20 22:18:15,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:15,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341044836] [2022-07-20 22:18:15,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:15,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:15,296 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-20 22:18:15,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:15,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341044836] [2022-07-20 22:18:15,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341044836] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:15,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091200910] [2022-07-20 22:18:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:15,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:15,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:15,298 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-20 22:18:15,317 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-20 22:18:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:15,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 22:18:15,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:15,379 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-20 22:18:15,410 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-20 22:18:15,411 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-20 22:18:15,432 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-20 22:18:15,442 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-20 22:18:15,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:15,471 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-20 22:18:15,474 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-20 22:18:15,484 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-20 22:18:15,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091200910] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:15,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:15,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-20 22:18:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407608102] [2022-07-20 22:18:15,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:15,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 22:18:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:15,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 22:18:15,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-20 22:18:15,487 INFO L87 Difference]: Start difference. First operand 45 states and 53 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-20 22:18:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:15,687 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2022-07-20 22:18:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 22:18:15,687 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-20 22:18:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:15,688 INFO L225 Difference]: With dead ends: 62 [2022-07-20 22:18:15,688 INFO L226 Difference]: Without dead ends: 49 [2022-07-20 22:18:15,689 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-20 22:18:15,690 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:15,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-20 22:18:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-20 22:18:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:18:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-20 22:18:15,698 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 27 [2022-07-20 22:18:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:15,699 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-20 22:18:15,699 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-20 22:18:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-20 22:18:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 22:18:15,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:15,700 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-20 22:18:15,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 22:18:15,915 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-20 22:18:15,916 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-07-20 22:18:15,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:15,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487420645] [2022-07-20 22:18:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:15,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:15,971 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-20 22:18:15,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:15,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487420645] [2022-07-20 22:18:15,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487420645] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:15,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753792673] [2022-07-20 22:18:15,972 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:18:15,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:15,973 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-20 22:18:15,984 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-20 22:18:16,068 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-20 22:18:16,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:16,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:18:16,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:16,123 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-20 22:18:16,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:16,160 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-20 22:18:16,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753792673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:16,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:16,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:18:16,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284236488] [2022-07-20 22:18:16,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:16,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:18:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:16,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:18:16,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:18:16,162 INFO L87 Difference]: Start difference. First operand 45 states and 51 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-20 22:18:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:16,298 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2022-07-20 22:18:16,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 22:18:16,298 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-20 22:18:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:16,299 INFO L225 Difference]: With dead ends: 72 [2022-07-20 22:18:16,299 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 22:18:16,300 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-20 22:18:16,300 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:16,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 31 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:16,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 22:18:16,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-07-20 22:18:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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-20 22:18:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-07-20 22:18:16,307 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-07-20 22:18:16,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:16,307 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-07-20 22:18:16,308 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-20 22:18:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-07-20 22:18:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 22:18:16,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:16,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:18:16,338 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-20 22:18:16,523 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-20 22:18:16,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:16,524 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-07-20 22:18:16,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:16,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074054882] [2022-07-20 22:18:16,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:16,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 22:18:16,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:16,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074054882] [2022-07-20 22:18:16,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074054882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:16,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519287626] [2022-07-20 22:18:16,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:18:16,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:16,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:16,612 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-20 22:18:16,614 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-20 22:18:16,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-07-20 22:18:16,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:16,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 22:18:16,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:18:16,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:18:16,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519287626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:16,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:16,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-20 22:18:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547420909] [2022-07-20 22:18:16,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:16,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 22:18:16,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:16,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 22:18:16,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-20 22:18:16,765 INFO L87 Difference]: Start difference. First operand 33 states and 36 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-20 22:18:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:16,884 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-07-20 22:18:16,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 22:18:16,885 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 32 [2022-07-20 22:18:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:16,885 INFO L225 Difference]: With dead ends: 42 [2022-07-20 22:18:16,885 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 22:18:16,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 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-20 22:18:16,886 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 51 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:16,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 33 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 22:18:16,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-20 22:18:16,893 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-20 22:18:16,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-07-20 22:18:16,894 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-07-20 22:18:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:16,894 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-07-20 22:18:16,895 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-20 22:18:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-07-20 22:18:16,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:18:16,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:16,896 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-20 22:18:16,914 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-20 22:18:17,099 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-20 22:18:17,100 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-07-20 22:18:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:17,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742670676] [2022-07-20 22:18:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:18,304 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-20 22:18:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:18,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742670676] [2022-07-20 22:18:18,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742670676] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:18,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857042667] [2022-07-20 22:18:18,304 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:18:18,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:18,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:18,308 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-20 22:18:18,309 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-20 22:18:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:18,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-20 22:18:18,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:18,388 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-20 22:18:18,392 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-20 22:18:18,405 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-20 22:18:18,443 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-20 22:18:18,481 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-20 22:18:18,641 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-20 22:18:18,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:18,802 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 51 treesize of output 37 [2022-07-20 22:18:18,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:18,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:18,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:18,991 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 54 treesize of output 47 [2022-07-20 22:18:19,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:19,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:18:19,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:19,138 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 60 treesize of output 53 [2022-07-20 22:18:19,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:19,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:19,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:19,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:18:19,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:19,243 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 66 treesize of output 53 [2022-07-20 22:18:19,346 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 47 [2022-07-20 22:18:19,442 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 63 treesize of output 35 [2022-07-20 22:18:19,474 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-20 22:18:19,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:21,703 INFO L356 Elim1Store]: treesize reduction 106, result has 21.5 percent of original size [2022-07-20 22:18:21,704 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-20 22:18:21,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (= (* 6 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ 6 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4)))))) (not (= 6 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (+ (select v_arrayElimArr_5 .cse5) (- 5)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-20 22:18:21,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ 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_5 .cse0) 6)) (= (* 6 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ 6 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4)))))) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= 6 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (= (+ (select v_arrayElimArr_5 .cse5) (- 5)) 1))))) is different from false [2022-07-20 22:18:21,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (~N~0 Int)) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (select v_arrayElimArr_5 .cse0) 6)) (= (* 6 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ 6 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 6 .cse1 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) .cse4)))))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 6 (select v_arrayElimArr_5 |c_ULTIMATE.start_main_~a~0#1.offset|))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (+ (select v_arrayElimArr_5 .cse5) (- 5)) 1))))) is different from false [2022-07-20 22:18:21,841 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-20 22:18:21,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857042667] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:21,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:21,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 66 [2022-07-20 22:18:21,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446838194] [2022-07-20 22:18:21,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:21,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-20 22:18:21,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:21,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-20 22:18:21,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=488, Invalid=3427, Unknown=3, NotChecked=372, Total=4290 [2022-07-20 22:18:21,845 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 66 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 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-20 22:18:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:34,743 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-07-20 22:18:34,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-20 22:18:34,744 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 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-20 22:18:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:34,745 INFO L225 Difference]: With dead ends: 100 [2022-07-20 22:18:34,745 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 22:18:34,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3347 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=1212, Invalid=8499, Unknown=3, NotChecked=588, Total=10302 [2022-07-20 22:18:34,749 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:34,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 134 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1074 Invalid, 0 Unknown, 202 Unchecked, 1.2s Time] [2022-07-20 22:18:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 22:18:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2022-07-20 22:18:34,760 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-20 22:18:34,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2022-07-20 22:18:34,760 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 34 [2022-07-20 22:18:34,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:34,761 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2022-07-20 22:18:34,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 66 states have internal predecessors, (89), 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-20 22:18:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2022-07-20 22:18:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 22:18:34,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:34,762 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-20 22:18:34,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 22:18:34,962 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-20 22:18:34,963 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:34,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:34,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-07-20 22:18:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:34,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920769091] [2022-07-20 22:18:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:34,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:18:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:35,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920769091] [2022-07-20 22:18:35,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920769091] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:35,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518463731] [2022-07-20 22:18:35,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:18:35,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:35,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:35,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:18:35,157 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-20 22:18:35,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:18:35,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:35,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 22:18:35,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:35,262 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-20 22:18:35,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:35,301 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-20 22:18:35,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:35,327 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-20 22:18:35,350 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-20 22:18:35,360 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-20 22:18:35,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:35,422 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-20 22:18:35,424 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-20 22:18:35,452 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-20 22:18:35,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518463731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:35,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:35,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-07-20 22:18:35,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871315075] [2022-07-20 22:18:35,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:35,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 22:18:35,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:35,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 22:18:35,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-07-20 22:18:35,454 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-20 22:18:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:35,877 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-07-20 22:18:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 22:18:35,878 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-20 22:18:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:35,879 INFO L225 Difference]: With dead ends: 76 [2022-07-20 22:18:35,879 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 22:18:35,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 22:18:35,880 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:35,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 80 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:18:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 22:18:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-07-20 22:18:35,889 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-20 22:18:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-20 22:18:35,890 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-07-20 22:18:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:35,890 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-20 22:18:35,890 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-20 22:18:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-20 22:18:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 22:18:35,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:35,891 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-20 22:18:35,910 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-20 22:18:36,099 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-20 22:18:36,099 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-07-20 22:18:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:36,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378458509] [2022-07-20 22:18:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:36,177 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-20 22:18:36,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:36,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378458509] [2022-07-20 22:18:36,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378458509] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:36,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940092088] [2022-07-20 22:18:36,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 22:18:36,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:36,180 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-20 22:18:36,207 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-20 22:18:36,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 22:18:36,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:36,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:18:36,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:36,339 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-20 22:18:36,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:36,386 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-20 22:18:36,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940092088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:36,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:36,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 22:18:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519044458] [2022-07-20 22:18:36,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:36,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:18:36,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:36,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:18:36,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:18:36,394 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-20 22:18:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:36,517 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-20 22:18:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 22:18:36,517 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-20 22:18:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:36,518 INFO L225 Difference]: With dead ends: 86 [2022-07-20 22:18:36,518 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 22:18:36,519 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-20 22:18:36,519 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:36,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 30 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 22:18:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2022-07-20 22:18:36,527 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-20 22:18:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-07-20 22:18:36,527 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 36 [2022-07-20 22:18:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:36,528 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-07-20 22:18:36,528 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-20 22:18:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-07-20 22:18:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 22:18:36,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:36,529 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-20 22:18:36,546 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-20 22:18:36,731 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-20 22:18:36,731 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 975408915, now seen corresponding path program 9 times [2022-07-20 22:18:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:36,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595597000] [2022-07-20 22:18:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:36,821 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-20 22:18:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:36,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595597000] [2022-07-20 22:18:36,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595597000] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:36,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264702250] [2022-07-20 22:18:36,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:18:36,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:36,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:36,825 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-20 22:18:36,826 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-20 22:18:36,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-20 22:18:36,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:36,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 22:18:36,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:37,017 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-20 22:18:37,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:37,059 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-20 22:18:37,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264702250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:37,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:37,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-20 22:18:37,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442203472] [2022-07-20 22:18:37,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:37,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 22:18:37,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:37,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 22:18:37,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-20 22:18:37,061 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-20 22:18:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:18:37,221 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-07-20 22:18:37,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:18:37,221 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-20 22:18:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:18:37,222 INFO L225 Difference]: With dead ends: 49 [2022-07-20 22:18:37,222 INFO L226 Difference]: Without dead ends: 45 [2022-07-20 22:18:37,223 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-20 22:18:37,223 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:18:37,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 30 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:18:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-20 22:18:37,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-20 22:18:37,230 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-20 22:18:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-20 22:18:37,230 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 39 [2022-07-20 22:18:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:18:37,231 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-20 22:18:37,231 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-20 22:18:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-20 22:18:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 22:18:37,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:18:37,231 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-20 22:18:37,250 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-20 22:18:37,435 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-20 22:18:37,435 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:18:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:18:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-07-20 22:18:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:18:37,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467568612] [2022-07-20 22:18:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:18:37,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:18:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:18:38,852 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-20 22:18:38,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:18:38,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467568612] [2022-07-20 22:18:38,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467568612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:18:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659144386] [2022-07-20 22:18:38,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 22:18:38,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:18:38,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:18:38,856 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-20 22:18:38,883 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-20 22:18:38,936 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 22:18:38,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:18:38,938 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-20 22:18:38,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:18:38,950 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-20 22:18:38,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:38,984 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-20 22:18:39,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,021 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-20 22:18:39,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,070 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-20 22:18:39,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:18:39,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,314 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-20 22:18:39,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,453 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 51 treesize of output 37 [2022-07-20 22:18:39,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-07-20 22:18:39,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,813 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-20 22:18:39,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:18:39,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:39,969 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 67 treesize of output 63 [2022-07-20 22:18:40,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:18:40,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,114 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 85 treesize of output 70 [2022-07-20 22:18:40,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:18:40,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,247 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 83 treesize of output 73 [2022-07-20 22:18:40,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,390 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 63 treesize of output 55 [2022-07-20 22:18:40,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:18:40,533 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-20 22:18:40,591 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-20 22:18:40,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:18:48,087 INFO L356 Elim1Store]: treesize reduction 233, result has 14.3 percent of original size [2022-07-20 22:18:48,087 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 2288 treesize of output 520 [2022-07-20 22:18:48,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) (select v_arrayElimArr_6 .cse0)) 1)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (select v_arrayElimArr_6 .cse2) 6)) (not (= (+ .cse3 (- 5)) 1)) (let ((.cse5 (* 6 ~N~0)) (.cse4 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse6 .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (and (<= .cse4 .cse5) (<= .cse5 .cse4))) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-20 22:18:48,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) (select v_arrayElimArr_6 .cse0)) 1)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (not (= (select v_arrayElimArr_6 .cse2) 6)) (not (= (+ .cse3 (- 5)) 1)) (let ((.cse5 (* 6 ~N~0)) (.cse4 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse6 .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (and (<= .cse4 .cse5) (<= .cse5 .cse4)))))) is different from false [2022-07-20 22:18:49,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) (select v_arrayElimArr_6 .cse0)) 1)) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (select v_arrayElimArr_6 .cse2) 6)) (not (= (+ .cse3 (- 5)) 1)) (let ((.cse5 (* 6 ~N~0)) (.cse4 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse6 .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (and (<= .cse4 .cse5) (<= .cse5 .cse4)))))) is different from false [2022-07-20 22:18:49,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (~N~0 Int)) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse3 (select v_arrayElimArr_6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 5) (select v_arrayElimArr_6 .cse0)) 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= (+ (select v_arrayElimArr_6 .cse1) (- 5)) 1)) (not (= (select v_arrayElimArr_6 .cse2) 6)) (not (= (+ .cse3 (- 5)) 1)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (let ((.cse5 (* 6 ~N~0)) (.cse4 (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_6))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (let ((.cse6 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse3 .cse6 .cse7 .cse8 (select (select (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse6 .cse7 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))))))))) (and (<= .cse4 .cse5) (<= .cse5 .cse4)))))) is different from false [2022-07-20 22:18:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-07-20 22:18:49,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659144386] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:18:49,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:18:49,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 86 [2022-07-20 22:18:49,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117154371] [2022-07-20 22:18:49,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:18:49,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-20 22:18:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:18:49,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-20 22:18:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=715, Invalid=5939, Unknown=4, NotChecked=652, Total=7310 [2022-07-20 22:18:49,916 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-20 22:20:07,423 WARN L233 SmtUtils]: Spent 9.29s on a formula simplification. DAG size of input: 235 DAG size of output: 177 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 22:20:09,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:09,243 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2022-07-20 22:20:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-07-20 22:20:09,243 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-20 22:20:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:09,244 INFO L225 Difference]: With dead ends: 114 [2022-07-20 22:20:09,244 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 22:20:09,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 125 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5047 ImplicationChecksByTransitivity, 85.2s TimeCoverageRelationStatistics Valid=1501, Invalid=13517, Unknown=4, NotChecked=980, Total=16002 [2022-07-20 22:20:09,248 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 118 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:09,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 153 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1490 Invalid, 0 Unknown, 319 Unchecked, 2.6s Time] [2022-07-20 22:20:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 22:20:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 65. [2022-07-20 22:20:09,273 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-20 22:20:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-20 22:20:09,274 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 41 [2022-07-20 22:20:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:09,275 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-20 22:20:09,275 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-20 22:20:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-20 22:20:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 22:20:09,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:09,277 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-20 22:20:09,296 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-20 22:20:09,485 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-20 22:20:09,486 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:09,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:09,486 INFO L85 PathProgramCache]: Analyzing trace with hash 97262195, now seen corresponding path program 3 times [2022-07-20 22:20:09,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:09,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728850624] [2022-07-20 22:20:09,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:09,681 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-20 22:20:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:09,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728850624] [2022-07-20 22:20:09,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728850624] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:09,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535800159] [2022-07-20 22:20:09,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 22:20:09,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:09,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:09,683 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-20 22:20:09,684 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-20 22:20:09,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-20 22:20:09,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:20:09,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 22:20:09,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:09,809 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-20 22:20:09,906 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-20 22:20:09,906 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-20 22:20:09,967 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-20 22:20:09,967 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-20 22:20:10,052 INFO L356 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2022-07-20 22:20:10,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-07-20 22:20:10,168 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 22:20:10,168 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 32 treesize of output 32 [2022-07-20 22:20:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 21 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 22:20:10,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:32,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2022-07-20 22:20:32,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 86 [2022-07-20 22:20:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 23 proven. 20 refuted. 2 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:20:32,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535800159] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:20:32,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:20:32,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21, 17] total 48 [2022-07-20 22:20:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404091160] [2022-07-20 22:20:32,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:20:32,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-20 22:20:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:20:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-20 22:20:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1815, Unknown=17, NotChecked=0, Total=2256 [2022-07-20 22:20:32,533 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:38,491 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-07-20 22:20:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 22:20:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 22:20:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:38,491 INFO L225 Difference]: With dead ends: 96 [2022-07-20 22:20:38,491 INFO L226 Difference]: Without dead ends: 76 [2022-07-20 22:20:38,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1981 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=934, Invalid=4448, Unknown=20, NotChecked=0, Total=5402 [2022-07-20 22:20:38,493 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:38,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 61 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 298 Invalid, 0 Unknown, 164 Unchecked, 0.2s Time] [2022-07-20 22:20:38,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-20 22:20:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-07-20 22:20:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 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-20 22:20:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-20 22:20:38,509 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 41 [2022-07-20 22:20:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:38,509 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-20 22:20:38,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 48 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-20 22:20:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 22:20:38,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:38,510 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:20:38,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-20 22:20:38,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:38,718 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:38,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:38,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1027067351, now seen corresponding path program 11 times [2022-07-20 22:20:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:38,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468645404] [2022-07-20 22:20:38,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 22:20:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:38,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468645404] [2022-07-20 22:20:38,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468645404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:38,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553380528] [2022-07-20 22:20:38,833 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 22:20:38,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:38,836 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:20:38,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 22:20:39,048 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 22:20:39,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:20:39,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 22:20:39,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 22:20:39,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 22:20:39,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553380528] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:20:39,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:20:39,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-20 22:20:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626833307] [2022-07-20 22:20:39,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:20:39,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 22:20:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:20:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 22:20:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-20 22:20:39,203 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:39,382 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2022-07-20 22:20:39,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 22:20:39,382 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-07-20 22:20:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:39,383 INFO L225 Difference]: With dead ends: 109 [2022-07-20 22:20:39,383 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 22:20:39,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-20 22:20:39,384 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 143 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:39,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 32 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 22:20:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 22:20:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-07-20 22:20:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-07-20 22:20:39,396 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 43 [2022-07-20 22:20:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:39,396 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-07-20 22:20:39,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.5) internal successors, (50), 20 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 22:20:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-07-20 22:20:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 22:20:39,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:39,397 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:20:39,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 22:20:39,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 22:20:39,599 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:39,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1824213007, now seen corresponding path program 12 times [2022-07-20 22:20:39,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:39,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051526009] [2022-07-20 22:20:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:39,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 32 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-20 22:20:39,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:39,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051526009] [2022-07-20 22:20:39,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051526009] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:39,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301407034] [2022-07-20 22:20:39,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 22:20:39,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:39,708 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:20:39,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 22:20:39,826 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-20 22:20:39,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 22:20:39,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 22:20:39,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 22:20:39,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:20:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-20 22:20:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301407034] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:20:39,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:20:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 21 [2022-07-20 22:20:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321086745] [2022-07-20 22:20:39,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:20:39,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 22:20:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:20:39,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 22:20:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-07-20 22:20:39,975 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 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-20 22:20:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 22:20:40,222 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-07-20 22:20:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 22:20:40,223 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-20 22:20:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 22:20:40,223 INFO L225 Difference]: With dead ends: 61 [2022-07-20 22:20:40,223 INFO L226 Difference]: Without dead ends: 57 [2022-07-20 22:20:40,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2022-07-20 22:20:40,224 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 22:20:40,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 38 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 22:20:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-20 22:20:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-07-20 22:20:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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-20 22:20:40,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-20 22:20:40,233 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2022-07-20 22:20:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 22:20:40,234 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-20 22:20:40,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 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-20 22:20:40,234 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-20 22:20:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 22:20:40,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 22:20:40,234 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 22:20:40,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 22:20:40,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 22:20:40,435 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-20 22:20:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 22:20:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 775276721, now seen corresponding path program 13 times [2022-07-20 22:20:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 22:20:40,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175064791] [2022-07-20 22:20:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 22:20:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 22:20:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:20:42,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 22:20:42,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175064791] [2022-07-20 22:20:42,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175064791] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 22:20:42,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657475081] [2022-07-20 22:20:42,284 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 22:20:42,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 22:20:42,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 22:20:42,288 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 22:20:42,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 22:20:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 22:20:42,374 WARN L261 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-20 22:20:42,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 22:20:42,383 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-20 22:20:42,387 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-20 22:20:42,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 22:20:42,419 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-20 22:20:42,447 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-20 22:20:42,468 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-20 22:20:42,492 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-20 22:20:42,726 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-20 22:20:42,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:42,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-07-20 22:20:43,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,137 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-20 22:20:43,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,367 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 82 treesize of output 74 [2022-07-20 22:20:43,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2022-07-20 22:20:43,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:43,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:43,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2022-07-20 22:20:44,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:44,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 78 [2022-07-20 22:20:44,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:44,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 89 [2022-07-20 22:20:44,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 22:20:44,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 22:20:44,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2022-07-20 22:20:44,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 67 [2022-07-20 22:20:44,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 39 [2022-07-20 22:20:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 22:20:44,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 22:21:08,208 INFO L356 Elim1Store]: treesize reduction 420, result has 10.4 percent of original size [2022-07-20 22:21:08,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 5756 treesize of output 1030 [2022-07-20 22:21:08,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= 6 (select v_arrayElimArr_7 .cse0))) (not (= (select v_arrayElimArr_7 .cse1) 6)) (not (= (+ .cse2 (- 5)) 1)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8 .cse9 .cse10)))))))) (.cse3 (* 6 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (not (= 6 (select v_arrayElimArr_7 .cse11))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (= (+ (- 5) (select v_arrayElimArr_7 .cse12)) 1)) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0))))) is different from false [2022-07-20 22:21:09,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= 6 (select v_arrayElimArr_7 .cse0))) (not (= (select v_arrayElimArr_7 .cse1) 6)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= (+ .cse2 (- 5)) 1)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8 .cse9 .cse10)))))))) (.cse3 (* 6 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (not (= 6 (select v_arrayElimArr_7 .cse11))) (not (= (+ (- 5) (select v_arrayElimArr_7 .cse12)) 1))))) is different from false [2022-07-20 22:21:10,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= 6 (select v_arrayElimArr_7 .cse0))) (not (= (select v_arrayElimArr_7 .cse1) 6)) (not (= (+ .cse2 (- 5)) 1)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8 .cse9 .cse10)))))))) (.cse3 (* 6 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 6 (select v_arrayElimArr_7 .cse11))) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= (+ (- 5) (select v_arrayElimArr_7 .cse12)) 1))))) is different from false [2022-07-20 22:21:10,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= 6 (select v_arrayElimArr_7 .cse0))) (not (= (select v_arrayElimArr_7 .cse1) 6)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= (+ .cse2 (- 5)) 1)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8 .cse9 .cse10)))))))) (.cse3 (* 6 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (not (= 6 (select v_arrayElimArr_7 .cse11))) (not (= (+ (- 5) (select v_arrayElimArr_7 .cse12)) 1)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))) is different from false [2022-07-20 22:21:11,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse1 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse12 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= 6 (select v_arrayElimArr_7 .cse0))) (not (= (select v_arrayElimArr_7 .cse1) 6)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0)) (not (= (+ .cse2 (- 5)) 1)) (let ((.cse4 (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse8 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse12))) (let ((.cse9 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse2 .cse8 .cse9 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse2 .cse8 .cse9 .cse10)))))))) (.cse3 (* 6 ~N~0))) (and (<= .cse3 .cse4) (<= .cse4 .cse3))) (not (= 6 (select v_arrayElimArr_7 .cse11))) (not (= (+ (- 5) (select v_arrayElimArr_7 .cse12)) 1)) (< (+ 5 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-07-20 22:21:12,325 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:21:12,325 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 834 treesize of output 1 [2022-07-20 22:21:12,334 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 22:21:12,334 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 834 treesize of output 1 [2022-07-20 22:21:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2022-07-20 22:21:12,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657475081] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 22:21:12,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 22:21:12,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36, 36] total 99 [2022-07-20 22:21:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855949428] [2022-07-20 22:21:12,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 22:21:12,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-20 22:21:12,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 22:21:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-20 22:21:12,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=931, Invalid=7826, Unknown=5, NotChecked=940, Total=9702 [2022-07-20 22:21:12,338 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 99 states, 99 states have (on average 1.2323232323232323) internal successors, (122), 99 states have internal predecessors, (122), 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)