./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e8d55036 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/reducercommutativity/sum05-2.i -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 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 18:22:43,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 18:22:43,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 18:22:43,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 18:22:43,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 18:22:43,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 18:22:43,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 18:22:43,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 18:22:43,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 18:22:43,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 18:22:43,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 18:22:43,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 18:22:43,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 18:22:43,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 18:22:43,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 18:22:43,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 18:22:43,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 18:22:43,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 18:22:43,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 18:22:43,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 18:22:43,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 18:22:43,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 18:22:43,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 18:22:43,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 18:22:43,208 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 18:22:43,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 18:22:43,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 18:22:43,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 18:22:43,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 18:22:43,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 18:22:43,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 18:22:43,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 18:22:43,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 18:22:43,215 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 18:22:43,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 18:22:43,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 18:22:43,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 18:22:43,217 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 18:22:43,217 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 18:22:43,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 18:22:43,218 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 18:22:43,219 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 18:22:43,234 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 18:22:43,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 18:22:43,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 18:22:43,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 18:22:43,235 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 18:22:43,236 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 18:22:43,236 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 18:22:43,236 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 18:22:43,236 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 18:22:43,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 18:22:43,237 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 18:22:43,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 18:22:43,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 18:22:43,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 18:22:43,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 18:22:43,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 18:22:43,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 18:22:43,238 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 18:22:43,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 18:22:43,238 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 18:22:43,238 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 18:22:43,238 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 18:22:43,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 18:22:43,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 18:22:43,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 18:22:43,239 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 18:22:43,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 18:22:43,239 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 18:22:43,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 18:22:43,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 18:22:43,240 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 18:22:43,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 18:22:43,240 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 18:22:43,240 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 18:22:43,240 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 18:22:43,240 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f [2023-02-15 18:22:43,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 18:22:43,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 18:22:43,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 18:22:43,389 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 18:22:43,389 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 18:22:43,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2023-02-15 18:22:44,320 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 18:22:44,499 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 18:22:44,499 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2023-02-15 18:22:44,504 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2e1f2bb/839a18e8584e48b38b952920038dda42/FLAG86b323021 [2023-02-15 18:22:44,518 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2e1f2bb/839a18e8584e48b38b952920038dda42 [2023-02-15 18:22:44,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 18:22:44,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 18:22:44,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 18:22:44,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 18:22:44,525 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 18:22:44,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@758b62fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44, skipping insertion in model container [2023-02-15 18:22:44,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 18:22:44,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 18:22:44,642 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2023-02-15 18:22:44,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 18:22:44,651 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 18:22:44,664 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2023-02-15 18:22:44,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 18:22:44,674 INFO L208 MainTranslator]: Completed translation [2023-02-15 18:22:44,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44 WrapperNode [2023-02-15 18:22:44,674 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 18:22:44,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 18:22:44,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 18:22:44,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 18:22:44,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,695 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2023-02-15 18:22:44,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 18:22:44,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 18:22:44,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 18:22:44,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 18:22:44,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,709 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 18:22:44,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 18:22:44,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 18:22:44,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 18:22:44,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (1/1) ... [2023-02-15 18:22:44,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 18:22:44,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:44,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 18:22:44,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 18:22:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 18:22:44,755 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-02-15 18:22:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-02-15 18:22:44,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 18:22:44,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 18:22:44,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 18:22:44,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 18:22:44,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 18:22:44,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 18:22:44,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 18:22:44,800 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 18:22:44,801 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 18:22:44,939 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 18:22:44,943 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 18:22:44,944 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 18:22:44,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 06:22:44 BoogieIcfgContainer [2023-02-15 18:22:44,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 18:22:44,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 18:22:44,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 18:22:44,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 18:22:44,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 06:22:44" (1/3) ... [2023-02-15 18:22:44,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423d482c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 06:22:44, skipping insertion in model container [2023-02-15 18:22:44,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 06:22:44" (2/3) ... [2023-02-15 18:22:44,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423d482c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 06:22:44, skipping insertion in model container [2023-02-15 18:22:44,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 06:22:44" (3/3) ... [2023-02-15 18:22:44,951 INFO L112 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2023-02-15 18:22:44,963 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 18:22:44,963 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 18:22:44,993 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 18:22:44,998 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5409393d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 18:22:44,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 18:22:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 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) [2023-02-15 18:22:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 18:22:45,006 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:45,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:45,007 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash -141219973, now seen corresponding path program 1 times [2023-02-15 18:22:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:45,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382753353] [2023-02-15 18:22:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-15 18:22:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-15 18:22:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-02-15 18:22:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 18:22:45,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:45,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382753353] [2023-02-15 18:22:45,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382753353] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:45,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50551639] [2023-02-15 18:22:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:45,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:45,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:45,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 18:22:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 18:22:45,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 18:22:45,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 18:22:45,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50551639] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 18:22:45,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 18:22:45,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-02-15 18:22:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096372698] [2023-02-15 18:22:45,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 18:22:45,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 18:22:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:22:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 18:22:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 18:22:45,385 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.4) internal successors, (28), 21 states have internal predecessors, (28), 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 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-15 18:22:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:22:45,404 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2023-02-15 18:22:45,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 18:22:45,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 [2023-02-15 18:22:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:22:45,409 INFO L225 Difference]: With dead ends: 50 [2023-02-15 18:22:45,411 INFO L226 Difference]: Without dead ends: 24 [2023-02-15 18:22:45,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 18:22:45,417 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:22:45,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:22:45,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-02-15 18:22:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-02-15 18:22:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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) [2023-02-15 18:22:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 18:22:45,439 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 28 [2023-02-15 18:22:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:22:45,440 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 18:22:45,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2023-02-15 18:22:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 18:22:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 18:22:45,441 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:45,441 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:45,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 18:22:45,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 18:22:45,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:45,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash -618478211, now seen corresponding path program 1 times [2023-02-15 18:22:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:45,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807311623] [2023-02-15 18:22:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:45,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 18:22:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 18:22:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-02-15 18:22:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 18:22:45,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:45,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807311623] [2023-02-15 18:22:45,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807311623] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:45,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169674199] [2023-02-15 18:22:45,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:45,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:45,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:45,800 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:45,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 18:22:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:45,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 18:22:45,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 18:22:45,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 18:22:45,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169674199] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 18:22:45,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 18:22:45,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-02-15 18:22:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771443050] [2023-02-15 18:22:45,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 18:22:45,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 18:22:45,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:22:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 18:22:45,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 18:22:45,878 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 18:22:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:22:45,886 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-02-15 18:22:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 18:22:45,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2023-02-15 18:22:45,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:22:45,887 INFO L225 Difference]: With dead ends: 42 [2023-02-15 18:22:45,887 INFO L226 Difference]: Without dead ends: 25 [2023-02-15 18:22:45,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 18:22:45,888 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:22:45,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 46 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:22:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-15 18:22:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2023-02-15 18:22:45,893 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) [2023-02-15 18:22:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-02-15 18:22:45,895 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 30 [2023-02-15 18:22:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:22:45,896 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-02-15 18:22:45,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 18:22:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-02-15 18:22:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 18:22:45,897 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:45,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:45,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 18:22:46,102 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,SelfDestructingSolverStorable1 [2023-02-15 18:22:46,103 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1511029509, now seen corresponding path program 1 times [2023-02-15 18:22:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058621069] [2023-02-15 18:22:46,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:46,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 18:22:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 18:22:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 18:22:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 18:22:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058621069] [2023-02-15 18:22:46,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058621069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842734940] [2023-02-15 18:22:46,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:46,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:46,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:46,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:46,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 18:22:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 18:22:46,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 18:22:46,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 18:22:46,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842734940] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 18:22:46,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 18:22:46,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-02-15 18:22:46,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350269129] [2023-02-15 18:22:46,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 18:22:46,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 18:22:46,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:22:46,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 18:22:46,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 18:22:46,293 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 18:22:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:22:46,306 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2023-02-15 18:22:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 18:22:46,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2023-02-15 18:22:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:22:46,308 INFO L225 Difference]: With dead ends: 39 [2023-02-15 18:22:46,309 INFO L226 Difference]: Without dead ends: 26 [2023-02-15 18:22:46,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 18:22:46,310 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:22:46,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:22:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-02-15 18:22:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2023-02-15 18:22:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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) [2023-02-15 18:22:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-02-15 18:22:46,320 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 36 [2023-02-15 18:22:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:22:46,321 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-02-15 18:22:46,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 18:22:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-02-15 18:22:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 18:22:46,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:46,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:46,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 18:22:46,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:46,529 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1553738215, now seen corresponding path program 1 times [2023-02-15 18:22:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:46,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974713963] [2023-02-15 18:22:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-02-15 18:22:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-02-15 18:22:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 18:22:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 18:22:46,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:46,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974713963] [2023-02-15 18:22:46,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974713963] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:46,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437905767] [2023-02-15 18:22:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:46,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:46,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:46,630 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:46,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 18:22:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:46,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 18:22:46,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-15 18:22:46,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:22:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-15 18:22:46,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437905767] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:22:46,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:22:46,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2023-02-15 18:22:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919288367] [2023-02-15 18:22:46,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:22:46,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 18:22:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:22:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 18:22:46,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 18:22:46,751 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 18:22:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:22:46,789 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2023-02-15 18:22:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 18:22:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2023-02-15 18:22:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:22:46,792 INFO L225 Difference]: With dead ends: 54 [2023-02-15 18:22:46,792 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 18:22:46,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 18:22:46,795 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:22:46,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:22:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 18:22:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-02-15 18:22:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 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) [2023-02-15 18:22:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-02-15 18:22:46,805 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2023-02-15 18:22:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:22:46,805 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-02-15 18:22:46,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-02-15 18:22:46,806 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-02-15 18:22:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 18:22:46,808 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:46,808 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:46,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 18:22:47,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:47,016 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:47,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:47,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1124150243, now seen corresponding path program 2 times [2023-02-15 18:22:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:47,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855986620] [2023-02-15 18:22:47,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:47,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-02-15 18:22:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-02-15 18:22:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-15 18:22:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-02-15 18:22:47,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:47,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855986620] [2023-02-15 18:22:47,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855986620] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880772088] [2023-02-15 18:22:47,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 18:22:47,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:47,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:47,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 18:22:47,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 18:22:47,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 18:22:47,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 18:22:47,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-15 18:22:47,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:22:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-02-15 18:22:47,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880772088] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:22:47,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:22:47,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2023-02-15 18:22:47,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136096768] [2023-02-15 18:22:47,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:22:47,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 18:22:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:22:47,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 18:22:47,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 18:22:47,242 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 18:22:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:22:47,264 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2023-02-15 18:22:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 18:22:47,265 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2023-02-15 18:22:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:22:47,265 INFO L225 Difference]: With dead ends: 60 [2023-02-15 18:22:47,265 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 18:22:47,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-15 18:22:47,266 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:22:47,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:22:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 18:22:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2023-02-15 18:22:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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) [2023-02-15 18:22:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2023-02-15 18:22:47,270 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 50 [2023-02-15 18:22:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:22:47,271 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2023-02-15 18:22:47,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 18:22:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2023-02-15 18:22:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 18:22:47,271 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:47,272 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:47,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 18:22:47,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:47,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash -402148163, now seen corresponding path program 3 times [2023-02-15 18:22:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:47,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008061141] [2023-02-15 18:22:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 18:22:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 18:22:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-02-15 18:22:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-15 18:22:47,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:47,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008061141] [2023-02-15 18:22:47,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008061141] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:47,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2890758] [2023-02-15 18:22:47,583 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 18:22:47,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:47,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:47,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 18:22:47,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 18:22:47,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 18:22:47,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 18:22:47,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-15 18:22:47,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:22:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-02-15 18:22:47,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2890758] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:22:47,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:22:47,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-15 18:22:47,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819318103] [2023-02-15 18:22:47,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:22:47,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 18:22:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:22:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 18:22:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 18:22:47,714 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 18:22:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:22:47,729 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2023-02-15 18:22:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 18:22:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2023-02-15 18:22:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:22:47,730 INFO L225 Difference]: With dead ends: 66 [2023-02-15 18:22:47,730 INFO L226 Difference]: Without dead ends: 43 [2023-02-15 18:22:47,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 18:22:47,731 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:22:47,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:22:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-02-15 18:22:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-02-15 18:22:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 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) [2023-02-15 18:22:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-02-15 18:22:47,735 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 54 [2023-02-15 18:22:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:22:47,735 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-02-15 18:22:47,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-15 18:22:47,736 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-02-15 18:22:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-02-15 18:22:47,746 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:47,746 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:47,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 18:22:47,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:47,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:47,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 354187703, now seen corresponding path program 4 times [2023-02-15 18:22:47,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:47,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973465065] [2023-02-15 18:22:47,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:48,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 18:22:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:48,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 18:22:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:48,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-15 18:22:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2023-02-15 18:22:48,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:48,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973465065] [2023-02-15 18:22:48,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973465065] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:48,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703904618] [2023-02-15 18:22:48,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 18:22:48,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:48,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:48,045 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:48,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 18:22:48,119 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 18:22:48,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 18:22:48,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 18:22:48,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 130 proven. 4 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-02-15 18:22:48,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:22:48,165 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2023-02-15 18:22:48,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703904618] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 18:22:48,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 18:22:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-15 18:22:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310041034] [2023-02-15 18:22:48,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 18:22:48,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 18:22:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:22:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 18:22:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 18:22:48,167 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 18:22:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:22:48,179 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2023-02-15 18:22:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 18:22:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 72 [2023-02-15 18:22:48,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:22:48,180 INFO L225 Difference]: With dead ends: 68 [2023-02-15 18:22:48,180 INFO L226 Difference]: Without dead ends: 47 [2023-02-15 18:22:48,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-15 18:22:48,181 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:22:48,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:22:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-15 18:22:48,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-02-15 18:22:48,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 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) [2023-02-15 18:22:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2023-02-15 18:22:48,184 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 72 [2023-02-15 18:22:48,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:22:48,185 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2023-02-15 18:22:48,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 18:22:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2023-02-15 18:22:48,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 18:22:48,185 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:22:48,185 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:22:48,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 18:22:48,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:48,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:22:48,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:22:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -783200653, now seen corresponding path program 5 times [2023-02-15 18:22:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:22:48,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366187925] [2023-02-15 18:22:48,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:22:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:22:48,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 18:22:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:55,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 18:22:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-02-15 18:22:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:22:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 2 proven. 290 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-02-15 18:22:57,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:22:57,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366187925] [2023-02-15 18:22:57,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366187925] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:22:57,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522831270] [2023-02-15 18:22:57,231 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 18:22:57,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:22:57,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:22:57,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:22:57,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 18:22:58,018 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2023-02-15 18:22:58,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 18:22:58,023 WARN L261 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 164 conjunts are in the unsatisfiable core [2023-02-15 18:22:58,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:22:58,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 18:22:59,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:22:59,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:22:59,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:22:59,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:22:59,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:22:59,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 543 treesize of output 194 [2023-02-15 18:23:00,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,247 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 18:23:00,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 18:23:00,253 INFO L321 Elim1Store]: treesize reduction 2, result has 33.3 percent of original size [2023-02-15 18:23:00,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 343 treesize of output 157 [2023-02-15 18:23:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,581 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 18:23:00,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,586 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 18:23:00,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,592 INFO L321 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2023-02-15 18:23:00,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 319 treesize of output 160 [2023-02-15 18:23:00,917 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 18:23:00,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 18:23:00,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:00,927 INFO L321 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2023-02-15 18:23:00,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 305 treesize of output 160 [2023-02-15 18:23:01,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,218 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:23:01,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 134 [2023-02-15 18:23:01,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 18:23:01,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:23:01,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 292 treesize of output 134 [2023-02-15 18:23:02,381 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 18:23:02,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 668 treesize of output 238 [2023-02-15 18:23:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 17 proven. 263 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-15 18:23:02,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 18:23:03,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522831270] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:23:03,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 18:23:03,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 48] total 75 [2023-02-15 18:23:03,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106255044] [2023-02-15 18:23:03,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 18:23:03,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-02-15 18:23:03,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:23:03,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-02-15 18:23:03,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=5610, Unknown=0, NotChecked=0, Total=5852 [2023-02-15 18:23:03,342 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 75 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 18:23:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:23:08,114 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2023-02-15 18:23:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 18:23:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 76 [2023-02-15 18:23:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:23:08,122 INFO L225 Difference]: With dead ends: 77 [2023-02-15 18:23:08,123 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 18:23:08,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 46 SyntacticMatches, 23 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2580 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=379, Invalid=8551, Unknown=0, NotChecked=0, Total=8930 [2023-02-15 18:23:08,126 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 2810 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-15 18:23:08,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 438 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2810 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-15 18:23:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 18:23:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2023-02-15 18:23:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 59 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2023-02-15 18:23:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2023-02-15 18:23:08,153 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 77 transitions. Word has length 76 [2023-02-15 18:23:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:23:08,153 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 77 transitions. [2023-02-15 18:23:08,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 70 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 18:23:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 77 transitions. [2023-02-15 18:23:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-15 18:23:08,155 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:23:08,155 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:23:08,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 18:23:08,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 18:23:08,362 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:23:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:23:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1690977777, now seen corresponding path program 6 times [2023-02-15 18:23:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:23:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319113097] [2023-02-15 18:23:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:23:08,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:23:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 18:23:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 18:23:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-02-15 18:23:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,454 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2023-02-15 18:23:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:23:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319113097] [2023-02-15 18:23:08,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319113097] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 18:23:08,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 18:23:08,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 18:23:08,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726074642] [2023-02-15 18:23:08,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 18:23:08,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 18:23:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:23:08,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 18:23:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 18:23:08,456 INFO L87 Difference]: Start difference. First operand 66 states and 77 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 18:23:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:23:08,474 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2023-02-15 18:23:08,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 18:23:08,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 78 [2023-02-15 18:23:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:23:08,476 INFO L225 Difference]: With dead ends: 89 [2023-02-15 18:23:08,476 INFO L226 Difference]: Without dead ends: 49 [2023-02-15 18:23:08,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 18:23:08,479 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:23:08,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 43 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:23:08,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-02-15 18:23:08,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-02-15 18:23:08,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 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) [2023-02-15 18:23:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2023-02-15 18:23:08,488 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 78 [2023-02-15 18:23:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:23:08,488 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2023-02-15 18:23:08,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 18:23:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2023-02-15 18:23:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-02-15 18:23:08,490 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 18:23:08,490 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 18:23:08,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 18:23:08,490 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 18:23:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 18:23:08,491 INFO L85 PathProgramCache]: Analyzing trace with hash 624132497, now seen corresponding path program 7 times [2023-02-15 18:23:08,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 18:23:08,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644915810] [2023-02-15 18:23:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 18:23:08,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 18:23:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 18:23:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-02-15 18:23:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-02-15 18:23:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,572 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2023-02-15 18:23:08,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 18:23:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644915810] [2023-02-15 18:23:08,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644915810] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 18:23:08,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963562806] [2023-02-15 18:23:08,572 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 18:23:08,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 18:23:08,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 18:23:08,573 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 18:23:08,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 18:23:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 18:23:08,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 18:23:08,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 18:23:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2023-02-15 18:23:08,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 18:23:08,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963562806] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 18:23:08,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 18:23:08,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2023-02-15 18:23:08,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772193807] [2023-02-15 18:23:08,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 18:23:08,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 18:23:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 18:23:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 18:23:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-02-15 18:23:08,669 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 18:23:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 18:23:08,684 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2023-02-15 18:23:08,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 18:23:08,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 78 [2023-02-15 18:23:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 18:23:08,684 INFO L225 Difference]: With dead ends: 64 [2023-02-15 18:23:08,685 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 18:23:08,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-02-15 18:23:08,686 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 18:23:08,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 18:23:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 18:23:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 18:23:08,687 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) [2023-02-15 18:23:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 18:23:08,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2023-02-15 18:23:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 18:23:08,688 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 18:23:08,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 18:23:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 18:23:08,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 18:23:08,690 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 18:23:08,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 18:23:08,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 18:23:08,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 18:23:09,330 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 18:23:09,330 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-02-15 18:23:09,330 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 26 53) the Hoare annotation is: true [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 34 36) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= |ULTIMATE.start_main_~i~1#1| 5)) [2023-02-15 18:23:09,331 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (and (= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= |ULTIMATE.start_main_~i~1#1| 5)) [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse11 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse2 (select .cse11 (+ |ULTIMATE.start_main_~#x~0#1.offset| 4))) (.cse3 (select .cse11 0)) (.cse4 (select .cse11 (+ |ULTIMATE.start_main_~#x~0#1.offset| 8))) (.cse5 (select .cse11 (+ |ULTIMATE.start_main_~#x~0#1.offset| 12)))) (and (let ((.cse0 (+ .cse2 .cse3 |ULTIMATE.start_main_~temp~0#1| .cse4 .cse5))) (let ((.cse1 (* 4294967296 (div .cse0 4294967296)))) (or (= .cse0 (+ .cse1 |ULTIMATE.start_main_~ret~1#1|)) (= .cse0 (+ .cse1 |ULTIMATE.start_main_~ret~1#1| 4294967296))))) (let ((.cse10 (select .cse11 (+ |ULTIMATE.start_main_~#x~0#1.offset| 16)))) (let ((.cse7 (+ .cse2 .cse10 .cse3 .cse4 .cse5))) (let ((.cse8 (div .cse7 4294967296))) (let ((.cse9 (* 4294967296 .cse8)) (.cse6 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|))) (or (and .cse6 (<= .cse7 (+ (* .cse8 4294967296) 2147483647)) (= .cse7 (+ .cse9 |ULTIMATE.start_main_~ret~1#1|))) (and (= .cse7 (+ .cse9 |ULTIMATE.start_main_~ret~1#1| 4294967296)) .cse6 (<= .cse7 (+ (* (div (+ .cse2 .cse10 .cse3 .cse4 .cse5 (- 2147483648)) 4294967296) 4294967296) 4294967295)))))))) (<= |ULTIMATE.start_main_~i~1#1| 5) (= |ULTIMATE.start_main_~#x~0#1.offset| 0)))) [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L49-2(lines 49 51) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (let ((.cse5 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse0 (select .cse5 (+ |ULTIMATE.start_main_~#x~0#1.offset| 4))) (.cse1 (select .cse5 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse2 (select .cse5 (+ |ULTIMATE.start_main_~#x~0#1.offset| 16))) (.cse3 (select .cse5 (+ |ULTIMATE.start_main_~#x~0#1.offset| 8))) (.cse4 (select .cse5 (+ |ULTIMATE.start_main_~#x~0#1.offset| 12)))) (= (+ .cse0 .cse1 .cse2 .cse3 .cse4) (+ |ULTIMATE.start_main_~ret~1#1| (* 4294967296 (div (+ .cse0 .cse1 .cse2 .cse3 .cse4 (- 2147483648)) 4294967296)) 4294967296)))) (<= |ULTIMATE.start_main_~i~1#1| 5) (= |ULTIMATE.start_main_~#x~0#1.offset| 0)) [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 43 45) no Hoare annotation was computed. [2023-02-15 18:23:09,331 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2023-02-15 18:23:09,332 INFO L895 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse18 (* |ULTIMATE.start_main_~i~2#1| 4)) (.cse17 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse1 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (.cse4 (select .cse17 (+ |ULTIMATE.start_main_~#x~0#1.offset| 4))) (.cse5 (select .cse17 (+ |ULTIMATE.start_main_~#x~0#1.offset| 16))) (.cse6 (select .cse17 (+ |ULTIMATE.start_main_~#x~0#1.offset| 8))) (.cse7 (select .cse17 (+ |ULTIMATE.start_main_~#x~0#1.offset| 12))) (.cse12 (select .cse17 (+ |ULTIMATE.start_main_~#x~0#1.offset| .cse18))) (.cse0 (select .cse17 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse8 (<= |ULTIMATE.start_main_~i~1#1| 5)) (.cse9 (= |ULTIMATE.start_main_~#x~0#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~temp~0#1| .cse0) (let ((.cse2 (+ .cse4 .cse0 .cse5 .cse6 .cse7))) (let ((.cse3 (* 4294967296 (div .cse2 4294967296)))) (or (and .cse1 (= .cse2 (+ |ULTIMATE.start_main_~ret~1#1| .cse3)) (<= .cse2 (+ .cse3 2147483647))) (and .cse1 (= .cse2 (+ |ULTIMATE.start_main_~ret~1#1| .cse3 4294967296)) (<= .cse2 (+ (* 4294967296 (div (+ .cse4 .cse0 .cse5 .cse6 .cse7 (- 2147483648)) 4294967296)) 4294967295)))))) .cse8 .cse9 (= |ULTIMATE.start_main_~i~2#1| 0)) (and (= .cse5 .cse7) (let ((.cse10 (+ .cse0 .cse4 |ULTIMATE.start_main_~temp~0#1| .cse6 .cse7))) (let ((.cse11 (* 4294967296 (div .cse10 4294967296)))) (or (and .cse1 (<= .cse10 (+ (* 4294967296 (div (+ .cse0 .cse4 |ULTIMATE.start_main_~temp~0#1| .cse6 .cse7 (- 2147483648)) 4294967296)) 4294967295)) (= .cse10 (+ |ULTIMATE.start_main_~ret~1#1| .cse11 4294967296))) (and .cse1 (<= .cse10 (+ .cse11 2147483647)) (= .cse10 (+ |ULTIMATE.start_main_~ret~1#1| .cse11)))))) .cse8 .cse9 (<= 4 |ULTIMATE.start_main_~i~2#1|)) (and (= |ULTIMATE.start_main_~i~2#1| 2) (= .cse12 .cse4) .cse8 .cse9 (let ((.cse13 (+ .cse0 .cse5 |ULTIMATE.start_main_~temp~0#1| .cse6 .cse7))) (let ((.cse14 (* 4294967296 (div .cse13 4294967296)))) (or (and .cse1 (= .cse13 (+ .cse14 |ULTIMATE.start_main_~ret~1#1| 4294967296)) (<= .cse13 (+ (* 4294967296 (div (+ .cse0 .cse5 |ULTIMATE.start_main_~temp~0#1| .cse6 .cse7 (- 2147483648)) 4294967296)) 4294967295))) (and .cse1 (= .cse13 (+ .cse14 |ULTIMATE.start_main_~ret~1#1|)) (<= .cse13 (+ .cse14 2147483647))))))) (and (let ((.cse15 (+ .cse0 .cse4 .cse5 |ULTIMATE.start_main_~temp~0#1| .cse7))) (let ((.cse16 (* 4294967296 (div .cse15 4294967296)))) (or (and .cse1 (= .cse15 (+ |ULTIMATE.start_main_~ret~1#1| .cse16 4294967296)) (<= .cse15 (+ (* 4294967296 (div (+ .cse0 .cse4 .cse5 |ULTIMATE.start_main_~temp~0#1| .cse7 (- 2147483648)) 4294967296)) 4294967295))) (and (<= .cse15 (+ .cse16 2147483647)) .cse1 (= .cse15 (+ |ULTIMATE.start_main_~ret~1#1| .cse16)))))) .cse8 .cse9 (= .cse12 (select .cse17 (+ |ULTIMATE.start_main_~#x~0#1.offset| .cse18 (- 4)))) (= |ULTIMATE.start_main_~i~2#1| 3)) (and (let ((.cse19 (+ .cse4 .cse5 |ULTIMATE.start_main_~temp~0#1| .cse6 .cse7))) (let ((.cse20 (* 4294967296 (div .cse19 4294967296)))) (or (and .cse1 (= .cse19 (+ .cse20 |ULTIMATE.start_main_~ret~1#1| 4294967296)) (<= .cse19 (+ (* 4294967296 (div (+ .cse4 .cse5 |ULTIMATE.start_main_~temp~0#1| .cse6 .cse7 (- 2147483648)) 4294967296)) 4294967295))) (and .cse1 (<= .cse19 (+ .cse20 2147483647)) (= .cse19 (+ .cse20 |ULTIMATE.start_main_~ret~1#1|)))))) (= |ULTIMATE.start_main_~i~2#1| 1) (= .cse12 .cse0) .cse8 .cse9)))) [2023-02-15 18:23:09,332 INFO L899 garLoopResultBuilder]: For program point L43-4(lines 43 45) no Hoare annotation was computed. [2023-02-15 18:23:09,332 INFO L899 garLoopResultBuilder]: For program point sumEXIT(lines 15 24) no Hoare annotation was computed. [2023-02-15 18:23:09,332 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2023-02-15 18:23:09,332 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse3 (select |#memory_int| sum_~x.base))) (let ((.cse1 (= |sum_#in~x.base| sum_~x.base)) (.cse2 (= |sum_#in~x.offset| sum_~x.offset)) (.cse4 (select .cse3 (+ sum_~x.offset 8))) (.cse5 (select .cse3 (+ sum_~x.offset 4))) (.cse6 (select .cse3 |sum_#in~x.offset|))) (or (let ((.cse0 (+ (select .cse3 (+ sum_~x.offset 12)) .cse4 .cse5 .cse6))) (and (<= sum_~ret~0 .cse0) (<= 4 sum_~i~0) (<= .cse0 sum_~ret~0) .cse1 (<= sum_~i~0 4) .cse2)) (and (<= sum_~ret~0 .cse6) (<= .cse6 sum_~ret~0) (<= 1 sum_~i~0) .cse1 .cse2 (<= sum_~i~0 1)) (let ((.cse7 (+ .cse5 .cse6))) (and (<= sum_~i~0 2) (<= .cse7 sum_~ret~0) (<= sum_~ret~0 .cse7) (<= 2 sum_~i~0) .cse1 .cse2)) (and (<= 0 sum_~ret~0) (<= 0 sum_~i~0) (<= sum_~i~0 0) .cse1 (<= sum_~ret~0 0) .cse2) (let ((.cse8 (+ .cse4 .cse5 .cse6))) (and (<= 3 sum_~i~0) (<= .cse8 sum_~ret~0) .cse1 .cse2 (<= sum_~i~0 3) (<= sum_~ret~0 .cse8))) (and (<= 5 sum_~i~0) (exists ((v_sum_~i~0_81 Int)) (let ((.cse9 (let ((.cse10 (select |#memory_int| |sum_#in~x.base|)) (.cse11 (* v_sum_~i~0_81 4))) (+ (select .cse10 (+ .cse11 |sum_#in~x.offset| (- 4))) (select .cse10 (+ .cse11 |sum_#in~x.offset| (- 12))) (select .cse10 (+ .cse11 |sum_#in~x.offset| (- 8))) (select .cse10 |sum_#in~x.offset|) (select .cse10 (+ .cse11 |sum_#in~x.offset|)))))) (and (<= sum_~i~0 (+ v_sum_~i~0_81 1)) (<= sum_~ret~0 .cse9) (< v_sum_~i~0_81 5) (<= .cse9 sum_~ret~0)))))))) [2023-02-15 18:23:09,332 INFO L899 garLoopResultBuilder]: For program point L20-4(lines 20 22) no Hoare annotation was computed. [2023-02-15 18:23:09,332 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 24) the Hoare annotation is: true [2023-02-15 18:23:09,332 INFO L899 garLoopResultBuilder]: For program point sumFINAL(lines 15 24) no Hoare annotation was computed. [2023-02-15 18:23:09,334 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2023-02-15 18:23:09,335 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 18:23:09,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,366 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 06:23:09 BoogieIcfgContainer [2023-02-15 18:23:09,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 18:23:09,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 18:23:09,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 18:23:09,389 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 18:23:09,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 06:22:44" (3/4) ... [2023-02-15 18:23:09,391 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 18:23:09,395 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2023-02-15 18:23:09,399 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-02-15 18:23:09,399 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-02-15 18:23:09,399 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 18:23:09,399 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 18:23:09,416 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] && 4 <= i) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && x == x) && i <= 4) && x == x) || (((((ret <= unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x] <= ret) && 1 <= i) && x == x) && x == x) && i <= 1)) || (((((i <= 2 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) && 2 <= i) && x == x) && x == x)) || (((((0 <= ret && 0 <= i) && i <= 0) && x == x) && ret <= 0) && x == x)) || (((((3 <= i && unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && x == x) && x == x) && i <= 3) && ret <= unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x])) || (5 <= i && (\exists v_sum_~i~0_81 : int :: ((i <= v_sum_~i~0_81 + 1 && ret <= unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -4] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -12] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x]) && v_sum_~i~0_81 < 5) && unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -4] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -12] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x] <= ret)) [2023-02-15 18:23:09,429 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 18:23:09,429 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 18:23:09,429 INFO L158 Benchmark]: Toolchain (without parser) took 24908.13ms. Allocated memory was 146.8MB in the beginning and 606.1MB in the end (delta: 459.3MB). Free memory was 110.4MB in the beginning and 376.6MB in the end (delta: -266.2MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. [2023-02-15 18:23:09,429 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory was 81.5MB in the beginning and 81.5MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 18:23:09,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.44ms. Allocated memory is still 146.8MB. Free memory was 110.4MB in the beginning and 99.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 18:23:09,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.40ms. Allocated memory is still 146.8MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 18:23:09,430 INFO L158 Benchmark]: Boogie Preprocessor took 14.62ms. Allocated memory is still 146.8MB. Free memory was 97.8MB in the beginning and 97.1MB in the end (delta: 685.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 18:23:09,431 INFO L158 Benchmark]: RCFGBuilder took 235.12ms. Allocated memory is still 146.8MB. Free memory was 96.5MB in the beginning and 85.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 18:23:09,431 INFO L158 Benchmark]: TraceAbstraction took 24440.67ms. Allocated memory was 146.8MB in the beginning and 606.1MB in the end (delta: 459.3MB). Free memory was 84.5MB in the beginning and 379.7MB in the end (delta: -295.2MB). Peak memory consumption was 164.7MB. Max. memory is 16.1GB. [2023-02-15 18:23:09,432 INFO L158 Benchmark]: Witness Printer took 40.48ms. Allocated memory is still 606.1MB. Free memory was 379.7MB in the beginning and 376.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 18:23:09,435 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.12ms. Allocated memory is still 113.2MB. Free memory was 81.5MB in the beginning and 81.5MB in the end (delta: 18.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 151.44ms. Allocated memory is still 146.8MB. Free memory was 110.4MB in the beginning and 99.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.40ms. Allocated memory is still 146.8MB. Free memory was 99.9MB in the beginning and 97.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.62ms. Allocated memory is still 146.8MB. Free memory was 97.8MB in the beginning and 97.1MB in the end (delta: 685.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 235.12ms. Allocated memory is still 146.8MB. Free memory was 96.5MB in the beginning and 85.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24440.67ms. Allocated memory was 146.8MB in the beginning and 606.1MB in the end (delta: 459.3MB). Free memory was 84.5MB in the beginning and 379.7MB in the end (delta: -295.2MB). Peak memory consumption was 164.7MB. Max. memory is 16.1GB. * Witness Printer took 40.48ms. Allocated memory is still 606.1MB. Free memory was 379.7MB in the beginning and 376.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] * 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: 24.4s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 1024 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2966 IncrementalHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 223 mSDtfsCounter, 2966 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 857 GetRequests, 686 SyntacticMatches, 31 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=8, InterpolantAutomatonStates: 90, 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, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 48 PreInvPairs, 80 NumberOfFragments, 2376 HoareAnnotationTreeSize, 48 FomulaSimplifications, 51 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 544 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1002 NumberOfCodeBlocks, 981 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1193 ConstructedInterpolants, 1 QuantifiedInterpolants, 18862 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 193 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 2555/3239 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: 26]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,450 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,452 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,452 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,453 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,453 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,453 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,453 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,453 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,453 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,453 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,454 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,454 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] [2023-02-15 18:23:09,454 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_sum_~i~0_81,QUANTIFIED] Derived loop invariant: (((((((((ret <= unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] && 4 <= i) && unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && x == x) && i <= 4) && x == x) || (((((ret <= unknown-#memory_int-unknown[x][x] && unknown-#memory_int-unknown[x][x] <= ret) && 1 <= i) && x == x) && x == x) && i <= 1)) || (((((i <= 2 && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && ret <= unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) && 2 <= i) && x == x) && x == x)) || (((((0 <= ret && 0 <= i) && i <= 0) && x == x) && ret <= 0) && x == x)) || (((((3 <= i && unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] <= ret) && x == x) && x == x) && i <= 3) && ret <= unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x])) || (5 <= i && (\exists v_sum_~i~0_81 : int :: ((i <= v_sum_~i~0_81 + 1 && ret <= unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -4] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -12] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x]) && v_sum_~i~0_81 < 5) && unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -4] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -12] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x + -8] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][v_sum_~i~0_81 * 4 + x] <= ret)) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((((temp == unknown-#memory_int-unknown[x][x] && (((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296)) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647) || ((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 4294967296) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + -2147483648) / 4294967296) + 4294967295))) && i <= 5) && x == 0) && i == 0) || ((((unknown-#memory_int-unknown[x][x + 16] == unknown-#memory_int-unknown[x][x + 12] && (((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + -2147483648) / 4294967296) + 4294967295) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 4294967296) || ((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296)))) && i <= 5) && x == 0) && 4 <= i)) || ((((i == 2 && unknown-#memory_int-unknown[x][x + i * 4] == unknown-#memory_int-unknown[x][x + 4]) && i <= 5) && x == 0) && (((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret + 4294967296) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + -2147483648) / 4294967296) + 4294967295) || ((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647)))) || (((((((ret2 == ret && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 4294967296) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] + -2147483648) / 4294967296) + 4294967295) || ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647 && ret2 == ret) && unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12] == ret + 4294967296 * ((unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 12]) / 4294967296))) && i <= 5) && x == 0) && unknown-#memory_int-unknown[x][x + i * 4] == unknown-#memory_int-unknown[x][x + i * 4 + -4]) && i == 3)) || (((((((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret + 4294967296) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] + -2147483648) / 4294967296) + 4294967295) || ((ret2 == ret && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] <= 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + 2147483647) && unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12] == 4294967296 * ((unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 16] + temp + unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 12]) / 4294967296) + ret)) && i == 1) && unknown-#memory_int-unknown[x][x + i * 4] == unknown-#memory_int-unknown[x][x]) && i <= 5) && x == 0) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 == x && i <= 5 RESULT: Ultimate proved your program to be correct! [2023-02-15 18:23:09,475 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