./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s1lif.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 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/s1lif.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 cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 10:08:56,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 10:08:56,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 10:08:56,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 10:08:56,032 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 10:08:56,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 10:08:56,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 10:08:56,036 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 10:08:56,038 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 10:08:56,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 10:08:56,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 10:08:56,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 10:08:56,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 10:08:56,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 10:08:56,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 10:08:56,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 10:08:56,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 10:08:56,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 10:08:56,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 10:08:56,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 10:08:56,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 10:08:56,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 10:08:56,051 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 10:08:56,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 10:08:56,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 10:08:56,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 10:08:56,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 10:08:56,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 10:08:56,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 10:08:56,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 10:08:56,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 10:08:56,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 10:08:56,060 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 10:08:56,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 10:08:56,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 10:08:56,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 10:08:56,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 10:08:56,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 10:08:56,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 10:08:56,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 10:08:56,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 10:08:56,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 10:08:56,084 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 10:08:56,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 10:08:56,085 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 10:08:56,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 10:08:56,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 10:08:56,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 10:08:56,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 10:08:56,087 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 10:08:56,088 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 10:08:56,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 10:08:56,088 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 10:08:56,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 10:08:56,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 10:08:56,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 10:08:56,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 10:08:56,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 10:08:56,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 10:08:56,090 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 10:08:56,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 10:08:56,090 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 10:08:56,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 10:08:56,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 10:08:56,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 10:08:56,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 10:08:56,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:08:56,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 10:08:56,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 10:08:56,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 10:08:56,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 10:08:56,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 10:08:56,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 10:08:56,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 10:08:56,094 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 10:08:56,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 10:08:56,094 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 10:08:56,094 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdcd45f06ced2bb4437693c85186d4d1862b19794596dce357397727796a8cdf [2023-02-15 10:08:56,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 10:08:56,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 10:08:56,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 10:08:56,345 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 10:08:56,346 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 10:08:56,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s1lif.c [2023-02-15 10:08:57,528 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 10:08:57,706 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 10:08:57,707 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c [2023-02-15 10:08:57,712 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda7e9b1a/f44697b491574e359211fe7f09328e68/FLAGcd4f45346 [2023-02-15 10:08:57,725 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dda7e9b1a/f44697b491574e359211fe7f09328e68 [2023-02-15 10:08:57,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 10:08:57,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 10:08:57,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 10:08:57,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 10:08:57,733 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 10:08:57,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c3a776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57, skipping insertion in model container [2023-02-15 10:08:57,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 10:08:57,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 10:08:57,901 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c[588,601] [2023-02-15 10:08:57,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:08:57,924 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 10:08:57,933 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s1lif.c[588,601] [2023-02-15 10:08:57,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 10:08:57,951 INFO L208 MainTranslator]: Completed translation [2023-02-15 10:08:57,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57 WrapperNode [2023-02-15 10:08:57,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 10:08:57,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 10:08:57,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 10:08:57,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 10:08:57,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,964 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,981 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-02-15 10:08:57,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 10:08:57,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 10:08:57,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 10:08:57,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 10:08:57,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:57,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:58,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:58,004 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:58,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:58,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 10:08:58,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 10:08:58,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 10:08:58,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 10:08:58,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (1/1) ... [2023-02-15 10:08:58,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 10:08:58,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:08:58,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 10:08:58,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 10:08:58,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 10:08:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 10:08:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 10:08:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 10:08:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 10:08:58,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 10:08:58,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 10:08:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 10:08:58,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 10:08:58,155 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 10:08:58,157 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 10:08:58,352 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 10:08:58,357 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 10:08:58,358 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 10:08:58,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:08:58 BoogieIcfgContainer [2023-02-15 10:08:58,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 10:08:58,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 10:08:58,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 10:08:58,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 10:08:58,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:08:57" (1/3) ... [2023-02-15 10:08:58,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481a5428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:08:58, skipping insertion in model container [2023-02-15 10:08:58,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:08:57" (2/3) ... [2023-02-15 10:08:58,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481a5428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:08:58, skipping insertion in model container [2023-02-15 10:08:58,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:08:58" (3/3) ... [2023-02-15 10:08:58,367 INFO L112 eAbstractionObserver]: Analyzing ICFG s1lif.c [2023-02-15 10:08:58,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 10:08:58,413 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 10:08:58,473 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 10:08:58,494 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3fef2d29, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 10:08:58,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 10:08:58,499 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) [2023-02-15 10:08:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:08:58,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:58,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:58,509 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:58,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:58,519 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2023-02-15 10:08:58,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:58,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049927414] [2023-02-15 10:08:58,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:58,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:58,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049927414] [2023-02-15 10:08:58,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049927414] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:08:58,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:08:58,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 10:08:58,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362463891] [2023-02-15 10:08:58,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:08:58,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 10:08:58,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:58,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 10:08:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:08:58,722 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) [2023-02-15 10:08:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:08:58,740 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2023-02-15 10:08:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 10:08:58,742 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 [2023-02-15 10:08:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:08:58,756 INFO L225 Difference]: With dead ends: 40 [2023-02-15 10:08:58,757 INFO L226 Difference]: Without dead ends: 18 [2023-02-15 10:08:58,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 10:08:58,765 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 [2023-02-15 10:08:58,766 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] [2023-02-15 10:08:58,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-15 10:08:58,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-15 10:08:58,791 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) [2023-02-15 10:08:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-02-15 10:08:58,793 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-02-15 10:08:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:08:58,793 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-02-15 10:08:58,793 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) [2023-02-15 10:08:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-02-15 10:08:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 10:08:58,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:58,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 10:08:58,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 10:08:58,795 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:58,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2023-02-15 10:08:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:58,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480370042] [2023-02-15 10:08:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:08:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:08:58,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:08:58,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480370042] [2023-02-15 10:08:58,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480370042] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 10:08:58,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 10:08:58,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 10:08:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669251588] [2023-02-15 10:08:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 10:08:58,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 10:08:58,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:08:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 10:08:58,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:08:58,963 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) [2023-02-15 10:08:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:08:59,029 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2023-02-15 10:08:59,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 10:08:59,030 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 [2023-02-15 10:08:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:08:59,031 INFO L225 Difference]: With dead ends: 36 [2023-02-15 10:08:59,031 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 10:08:59,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 10:08:59,034 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:08:59,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:08:59,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 10:08:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2023-02-15 10:08:59,039 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) [2023-02-15 10:08:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-02-15 10:08:59,039 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2023-02-15 10:08:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:08:59,040 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-02-15 10:08:59,040 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) [2023-02-15 10:08:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-02-15 10:08:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:08:59,041 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:08:59,041 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] [2023-02-15 10:08:59,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 10:08:59,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:08:59,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:08:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2023-02-15 10:08:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:08:59,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216061020] [2023-02-15 10:08:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:08:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:08:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:00,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:09:00,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216061020] [2023-02-15 10:09:00,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216061020] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:09:00,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566687141] [2023-02-15 10:09:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:09:00,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:09:00,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:09:00,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 10:09:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:00,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 10:09:00,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:09:00,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:09:00,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:09:00,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:09:00,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-02-15 10:09:00,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2023-02-15 10:09:00,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-02-15 10:09:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:00,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:09:00,851 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:09:00,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2023-02-15 10:09:00,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:09:00,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2023-02-15 10:09:00,904 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:09:00,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-02-15 10:09:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:00,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566687141] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:09:00,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:09:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2023-02-15 10:09:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661735524] [2023-02-15 10:09:00,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:09:00,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 10:09:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:09:00,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 10:09:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2023-02-15 10:09:00,929 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:09:01,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:09:01,686 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2023-02-15 10:09:01,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 10:09:01,687 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-02-15 10:09:01,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:09:01,689 INFO L225 Difference]: With dead ends: 53 [2023-02-15 10:09:01,689 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 10:09:01,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=1401, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 10:09:01,691 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:09:01,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 80 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 10:09:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 10:09:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2023-02-15 10:09:01,698 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) [2023-02-15 10:09:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-02-15 10:09:01,699 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2023-02-15 10:09:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:09:01,699 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-02-15 10:09:01,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:09:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-02-15 10:09:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-15 10:09:01,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:09:01,700 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] [2023-02-15 10:09:01,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 10:09:01,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:01,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:09:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:09:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2023-02-15 10:09:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:09:01,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365308564] [2023-02-15 10:09:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:09:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:09:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:09:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365308564] [2023-02-15 10:09:02,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365308564] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:09:02,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638862873] [2023-02-15 10:09:02,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:09:02,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:02,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:09:02,162 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:09:02,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 10:09:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:02,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 10:09:02,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:09:02,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-02-15 10:09:02,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:09:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:02,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:09:02,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2023-02-15 10:09:02,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-02-15 10:09:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:02,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638862873] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:09:02,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:09:02,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-15 10:09:02,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646077756] [2023-02-15 10:09:02,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:09:02,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 10:09:02,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:09:02,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 10:09:02,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 10:09:02,315 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) [2023-02-15 10:09:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:09:02,391 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-02-15 10:09:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 10:09:02,392 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 [2023-02-15 10:09:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:09:02,395 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:09:02,395 INFO L226 Difference]: Without dead ends: 37 [2023-02-15 10:09:02,396 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 [2023-02-15 10:09:02,398 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:09:02,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 10:09:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-15 10:09:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2023-02-15 10:09:02,407 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) [2023-02-15 10:09:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-02-15 10:09:02,408 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2023-02-15 10:09:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:09:02,408 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-02-15 10:09:02,408 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) [2023-02-15 10:09:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-02-15 10:09:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:09:02,409 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:09:02,409 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] [2023-02-15 10:09:02,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 10:09:02,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-15 10:09:02,615 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:09:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:09:02,616 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2023-02-15 10:09:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:09:02,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095502069] [2023-02-15 10:09:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:09:02,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:09:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:09:02,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095502069] [2023-02-15 10:09:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095502069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:09:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110611058] [2023-02-15 10:09:02,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:09:02,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:09:02,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:09:02,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 10:09:02,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:09:02,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:09:02,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:09:02,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:09:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:02,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:09:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:02,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110611058] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:09:02,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:09:02,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:09:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406477479] [2023-02-15 10:09:02,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:09:02,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:09:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:09:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:09:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:09:02,856 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) [2023-02-15 10:09:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:09:02,949 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2023-02-15 10:09:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:09:02,950 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 [2023-02-15 10:09:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:09:02,951 INFO L225 Difference]: With dead ends: 70 [2023-02-15 10:09:02,951 INFO L226 Difference]: Without dead ends: 44 [2023-02-15 10:09:02,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-15 10:09:02,954 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:09:02,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 27 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:09:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-15 10:09:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2023-02-15 10:09:02,963 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) [2023-02-15 10:09:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-02-15 10:09:02,964 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2023-02-15 10:09:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:09:02,964 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-02-15 10:09:02,964 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) [2023-02-15 10:09:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-02-15 10:09:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 10:09:02,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:09:02,965 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] [2023-02-15 10:09:02,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 10:09:03,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:03,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:09:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:09:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2023-02-15 10:09:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:09:03,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52275765] [2023-02-15 10:09:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:09:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:09:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:09:03,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52275765] [2023-02-15 10:09:03,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52275765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:09:03,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557994377] [2023-02-15 10:09:03,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:09:03,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:03,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:09:03,285 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:09:03,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 10:09:03,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 10:09:03,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:09:03,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 10:09:03,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:09:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:03,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:09:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 10:09:03,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557994377] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:09:03,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:09:03,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-15 10:09:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741409731] [2023-02-15 10:09:03,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:09:03,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 10:09:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:09:03,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 10:09:03,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-15 10:09:03,457 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) [2023-02-15 10:09:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:09:03,554 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-02-15 10:09:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 10:09:03,554 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 [2023-02-15 10:09:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:09:03,557 INFO L225 Difference]: With dead ends: 39 [2023-02-15 10:09:03,557 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 10:09:03,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-15 10:09:03,558 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:09:03,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 24 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 10:09:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 10:09:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-02-15 10:09:03,568 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) [2023-02-15 10:09:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-15 10:09:03,569 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2023-02-15 10:09:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:09:03,570 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 10:09:03,570 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) [2023-02-15 10:09:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-02-15 10:09:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:09:03,571 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:09:03,571 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] [2023-02-15 10:09:03,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 10:09:03,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:03,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:09:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:09:03,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2023-02-15 10:09:03,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:09:03,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765554110] [2023-02-15 10:09:03,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:09:03,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:09:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:09:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:05,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:09:05,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765554110] [2023-02-15 10:09:05,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765554110] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:09:05,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771028849] [2023-02-15 10:09:05,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:09:05,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:09:05,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:09:05,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:09:05,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 10:09:05,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:09:05,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:09:05,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 59 conjunts are in the unsatisfiable core [2023-02-15 10:09:05,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:09:05,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:09:05,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:09:05,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:09:05,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:09:05,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:09:05,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:05,814 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:09:05,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:09:05,918 INFO L350 Elim1Store]: Elim1 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 62 treesize of output 40 [2023-02-15 10:09:06,027 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 36 [2023-02-15 10:09:06,103 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 31 [2023-02-15 10:09:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:06,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:09:07,031 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:09:07,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 264 treesize of output 124 [2023-02-15 10:09:18,750 WARN L233 SmtUtils]: Spent 11.61s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:09:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:09:23,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771028849] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:09:23,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:09:23,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 48 [2023-02-15 10:09:23,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044668840] [2023-02-15 10:09:23,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:09:23,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 10:09:23,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:09:23,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 10:09:23,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 10:09:23,794 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:09:55,761 WARN L233 SmtUtils]: Spent 21.36s on a formula simplification that was a NOOP. DAG size: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 10:10:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:10:10,371 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2023-02-15 10:10:10,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-02-15 10:10:10,371 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 10:10:10,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:10:10,371 INFO L225 Difference]: With dead ends: 91 [2023-02-15 10:10:10,371 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 10:10:10,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1675 ImplicationChecksByTransitivity, 60.6s TimeCoverageRelationStatistics Valid=882, Invalid=4970, Unknown=0, NotChecked=0, Total=5852 [2023-02-15 10:10:10,373 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-02-15 10:10:10,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 117 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-02-15 10:10:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 10:10:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2023-02-15 10:10:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2023-02-15 10:10:10,382 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 27 [2023-02-15 10:10:10,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:10:10,382 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2023-02-15 10:10:10,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2023-02-15 10:10:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 10:10:10,383 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:10:10,383 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] [2023-02-15 10:10:10,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 10:10:10,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:10:10,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:10:10,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:10:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2023-02-15 10:10:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:10:10,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812612407] [2023-02-15 10:10:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:10:10,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:10:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:10:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:10:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:10:11,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812612407] [2023-02-15 10:10:11,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812612407] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:10:11,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912586399] [2023-02-15 10:10:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:10:11,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:10:11,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:10:11,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:10:11,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 10:10:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:10:11,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 10:10:11,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:10:12,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 10:10:12,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:12,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 10:10:12,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 10:10:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:10:12,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:10:12,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 10:10:12,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-02-15 10:10:13,053 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:10:13,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912586399] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:10:13,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:10:13,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-15 10:10:13,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261345380] [2023-02-15 10:10:13,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:10:13,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:10:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:10:13,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:10:13,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:10:13,055 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:10:14,170 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2023-02-15 10:10:14,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:10:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 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 [2023-02-15 10:10:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:10:14,171 INFO L225 Difference]: With dead ends: 74 [2023-02-15 10:10:14,171 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 10:10:14,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:10:14,172 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 10:10:14,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 59 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 10:10:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 10:10:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2023-02-15 10:10:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 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) [2023-02-15 10:10:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-02-15 10:10:14,181 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 27 [2023-02-15 10:10:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:10:14,182 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-02-15 10:10:14,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-02-15 10:10:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:10:14,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:10:14,183 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] [2023-02-15 10:10:14,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 10:10:14,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:10:14,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:10:14,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:10:14,393 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2023-02-15 10:10:14,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:10:14,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223249038] [2023-02-15 10:10:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:10:14,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:10:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:10:14,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:10:14,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:10:14,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223249038] [2023-02-15 10:10:14,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223249038] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:10:14,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38446547] [2023-02-15 10:10:14,879 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 10:10:14,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:10:14,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:10:14,880 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:10:14,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 10:10:14,948 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-15 10:10:14,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:10:14,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:10:14,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:10:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:10:15,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:10:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:10:16,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38446547] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:10:16,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:10:16,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:10:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548443628] [2023-02-15 10:10:16,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:10:16,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:10:16,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:10:16,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:10:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:10:16,076 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:10:17,067 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2023-02-15 10:10:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 10:10:17,068 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 [2023-02-15 10:10:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:10:17,068 INFO L225 Difference]: With dead ends: 86 [2023-02-15 10:10:17,068 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 10:10:17,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:10:17,069 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:10:17,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 29 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 10:10:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 10:10:17,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2023-02-15 10:10:17,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-02-15 10:10:17,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 29 [2023-02-15 10:10:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:10:17,078 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-02-15 10:10:17,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-02-15 10:10:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 10:10:17,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:10:17,079 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] [2023-02-15 10:10:17,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 10:10:17,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:10:17,285 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:10:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:10:17,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1292373713, now seen corresponding path program 6 times [2023-02-15 10:10:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:10:17,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792249055] [2023-02-15 10:10:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:10:17,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:10:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:10:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 10:10:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:10:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792249055] [2023-02-15 10:10:17,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792249055] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:10:17,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228205117] [2023-02-15 10:10:17,822 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 10:10:17,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:10:17,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:10:17,825 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:10:17,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 10:10:17,890 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-02-15 10:10:17,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:10:17,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 10:10:17,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:10:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:10:18,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:10:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 10:10:19,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228205117] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:10:19,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:10:19,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-02-15 10:10:19,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401283205] [2023-02-15 10:10:19,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:10:19,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 10:10:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:10:19,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 10:10:19,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-02-15 10:10:19,061 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:10:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:10:20,208 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2023-02-15 10:10:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 10:10:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 10:10:20,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:10:20,210 INFO L225 Difference]: With dead ends: 48 [2023-02-15 10:10:20,210 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 10:10:20,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-02-15 10:10:20,211 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 75 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 10:10:20,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 21 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 10:10:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 10:10:20,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2023-02-15 10:10:20,217 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) [2023-02-15 10:10:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2023-02-15 10:10:20,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 29 [2023-02-15 10:10:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:10:20,218 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2023-02-15 10:10:20,218 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) [2023-02-15 10:10:20,218 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2023-02-15 10:10:20,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 10:10:20,218 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:10:20,219 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] [2023-02-15 10:10:20,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 10:10:20,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 10:10:20,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:10:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:10:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2023-02-15 10:10:20,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:10:20,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673258491] [2023-02-15 10:10:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:10:20,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:10:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:10:30,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:10:30,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:10:30,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673258491] [2023-02-15 10:10:30,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673258491] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:10:30,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285141903] [2023-02-15 10:10:30,625 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 10:10:30,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:10:30,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:10:30,626 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:10:30,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 10:10:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:10:30,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 10:10:30,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:10:30,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:10:30,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:10:31,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:10:31,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:10:31,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:10:33,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:10:33,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:33,942 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 10:10:35,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:35,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:35,066 INFO L350 Elim1Store]: Elim1 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 132 treesize of output 73 [2023-02-15 10:10:36,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:10:36,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:36,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:36,517 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 77 [2023-02-15 10:10:37,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:37,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:37,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:37,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:10:37,681 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 69 [2023-02-15 10:10:38,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:38,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:10:38,813 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:10:38,815 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 75 [2023-02-15 10:10:39,605 INFO L350 Elim1Store]: Elim1 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 154 treesize of output 46 [2023-02-15 10:10:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:10:39,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:10:49,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:10:49,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 836 treesize of output 258 [2023-02-15 10:10:51,693 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse0) 2)) (not (= 2 (select v_arrayElimArr_4 .cse1))) (< (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|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 2 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse5))))) (+ .cse6 1)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse0) 2)) (< .cse6 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse10 1)))))) (not (= 2 (select v_arrayElimArr_4 .cse1))))))) is different from false [2023-02-15 10:10:54,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (< (+ .cse0 1) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.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| (+ 2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse4)))))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse6) 2)) (not (= 2 (select v_arrayElimArr_4 .cse5))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse6) 2)) (< (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse10))))) (+ .cse0 3)) (not (= 2 (select v_arrayElimArr_4 .cse5))))))) is different from false [2023-02-15 10:10:57,700 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse0 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (< (+ .cse0 3) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.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| (+ 2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 2 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse4)))))) (not (= (select v_arrayElimArr_4 .cse6) 2)) (not (= 2 (select v_arrayElimArr_4 .cse5))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse6) 2)) (< (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse6))) (+ .cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 2 .cse10))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5) .cse10))))) (+ .cse0 5)) (not (= 2 (select v_arrayElimArr_4 .cse5))))))) is different from false [2023-02-15 10:10:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-02-15 10:10:57,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285141903] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:10:57,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:10:57,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 65 [2023-02-15 10:10:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857104373] [2023-02-15 10:10:57,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:10:57,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-15 10:10:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:10:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-15 10:10:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=3320, Unknown=3, NotChecked=366, Total=4160 [2023-02-15 10:10:57,940 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:11:02,522 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse9 .cse8)) (.cse0 (select .cse9 .cse7)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 1)) .cse8 (+ .cse1 1)) .cse7 (+ .cse0 1))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6 1)))))) (not (= .cse6 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (< (+ .cse10 3) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 2 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14)))))) (not (= (select v_arrayElimArr_4 .cse8) 2)) (not (= 2 (select v_arrayElimArr_4 .cse7))))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (< (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 2 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse18))))) (+ .cse10 5)) (not (= 2 (select v_arrayElimArr_4 .cse7))))))) is different from false [2023-02-15 10:11:05,571 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (* 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse9 .cse8)) (.cse0 (select .cse9 .cse7)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (= .cse0 1)) (not (= .cse1 1)) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (= (* c_~N~0 2) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse6 1)) .cse8 (+ .cse1 1)) .cse7 (+ .cse0 1))))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse5 .cse6 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse5 .cse6 1)))))) (not (= .cse6 1))))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (< (+ .cse10 1) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse13 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse11 2 .cse14))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse14)))))) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (not (= 2 (select v_arrayElimArr_4 .cse7))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) (not (= (select v_arrayElimArr_4 .cse8) 2)) (< (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_4))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 2 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse8))) (+ .cse15 (select (select (store .cse16 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse17 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 2 .cse18))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7) .cse18))))) (+ .cse10 3)) (not (= 2 (select v_arrayElimArr_4 .cse7))))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2023-02-15 10:11:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:11:28,070 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2023-02-15 10:11:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 10:11:28,071 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-15 10:11:28,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:11:28,071 INFO L225 Difference]: With dead ends: 82 [2023-02-15 10:11:28,071 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 10:11:28,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1868 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=636, Invalid=4349, Unknown=5, NotChecked=710, Total=5700 [2023-02-15 10:11:28,073 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-02-15 10:11:28,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 191 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1067 Invalid, 0 Unknown, 152 Unchecked, 9.6s Time] [2023-02-15 10:11:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 10:11:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 51. [2023-02-15 10:11:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 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) [2023-02-15 10:11:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2023-02-15 10:11:28,090 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 34 [2023-02-15 10:11:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:11:28,090 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2023-02-15 10:11:28,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:11:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2023-02-15 10:11:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 10:11:28,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:11:28,096 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] [2023-02-15 10:11:28,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 10:11:28,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:11:28,301 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:11:28,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:11:28,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2023-02-15 10:11:28,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:11:28,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619556429] [2023-02-15 10:11:28,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:11:28,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:11:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:11:30,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:11:30,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:11:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619556429] [2023-02-15 10:11:30,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619556429] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:11:30,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634976992] [2023-02-15 10:11:30,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:11:30,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:11:30,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:11:30,477 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:11:30,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 10:11:30,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:11:30,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:11:30,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 10:11:30,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:11:31,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 10:11:31,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:11:31,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 10:11:32,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:11:32,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 10:11:32,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 10:11:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:11:32,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:11:33,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 10:11:33,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-02-15 10:11:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:11:33,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634976992] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:11:33,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:11:33,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2023-02-15 10:11:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815834777] [2023-02-15 10:11:33,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:11:33,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 10:11:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:11:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 10:11:33,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2023-02-15 10:11:33,714 INFO L87 Difference]: Start difference. First operand 51 states and 57 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) [2023-02-15 10:11:38,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:11:38,317 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2023-02-15 10:11:38,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 10:11:38,318 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 [2023-02-15 10:11:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:11:38,318 INFO L225 Difference]: With dead ends: 76 [2023-02-15 10:11:38,318 INFO L226 Difference]: Without dead ends: 61 [2023-02-15 10:11:38,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 10:11:38,320 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-15 10:11:38,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 70 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-02-15 10:11:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-02-15 10:11:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2023-02-15 10:11:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:11:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2023-02-15 10:11:38,339 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 34 [2023-02-15 10:11:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:11:38,339 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2023-02-15 10:11:38,339 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) [2023-02-15 10:11:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2023-02-15 10:11:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:11:38,340 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:11:38,340 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] [2023-02-15 10:11:38,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 10:11:38,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 10:11:38,541 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:11:38,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:11:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2023-02-15 10:11:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:11:38,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379735145] [2023-02-15 10:11:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:11:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:11:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:11:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:11:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:11:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379735145] [2023-02-15 10:11:39,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379735145] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:11:39,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940159467] [2023-02-15 10:11:39,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 10:11:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:11:39,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:11:39,473 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:11:39,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 10:11:39,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 10:11:39,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:11:39,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 10:11:39,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:11:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:11:40,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:11:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 10:11:41,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940159467] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:11:41,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:11:41,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 10:11:41,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545241502] [2023-02-15 10:11:41,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:11:41,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:11:41,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:11:41,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:11:41,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:11:41,570 INFO L87 Difference]: Start difference. First operand 53 states and 59 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) [2023-02-15 10:11:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:11:43,071 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2023-02-15 10:11:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 10:11:43,071 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 [2023-02-15 10:11:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:11:43,072 INFO L225 Difference]: With dead ends: 102 [2023-02-15 10:11:43,072 INFO L226 Difference]: Without dead ends: 62 [2023-02-15 10:11:43,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-02-15 10:11:43,073 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 10:11:43,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 34 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 10:11:43,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-02-15 10:11:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2023-02-15 10:11:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 10:11:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2023-02-15 10:11:43,085 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2023-02-15 10:11:43,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:11:43,086 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2023-02-15 10:11:43,086 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) [2023-02-15 10:11:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2023-02-15 10:11:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 10:11:43,087 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:11:43,087 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] [2023-02-15 10:11:43,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 10:11:43,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-02-15 10:11:43,294 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:11:43,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:11:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2023-02-15 10:11:43,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:11:43,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177558109] [2023-02-15 10:11:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:11:43,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:11:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:11:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:11:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:11:44,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177558109] [2023-02-15 10:11:44,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177558109] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:11:44,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56429427] [2023-02-15 10:11:44,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 10:11:44,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:11:44,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:11:44,317 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:11:44,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 10:11:44,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 10:11:44,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:11:44,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 10:11:44,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:11:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:11:45,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:11:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 10:11:46,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56429427] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:11:46,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:11:46,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-02-15 10:11:46,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159537194] [2023-02-15 10:11:46,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:11:46,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 10:11:46,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:11:46,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 10:11:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-02-15 10:11:46,281 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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) [2023-02-15 10:11:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 10:11:48,415 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-02-15 10:11:48,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 10:11:48,416 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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 36 [2023-02-15 10:11:48,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 10:11:48,416 INFO L225 Difference]: With dead ends: 57 [2023-02-15 10:11:48,416 INFO L226 Difference]: Without dead ends: 45 [2023-02-15 10:11:48,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2023-02-15 10:11:48,417 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 10:11:48,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 10:11:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-15 10:11:48,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-02-15 10:11:48,425 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) [2023-02-15 10:11:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2023-02-15 10:11:48,425 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2023-02-15 10:11:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 10:11:48,425 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2023-02-15 10:11:48,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 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) [2023-02-15 10:11:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2023-02-15 10:11:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 10:11:48,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 10:11:48,426 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] [2023-02-15 10:11:48,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 10:11:48,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-02-15 10:11:48,633 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 10:11:48,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 10:11:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2023-02-15 10:11:48,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 10:11:48,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495153960] [2023-02-15 10:11:48,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 10:11:48,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 10:11:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 10:12:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:03,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 10:12:03,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495153960] [2023-02-15 10:12:03,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495153960] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 10:12:03,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497432448] [2023-02-15 10:12:03,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 10:12:03,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 10:12:03,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 10:12:03,069 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 10:12:03,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 10:12:03,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 10:12:03,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 10:12:03,166 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 109 conjunts are in the unsatisfiable core [2023-02-15 10:12:03,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 10:12:03,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 10:12:03,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-02-15 10:12:04,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:12:05,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:12:05,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:12:06,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 10:12:09,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2023-02-15 10:12:11,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:11,095 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:11,097 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:12:11,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2023-02-15 10:12:13,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:13,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:13,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:13,278 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:12:13,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 49 [2023-02-15 10:12:15,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:15,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:15,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:15,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:15,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:15,532 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:12:15,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 61 [2023-02-15 10:12:18,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:18,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:18,667 INFO L321 Elim1Store]: treesize reduction 59, result has 24.4 percent of original size [2023-02-15 10:12:18,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 67 treesize of output 70 [2023-02-15 10:12:20,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:20,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:20,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:20,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:20,312 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:20,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:20,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:20,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 61 [2023-02-15 10:12:22,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:22,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:22,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:22,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:22,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:22,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 10:12:22,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 10:12:22,144 INFO L321 Elim1Store]: treesize reduction 30, result has 18.9 percent of original size [2023-02-15 10:12:22,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 67 treesize of output 70 [2023-02-15 10:12:23,863 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2023-02-15 10:12:23,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 63 treesize of output 55 [2023-02-15 10:12:24,812 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 10:12:24,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 42 [2023-02-15 10:12:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:12:25,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 10:12:55,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 10:12:55,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 1159 treesize of output 287 [2023-02-15 10:13:11,505 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 10:13:11,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 402 treesize of output 1 [2023-02-15 10:13:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 10:13:11,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497432448] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 10:13:11,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 10:13:11,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 34, 32] total 92 [2023-02-15 10:13:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023719903] [2023-02-15 10:13:11,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 10:13:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2023-02-15 10:13:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 10:13:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2023-02-15 10:13:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=6938, Unknown=0, NotChecked=0, Total=8372 [2023-02-15 10:13:11,511 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 92 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 92 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)