./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test22-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test22-1.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 e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 14:28:01,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:28:01,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:28:01,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:28:01,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:28:01,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:28:01,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:28:01,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:28:01,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:28:01,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:28:01,203 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:28:01,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:28:01,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:28:01,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:28:01,207 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:28:01,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:28:01,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:28:01,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:28:01,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:28:01,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:28:01,219 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:28:01,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:28:01,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:28:01,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:28:01,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:28:01,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:28:01,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:28:01,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:28:01,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:28:01,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:28:01,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:28:01,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:28:01,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:28:01,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:28:01,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:28:01,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:28:01,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:28:01,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:28:01,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:28:01,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:28:01,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:28:01,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:28:01,238 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:28:01,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:28:01,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:28:01,262 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:28:01,262 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:28:01,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:28:01,263 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:28:01,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:28:01,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:28:01,264 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:28:01,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:28:01,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:28:01,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:28:01,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:28:01,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:28:01,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:28:01,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:28:01,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:28:01,266 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:28:01,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:28:01,266 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:28:01,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:28:01,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:28:01,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:28:01,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:28:01,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:01,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:28:01,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:28:01,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:28:01,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:28:01,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:28:01,268 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:28:01,268 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:28:01,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:28:01,268 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1ce1c36cc17bb5fac8e93fbe54fbc2a77334d62ad40c06c722f9da96af2516f [2022-07-19 14:28:01,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:28:01,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:28:01,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:28:01,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:28:01,511 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:28:01,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test22-1.c [2022-07-19 14:28:01,559 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c0ce414/e8d1407f52084232921edfcf1c086752/FLAGa963e2e8f [2022-07-19 14:28:01,967 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:28:01,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c [2022-07-19 14:28:01,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c0ce414/e8d1407f52084232921edfcf1c086752/FLAGa963e2e8f [2022-07-19 14:28:01,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c0ce414/e8d1407f52084232921edfcf1c086752 [2022-07-19 14:28:01,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:28:01,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:28:01,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:01,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:28:01,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:28:01,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:01" (1/1) ... [2022-07-19 14:28:01,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a094442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:01, skipping insertion in model container [2022-07-19 14:28:01,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:01" (1/1) ... [2022-07-19 14:28:01,998 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:28:02,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:28:02,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-07-19 14:28:02,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:02,175 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:28:02,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test22-1.c[1029,1042] [2022-07-19 14:28:02,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:02,206 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:28:02,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02 WrapperNode [2022-07-19 14:28:02,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:02,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:02,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:28:02,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:28:02,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,240 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-07-19 14:28:02,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:02,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:28:02,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:28:02,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:28:02,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:28:02,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:28:02,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:28:02,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:28:02,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (1/1) ... [2022-07-19 14:28:02,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:02,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:02,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:28:02,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:28:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:28:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:28:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:28:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-07-19 14:28:02,349 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-07-19 14:28:02,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:28:02,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:28:02,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:28:02,415 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:28:02,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:28:02,558 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:28:02,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:28:02,562 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 14:28:02,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:02 BoogieIcfgContainer [2022-07-19 14:28:02,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:28:02,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:28:02,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:28:02,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:28:02,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:28:01" (1/3) ... [2022-07-19 14:28:02,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c02452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:02, skipping insertion in model container [2022-07-19 14:28:02,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:02" (2/3) ... [2022-07-19 14:28:02,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c02452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:02, skipping insertion in model container [2022-07-19 14:28:02,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:02" (3/3) ... [2022-07-19 14:28:02,575 INFO L111 eAbstractionObserver]: Analyzing ICFG test22-1.c [2022-07-19 14:28:02,584 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:28:02,597 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 14:28:02,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:28:02,662 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fcf46fd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ab8947a [2022-07-19 14:28:02,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 14:28:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:28:02,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:28:02,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:02,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:02,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash -911093318, now seen corresponding path program 1 times [2022-07-19 14:28:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:02,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584560744] [2022-07-19 14:28:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:02,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 14:28:02,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:02,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584560744] [2022-07-19 14:28:02,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584560744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:02,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:02,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:28:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092134633] [2022-07-19 14:28:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:02,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:28:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:28:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:28:02,969 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:28:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:02,985 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-07-19 14:28:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:28:02,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-19 14:28:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:02,993 INFO L225 Difference]: With dead ends: 35 [2022-07-19 14:28:02,996 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 14:28:02,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:28:03,002 INFO L413 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:03,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:28:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 14:28:03,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-19 14:28:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:28:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-19 14:28:03,029 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2022-07-19 14:28:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:03,030 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-19 14:28:03,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:28:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-19 14:28:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 14:28:03,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:03,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:03,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:28:03,032 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1614870372, now seen corresponding path program 1 times [2022-07-19 14:28:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:03,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740766130] [2022-07-19 14:28:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:03,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:03,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:28:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:03,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740766130] [2022-07-19 14:28:03,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740766130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:03,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560913577] [2022-07-19 14:28:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:03,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:03,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:03,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:03,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 14:28:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:03,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 14:28:03,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:03,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 14:28:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:03,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:03,747 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 14:28:03,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-19 14:28:03,794 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 14:28:03,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560913577] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:03,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:28:03,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 16] total 26 [2022-07-19 14:28:03,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653314766] [2022-07-19 14:28:03,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:03,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 14:28:03,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 14:28:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-07-19 14:28:03,798 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:28:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:03,847 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-07-19 14:28:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:28:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-07-19 14:28:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:03,848 INFO L225 Difference]: With dead ends: 30 [2022-07-19 14:28:03,848 INFO L226 Difference]: Without dead ends: 25 [2022-07-19 14:28:03,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-07-19 14:28:03,850 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:03,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 14:28:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-19 14:28:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-07-19 14:28:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 14:28:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-07-19 14:28:03,854 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-07-19 14:28:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:03,855 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-07-19 14:28:03,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 14:28:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-07-19 14:28:03,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-19 14:28:03,856 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:03,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:03,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 14:28:04,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:04,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1377934871, now seen corresponding path program 1 times [2022-07-19 14:28:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:04,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339049713] [2022-07-19 14:28:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:04,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:28:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:04,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339049713] [2022-07-19 14:28:04,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339049713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:04,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737606857] [2022-07-19 14:28:04,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:04,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:04,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:04,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 14:28:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:04,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-19 14:28:04,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:04,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 14:28:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:04,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:04,715 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 14:28:04,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-19 14:28:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 14:28:04,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737606857] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:04,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:04,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 7] total 29 [2022-07-19 14:28:04,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86565303] [2022-07-19 14:28:04,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:04,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-19 14:28:04,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:04,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-19 14:28:04,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2022-07-19 14:28:04,759 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 14:28:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:05,649 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-07-19 14:28:05,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-19 14:28:05,649 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 31 [2022-07-19 14:28:05,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:05,652 INFO L225 Difference]: With dead ends: 71 [2022-07-19 14:28:05,653 INFO L226 Difference]: Without dead ends: 61 [2022-07-19 14:28:05,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2022-07-19 14:28:05,656 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 120 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:05,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 267 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:28:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-19 14:28:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2022-07-19 14:28:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 14:28:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-07-19 14:28:05,682 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 31 [2022-07-19 14:28:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:05,682 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-07-19 14:28:05,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 14:28:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-07-19 14:28:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 14:28:05,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:05,687 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:05,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-19 14:28:05,919 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,SelfDestructingSolverStorable2 [2022-07-19 14:28:05,920 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:05,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash -772238856, now seen corresponding path program 2 times [2022-07-19 14:28:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:05,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911087808] [2022-07-19 14:28:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:28:06,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911087808] [2022-07-19 14:28:06,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911087808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270615457] [2022-07-19 14:28:06,158 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:28:06,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:06,167 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:06,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 14:28:06,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:28:06,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:28:06,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 14:28:06,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:06,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-19 14:28:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 14:28:06,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:06,801 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 14:28:06,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-07-19 14:28:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 14:28:06,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270615457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:06,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:06,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 10] total 37 [2022-07-19 14:28:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470800795] [2022-07-19 14:28:06,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-19 14:28:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-19 14:28:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 14:28:06,853 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 14:28:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:08,312 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-07-19 14:28:08,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-19 14:28:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 37 [2022-07-19 14:28:08,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:08,316 INFO L225 Difference]: With dead ends: 90 [2022-07-19 14:28:08,317 INFO L226 Difference]: Without dead ends: 85 [2022-07-19 14:28:08,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1387, Invalid=5753, Unknown=0, NotChecked=0, Total=7140 [2022-07-19 14:28:08,334 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 182 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:08,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 268 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:28:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-19 14:28:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 51. [2022-07-19 14:28:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-19 14:28:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-07-19 14:28:08,349 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 37 [2022-07-19 14:28:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:08,349 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-07-19 14:28:08,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 14:28:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-07-19 14:28:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 14:28:08,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:08,353 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:08,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:08,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1758737322, now seen corresponding path program 3 times [2022-07-19 14:28:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:08,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306646830] [2022-07-19 14:28:08,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:08,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:08,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:08,851 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 113 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:28:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:08,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306646830] [2022-07-19 14:28:08,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306646830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:08,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777021479] [2022-07-19 14:28:08,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:28:08,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:08,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:08,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:08,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 14:28:08,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 14:28:08,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:28:08,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-19 14:28:08,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:09,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-07-19 14:28:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-19 14:28:09,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:09,507 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 14:28:09,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2022-07-19 14:28:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-19 14:28:09,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777021479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:09,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:09,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 40 [2022-07-19 14:28:09,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565967824] [2022-07-19 14:28:09,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:09,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-19 14:28:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:09,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-19 14:28:09,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 14:28:09,721 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 14:28:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:12,456 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2022-07-19 14:28:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-19 14:28:12,457 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2022-07-19 14:28:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:12,457 INFO L225 Difference]: With dead ends: 163 [2022-07-19 14:28:12,458 INFO L226 Difference]: Without dead ends: 117 [2022-07-19 14:28:12,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2752 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1116, Invalid=11316, Unknown=0, NotChecked=0, Total=12432 [2022-07-19 14:28:12,460 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 229 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:12,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 410 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 14:28:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-19 14:28:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 49. [2022-07-19 14:28:12,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 43 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-19 14:28:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-19 14:28:12,467 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2022-07-19 14:28:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:12,468 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-19 14:28:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-19 14:28:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-19 14:28:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 14:28:12,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:12,469 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:12,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:12,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:12,686 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:12,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash -290973603, now seen corresponding path program 1 times [2022-07-19 14:28:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:12,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129314171] [2022-07-19 14:28:12,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:12,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:12,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:12,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 14:28:12,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:12,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129314171] [2022-07-19 14:28:12,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129314171] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:12,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411213182] [2022-07-19 14:28:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:12,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:12,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:12,784 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:12,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 14:28:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:12,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 14:28:12,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-07-19 14:28:12,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 14:28:13,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411213182] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:13,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:13,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 30 [2022-07-19 14:28:13,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932165852] [2022-07-19 14:28:13,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:13,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-19 14:28:13,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:13,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-19 14:28:13,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2022-07-19 14:28:13,147 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 14:28:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:13,314 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-07-19 14:28:13,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 14:28:13,315 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 51 [2022-07-19 14:28:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:13,315 INFO L225 Difference]: With dead ends: 85 [2022-07-19 14:28:13,315 INFO L226 Difference]: Without dead ends: 47 [2022-07-19 14:28:13,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 14:28:13,316 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:13,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 281 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:28:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-19 14:28:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-19 14:28:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 14:28:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-07-19 14:28:13,321 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 51 [2022-07-19 14:28:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:13,322 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-07-19 14:28:13,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-19 14:28:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-07-19 14:28:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 14:28:13,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:13,323 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:13,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:13,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:13,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1067708707, now seen corresponding path program 2 times [2022-07-19 14:28:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:13,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154435768] [2022-07-19 14:28:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:13,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:13,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:13,645 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 14:28:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:13,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154435768] [2022-07-19 14:28:13,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154435768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:13,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388181243] [2022-07-19 14:28:13,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 14:28:13,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:13,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:13,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 14:28:13,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 14:28:13,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:28:13,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 14:28:13,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-07-19 14:28:13,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-19 14:28:13,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388181243] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:13,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:13,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 25 [2022-07-19 14:28:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678922041] [2022-07-19 14:28:13,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:13,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 14:28:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 14:28:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-07-19 14:28:13,981 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-19 14:28:14,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:14,139 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-07-19 14:28:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 14:28:14,140 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-07-19 14:28:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:14,141 INFO L225 Difference]: With dead ends: 81 [2022-07-19 14:28:14,141 INFO L226 Difference]: Without dead ends: 47 [2022-07-19 14:28:14,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2022-07-19 14:28:14,142 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:14,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 155 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 14:28:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-19 14:28:14,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-19 14:28:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 14:28:14,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-07-19 14:28:14,147 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 51 [2022-07-19 14:28:14,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:14,148 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-07-19 14:28:14,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-19 14:28:14,148 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-07-19 14:28:14,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 14:28:14,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:14,149 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:14,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:14,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:14,367 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 14:28:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash -644061985, now seen corresponding path program 3 times [2022-07-19 14:28:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:14,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035265539] [2022-07-19 14:28:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:14,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 14:28:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 14:28:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 14:28:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-19 14:28:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:14,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035265539] [2022-07-19 14:28:14,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035265539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:14,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937667284] [2022-07-19 14:28:14,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 14:28:14,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:14,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:14,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 14:28:14,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 14:28:14,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-19 14:28:14,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 14:28:14,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-19 14:28:14,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:15,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 25 [2022-07-19 14:28:15,321 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-07-19 14:28:15,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:15,491 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 14:28:15,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2022-07-19 14:28:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-19 14:28:15,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937667284] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:15,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:15,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 11] total 44 [2022-07-19 14:28:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438152292] [2022-07-19 14:28:15,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:15,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-19 14:28:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-19 14:28:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2022-07-19 14:28:15,591 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 14:28:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:16,892 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-07-19 14:28:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-19 14:28:16,893 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 51 [2022-07-19 14:28:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:16,893 INFO L225 Difference]: With dead ends: 47 [2022-07-19 14:28:16,894 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 14:28:16,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=939, Invalid=4173, Unknown=0, NotChecked=0, Total=5112 [2022-07-19 14:28:16,896 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:16,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 202 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 14:28:16,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 14:28:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 14:28:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:28:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 14:28:16,899 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-07-19 14:28:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:16,899 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 14:28:16,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-19 14:28:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 14:28:16,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 14:28:16,902 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 14:28:16,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:17,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:17,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 14:28:18,474 INFO L899 garLoopResultBuilder]: For program point get_dummyFINAL(lines 22 25) no Hoare annotation was computed. [2022-07-19 14:28:18,475 INFO L902 garLoopResultBuilder]: At program point get_dummyENTRY(lines 22 25) the Hoare annotation is: true [2022-07-19 14:28:18,475 INFO L899 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-07-19 14:28:18,475 INFO L899 garLoopResultBuilder]: For program point get_dummyEXIT(lines 22 25) no Hoare annotation was computed. [2022-07-19 14:28:18,475 INFO L895 garLoopResultBuilder]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse0 (= |~#d1~0.offset| 0))) (or (and (= |~#d1~0.offset| |ULTIMATE.start_main_~pd1~0#1.offset|) (= 4 |ULTIMATE.start_main_~pd1~0#1.base|) (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse0 (<= 5 |~#d2~0.base|)) (and (= |~#d2~0.offset| |ULTIMATE.start_main_~pd1~0#1.offset|) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |ULTIMATE.start_main_~pd1~0#1.base|) (= 5 |~#d2~0.base|) .cse0))) [2022-07-19 14:28:18,475 INFO L899 garLoopResultBuilder]: For program point L37-4(lines 37 46) no Hoare annotation was computed. [2022-07-19 14:28:18,475 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 14:28:18,476 INFO L899 garLoopResultBuilder]: For program point L35-3(line 35) no Hoare annotation was computed. [2022-07-19 14:28:18,476 INFO L895 garLoopResultBuilder]: At program point L35-4(line 35) the Hoare annotation is: (let ((.cse1 (= |~#d1~0.base| 4)) (.cse2 (= 5 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse3 (= 5 |~#d2~0.base|)) (.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse6 (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse4 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse5 (= |~#d1~0.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= |ULTIMATE.start_main_~pd1~0#1.base| 4) .cse1 .cse5 (<= 5 |~#d2~0.base|) (<= 5 |ULTIMATE.start_main_~pd2~0#1.base|)) (and .cse0 (= |~#d2~0.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) .cse6 .cse5 .cse7) (and .cse0 (= |~#d1~0.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) .cse6 .cse4 (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse5 .cse7))) [2022-07-19 14:28:18,476 INFO L899 garLoopResultBuilder]: For program point L35-5(line 35) no Hoare annotation was computed. [2022-07-19 14:28:18,476 INFO L895 garLoopResultBuilder]: At program point L29(lines 27 30) the Hoare annotation is: (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|) |ULTIMATE.start_main_~i~0#1|) (= |~#d1~0.base| 4) (<= 1 |ULTIMATE.start_check_#res#1|) (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|) (= |~#d1~0.offset| 0)) [2022-07-19 14:28:18,476 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 20) no Hoare annotation was computed. [2022-07-19 14:28:18,476 INFO L895 garLoopResultBuilder]: At program point L44(lines 33 52) the Hoare annotation is: false [2022-07-19 14:28:18,477 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2022-07-19 14:28:18,477 INFO L895 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse25 (+ 7 |ULTIMATE.start_main_~i~0#1|)) (.cse26 (+ 9 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|))) (let ((.cse17 (< |ULTIMATE.start_main_~i~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~pa~0#1.base|) |ULTIMATE.start_main_~pa~0#1.offset|) 1))) (.cse24 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 10))) (.cse19 (= .cse5 .cse26)) (.cse10 (= |~#d2~0.offset| 0)) (.cse12 (= 5 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse13 (= 5 |~#d2~0.base|)) (.cse20 (<= .cse26 .cse5)) (.cse22 (<= .cse25 .cse5)) (.cse23 (= .cse5 .cse25)) (.cse1 (= |~#d1~0.offset| |ULTIMATE.start_main_~pd2~0#1.offset|)) (.cse2 (= 4 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse3 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse16 (+ 6 |ULTIMATE.start_main_~i~0#1|)) (.cse18 (= |ULTIMATE.start_main_~pa~0#1.base| |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse21 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 8))) (.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse11 (= |~#d1~0.base| 4)) (.cse14 (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|)) (.cse15 (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse4 (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse6 (= |~#d1~0.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~pa~0#1.base| 4)) (.cse8 (= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pa~0#1.offset|)) (.cse9 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ 5 |ULTIMATE.start_main_~i~0#1|) .cse5) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse5 .cse16) .cse17 .cse6 .cse18 .cse8 .cse9) (and .cse0 .cse19 .cse11 .cse14 .cse15 .cse6 .cse18 .cse20 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse21 .cse8 .cse9) (and .cse22 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 (= (+ 3 |ULTIMATE.start_main_~i~0#1|) .cse5) .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse8 .cse9) (and .cse0 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse11 .cse14 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 (<= (select (select |#memory_int| 4) 0) |ULTIMATE.start_main_~i~0#1|) .cse8 .cse9) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse20 .cse8 .cse9) (and .cse0 (= .cse5 (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse22 .cse23 .cse11 .cse14 .cse15 .cse6 .cse18 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (= .cse5 .cse16) .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 .cse6 .cse18 .cse7 .cse21 .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 .cse4 (= (+ |ULTIMATE.start_main_~i~0#1| 4) .cse5) .cse6 .cse7 .cse8 .cse9)))) [2022-07-19 14:28:18,477 INFO L899 garLoopResultBuilder]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2022-07-19 14:28:18,477 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 14:28:18,477 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 14:28:18,478 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 14:28:18,478 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2022-07-19 14:28:18,478 INFO L902 garLoopResultBuilder]: At program point L51(lines 32 52) the Hoare annotation is: true [2022-07-19 14:28:18,478 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-07-19 14:28:18,478 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-07-19 14:28:18,478 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (= |~#d1~0.offset| 0)) [2022-07-19 14:28:18,478 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 46) no Hoare annotation was computed. [2022-07-19 14:28:18,479 INFO L899 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-07-19 14:28:18,481 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2022-07-19 14:28:18,482 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 14:28:18,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 02:28:18 BoogieIcfgContainer [2022-07-19 14:28:18,520 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 14:28:18,520 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 14:28:18,520 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 14:28:18,521 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 14:28:18,521 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:02" (3/4) ... [2022-07-19 14:28:18,523 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 14:28:18,527 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2022-07-19 14:28:18,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-19 14:28:18,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 14:28:18,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 14:28:18,530 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 14:28:18,546 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i) && d1 == 4) && 1 <= \result) && pd1 == pd2) && pd2 == pd1) && d1 == 0 [2022-07-19 14:28:18,556 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 14:28:18,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 14:28:18,557 INFO L158 Benchmark]: Toolchain (without parser) took 16569.37ms. Allocated memory was 117.4MB in the beginning and 283.1MB in the end (delta: 165.7MB). Free memory was 89.8MB in the beginning and 97.3MB in the end (delta: -7.5MB). Peak memory consumption was 158.0MB. Max. memory is 16.1GB. [2022-07-19 14:28:18,557 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:28:18,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.08ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 89.6MB in the beginning and 153.7MB in the end (delta: -64.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-07-19 14:28:18,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.86ms. Allocated memory is still 180.4MB. Free memory was 153.7MB in the beginning and 152.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:28:18,558 INFO L158 Benchmark]: Boogie Preprocessor took 28.04ms. Allocated memory is still 180.4MB. Free memory was 152.1MB in the beginning and 150.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:18,558 INFO L158 Benchmark]: RCFGBuilder took 293.46ms. Allocated memory is still 180.4MB. Free memory was 150.7MB in the beginning and 139.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 14:28:18,559 INFO L158 Benchmark]: TraceAbstraction took 15955.34ms. Allocated memory was 180.4MB in the beginning and 283.1MB in the end (delta: 102.8MB). Free memory was 139.0MB in the beginning and 100.4MB in the end (delta: 38.6MB). Peak memory consumption was 149.6MB. Max. memory is 16.1GB. [2022-07-19 14:28:18,559 INFO L158 Benchmark]: Witness Printer took 36.52ms. Allocated memory is still 283.1MB. Free memory was 100.4MB in the beginning and 97.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:18,560 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.08ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 89.6MB in the beginning and 153.7MB in the end (delta: -64.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.86ms. Allocated memory is still 180.4MB. Free memory was 153.7MB in the beginning and 152.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.04ms. Allocated memory is still 180.4MB. Free memory was 152.1MB in the beginning and 150.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 293.46ms. Allocated memory is still 180.4MB. Free memory was 150.7MB in the beginning and 139.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15955.34ms. Allocated memory was 180.4MB in the beginning and 283.1MB in the end (delta: 102.8MB). Free memory was 139.0MB in the beginning and 100.4MB in the end (delta: 38.6MB). Peak memory consumption was 149.6MB. Max. memory is 16.1GB. * Witness Printer took 36.52ms. Allocated memory is still 283.1MB. Free memory was 100.4MB in the beginning and 97.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 1691 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1538 mSDsCounter, 479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4283 IncrementalHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 479 mSolverCounterUnsat, 153 mSDtfsCounter, 4283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 520 SyntacticMatches, 2 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6143 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 125 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 45 NumberOfFragments, 843 HoareAnnotationTreeSize, 14 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 8539 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 626 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1398 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1436/1848 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && 5 + i == unknown-#memory_int-unknown[pd2][pd2]) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0) || (((((((((((d2 == 0 && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && unknown-#memory_int-unknown[pd2][pd2] <= 6 + i) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == 9 + i) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && 9 + i <= unknown-#memory_int-unknown[pd2][pd2]) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((d2 == 0 && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && unknown-#memory_int-unknown[pd2][pd2] == i + 8) && pd2 == pa) && pd1 == 0)) || (((((((((((7 + i <= unknown-#memory_int-unknown[pd2][pd2] && unknown-#memory_int-unknown[pd2][pd2] == 7 + i) && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && 3 + i == unknown-#memory_int-unknown[pd2][pd2]) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((unknown-#memory_int-unknown[pd2][pd2] == i + 10 && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i + 1) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d1 == pd1) && d1 == 0) && pa == 4) && unknown-#memory_int-unknown[4][0] <= i) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i + 10) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || (((((((((((unknown-#memory_int-unknown[pd2][pd2] == 9 + i && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && 9 + i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == 2 + i) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && 7 + i <= unknown-#memory_int-unknown[pd2][pd2]) && unknown-#memory_int-unknown[pd2][pd2] == 7 + i) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pa == 4) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && unknown-#memory_int-unknown[pd2][pd2] == 6 + i) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pa == 4) && unknown-#memory_int-unknown[pd2][pd2] == i + 8) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == pd1) && i + 4 == unknown-#memory_int-unknown[pd2][pd2]) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i) && d1 == 4) && 1 <= \result) && pd1 == pd2) && pd2 == pd1) && d1 == 0 RESULT: Ultimate proved your program to be correct! [2022-07-19 14:28:18,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE