/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/id_trans.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:38:04,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:38:04,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:38:04,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:38:04,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:38:04,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:38:04,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:38:04,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:38:04,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:38:04,220 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:38:04,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:38:04,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:38:04,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:38:04,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:38:04,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:38:04,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:38:04,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:38:04,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:38:04,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:38:04,232 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:38:04,233 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:38:04,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:38:04,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:38:04,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:38:04,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:38:04,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:38:04,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:38:04,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:38:04,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:38:04,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:38:04,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:38:04,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:38:04,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:38:04,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:38:04,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:38:04,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:38:04,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:38:04,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:38:04,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:38:04,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:38:04,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:38:04,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:38:04,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:38:04,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:38:04,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:38:04,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:38:04,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:38:04,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:38:04,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:38:04,270 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:38:04,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:38:04,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:38:04,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:38:04,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:38:04,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:38:04,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:38:04,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:38:04,271 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:38:04,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:38:04,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:38:04,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:38:04,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:38:04,273 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:38:04,273 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:38:04,274 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:38:04,274 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 21:38:04,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:38:04,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:38:04,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:38:04,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:38:04,487 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:38:04,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/id_trans.i [2022-04-27 21:38:04,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be68b15f7/ea486f37390446bc81c35c06fb4615dc/FLAGcca12bb20 [2022-04-27 21:38:04,922 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:38:04,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans.i [2022-04-27 21:38:04,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be68b15f7/ea486f37390446bc81c35c06fb4615dc/FLAGcca12bb20 [2022-04-27 21:38:04,939 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be68b15f7/ea486f37390446bc81c35c06fb4615dc [2022-04-27 21:38:04,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:38:04,942 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:38:04,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:38:04,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:38:04,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:38:04,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:38:04" (1/1) ... [2022-04-27 21:38:04,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11e990c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:04, skipping insertion in model container [2022-04-27 21:38:04,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:38:04" (1/1) ... [2022-04-27 21:38:04,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:38:04,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:38:05,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans.i[893,906] [2022-04-27 21:38:05,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:38:05,155 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:38:05,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/id_trans.i[893,906] [2022-04-27 21:38:05,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:38:05,186 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:38:05,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05 WrapperNode [2022-04-27 21:38:05,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:38:05,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:38:05,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:38:05,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:38:05,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,202 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:38:05,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:38:05,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:38:05,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:38:05,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:38:05,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:38:05,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:38:05,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:38:05,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:38:05,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:38:05,298 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:38:05,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:38:05,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:38:05,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:38:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:38:05,299 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:38:05,300 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:38:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:38:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:38:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:38:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:38:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:38:05,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:38:05,359 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:38:05,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:38:05,554 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:38:05,561 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:38:05,561 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:38:05,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:38:05 BoogieIcfgContainer [2022-04-27 21:38:05,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:38:05,563 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:38:05,563 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:38:05,564 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:38:05,566 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:38:05" (1/1) ... [2022-04-27 21:38:05,568 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:38:05,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:38:05 BasicIcfg [2022-04-27 21:38:05,607 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:38:05,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:38:05,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:38:05,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:38:05,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:38:04" (1/4) ... [2022-04-27 21:38:05,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46faa8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:38:05, skipping insertion in model container [2022-04-27 21:38:05,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:38:05" (2/4) ... [2022-04-27 21:38:05,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46faa8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:38:05, skipping insertion in model container [2022-04-27 21:38:05,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:38:05" (3/4) ... [2022-04-27 21:38:05,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46faa8d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:38:05, skipping insertion in model container [2022-04-27 21:38:05,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:38:05" (4/4) ... [2022-04-27 21:38:05,613 INFO L111 eAbstractionObserver]: Analyzing ICFG id_trans.iqvasr [2022-04-27 21:38:05,622 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:38:05,623 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:38:05,662 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:38:05,668 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69159f21, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@742e0230 [2022-04-27 21:38:05,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:38:05,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 21:38:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 21:38:05,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:05,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:05,678 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:05,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1124237314, now seen corresponding path program 1 times [2022-04-27 21:38:05,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:05,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899261558] [2022-04-27 21:38:05,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:05,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:05,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-27 21:38:05,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:38:05,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:38:05,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:05,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {27#true} is VALID [2022-04-27 21:38:05,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:38:05,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:38:05,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#true} is VALID [2022-04-27 21:38:05,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} [71] mainENTRY-->L30: Formula: (and (= |v_main_#t~nondet2_2| v_main_~idBitLength~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (= |v_main_#t~nondet3_2| v_main_~material_length~0_1) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~nlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~idBitLength~0=v_main_~idBitLength~0_1, main_~material_length~0=v_main_~material_length~0_1, main_~nlen~0=v_main_~nlen~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~idBitLength~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~material_length~0, main_~nlen~0] {27#true} is VALID [2022-04-27 21:38:05,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} [74] L30-->L31-2: Formula: (and (= (let ((.cse0 (div v_main_~idBitLength~0_5 32))) (ite (and (< v_main_~idBitLength~0_5 0) (not (= (mod v_main_~idBitLength~0_5 32) 0))) (+ .cse0 1) .cse0)) v_main_~nlen~0_5) (= v_main_~j~0_4 0)) InVars {main_~nlen~0=v_main_~nlen~0_5, main_~idBitLength~0=v_main_~idBitLength~0_5} OutVars{main_~idBitLength~0=v_main_~idBitLength~0_5, main_~nlen~0=v_main_~nlen~0_5, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {32#(<= 0 main_~j~0)} is VALID [2022-04-27 21:38:05,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(<= 0 main_~j~0)} [78] L31-2-->L32: Formula: (and (< v_main_~j~0_6 (let ((.cse0 (div v_main_~idBitLength~0_7 8))) (ite (and (not (= (mod v_main_~idBitLength~0_7 8) 0)) (< v_main_~idBitLength~0_7 0)) (+ .cse0 1) .cse0))) (< v_main_~j~0_6 v_main_~material_length~0_5)) InVars {main_~idBitLength~0=v_main_~idBitLength~0_7, main_~material_length~0=v_main_~material_length~0_5, main_~j~0=v_main_~j~0_6} OutVars{main_~idBitLength~0=v_main_~idBitLength~0_7, main_~material_length~0=v_main_~material_length~0_5, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {32#(<= 0 main_~j~0)} is VALID [2022-04-27 21:38:05,870 INFO L272 TraceCheckUtils]: 8: Hoare triple {32#(<= 0 main_~j~0)} [80] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~j~0_11) 1 0)) InVars {main_~j~0=v_main_~j~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:05,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:05,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} [84] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:38:05,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} [87] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#false} is VALID [2022-04-27 21:38:05,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:38:05,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:05,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899261558] [2022-04-27 21:38:05,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899261558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:38:05,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:38:05,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:38:05,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45117866] [2022-04-27 21:38:05,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:38:05,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:38:05,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:05,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:38:05,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:05,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:38:05,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:05,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:38:05,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:38:05,928 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:38:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:06,247 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 21:38:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:38:06,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 21:38:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:06,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:38:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-27 21:38:06,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:38:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-27 21:38:06,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-27 21:38:06,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:06,322 INFO L225 Difference]: With dead ends: 47 [2022-04-27 21:38:06,322 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 21:38:06,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:38:06,328 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:06,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 42 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:38:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 21:38:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 21:38:06,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:06,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,357 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,358 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:06,365 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 21:38:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 21:38:06,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:06,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:06,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-04-27 21:38:06,366 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 23 states. [2022-04-27 21:38:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:06,375 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 21:38:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 21:38:06,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:06,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:06,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:06,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-27 21:38:06,386 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2022-04-27 21:38:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:06,387 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-27 21:38:06,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:38:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 21:38:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:38:06,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:06,388 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:06,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:38:06,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:06,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:06,389 INFO L85 PathProgramCache]: Analyzing trace with hash -74729474, now seen corresponding path program 1 times [2022-04-27 21:38:06,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:06,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007604376] [2022-04-27 21:38:06,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:06,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:38:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:06,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {190#true} is VALID [2022-04-27 21:38:06,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,481 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-27 21:38:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:38:06,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {190#true} [82] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {190#true} is VALID [2022-04-27 21:38:06,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {190#true} [85] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} [89] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {195#(not (<= main_~material_length~0 main_~j~0))} [93] __VERIFIER_assertEXIT-->L32-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~j~0_11) 1 0)) InVars {main_~j~0=v_main_~j~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {195#(not (<= main_~material_length~0 main_~j~0))} is VALID [2022-04-27 21:38:06,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {190#true} [67] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:38:06,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [69] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {190#true} is VALID [2022-04-27 21:38:06,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {190#true} [72] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190#true} {190#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {190#true} [68] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#true} [71] mainENTRY-->L30: Formula: (and (= |v_main_#t~nondet2_2| v_main_~idBitLength~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (= |v_main_#t~nondet3_2| v_main_~material_length~0_1) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet1_2| v_main_~nlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~idBitLength~0=v_main_~idBitLength~0_1, main_~material_length~0=v_main_~material_length~0_1, main_~nlen~0=v_main_~nlen~0_1, main_~k~0=v_main_~k~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~idBitLength~0, main_#t~nondet1, main_~k~0, main_#t~nondet3, main_~j~0, main_#t~nondet2, main_~material_length~0, main_~nlen~0] {190#true} is VALID [2022-04-27 21:38:06,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#true} [74] L30-->L31-2: Formula: (and (= (let ((.cse0 (div v_main_~idBitLength~0_5 32))) (ite (and (< v_main_~idBitLength~0_5 0) (not (= (mod v_main_~idBitLength~0_5 32) 0))) (+ .cse0 1) .cse0)) v_main_~nlen~0_5) (= v_main_~j~0_4 0)) InVars {main_~nlen~0=v_main_~nlen~0_5, main_~idBitLength~0=v_main_~idBitLength~0_5} OutVars{main_~idBitLength~0=v_main_~idBitLength~0_5, main_~nlen~0=v_main_~nlen~0_5, main_~j~0=v_main_~j~0_4} AuxVars[] AssignedVars[main_~j~0] {190#true} is VALID [2022-04-27 21:38:06,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#true} [78] L31-2-->L32: Formula: (and (< v_main_~j~0_6 (let ((.cse0 (div v_main_~idBitLength~0_7 8))) (ite (and (not (= (mod v_main_~idBitLength~0_7 8) 0)) (< v_main_~idBitLength~0_7 0)) (+ .cse0 1) .cse0))) (< v_main_~j~0_6 v_main_~material_length~0_5)) InVars {main_~idBitLength~0=v_main_~idBitLength~0_7, main_~material_length~0=v_main_~material_length~0_5, main_~j~0=v_main_~j~0_6} OutVars{main_~idBitLength~0=v_main_~idBitLength~0_7, main_~material_length~0=v_main_~material_length~0_5, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[] {195#(not (<= main_~material_length~0 main_~j~0))} is VALID [2022-04-27 21:38:06,498 INFO L272 TraceCheckUtils]: 8: Hoare triple {195#(not (<= main_~material_length~0 main_~j~0))} [80] L32-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~j~0_11) 1 0)) InVars {main_~j~0=v_main_~j~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {190#true} is VALID [2022-04-27 21:38:06,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#true} [82] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {190#true} is VALID [2022-04-27 21:38:06,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#true} [85] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#true} [89] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {190#true} is VALID [2022-04-27 21:38:06,500 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {190#true} {195#(not (<= main_~material_length~0 main_~j~0))} [93] __VERIFIER_assertEXIT-->L32-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (<= 0 v_main_~j~0_11) 1 0)) InVars {main_~j~0=v_main_~j~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {195#(not (<= main_~material_length~0 main_~j~0))} is VALID [2022-04-27 21:38:06,500 INFO L272 TraceCheckUtils]: 13: Hoare triple {195#(not (<= main_~material_length~0 main_~j~0))} [81] L32-1-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_12 v_main_~material_length~0_7) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~material_length~0=v_main_~material_length~0_7, main_~j~0=v_main_~j~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~material_length~0] {200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:38:06,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {200#(not (= |__VERIFIER_assert_#in~cond| 0))} [82] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {201#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:38:06,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {201#(not (= __VERIFIER_assert_~cond 0))} [84] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {191#false} is VALID [2022-04-27 21:38:06,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {191#false} [87] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {191#false} is VALID [2022-04-27 21:38:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:38:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:38:06,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007604376] [2022-04-27 21:38:06,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007604376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:38:06,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:38:06,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 21:38:06,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828308727] [2022-04-27 21:38:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:38:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 21:38:06,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:38:06,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:06,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:06,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 21:38:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:38:06,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 21:38:06,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 21:38:06,522 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:06,729 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-27 21:38:06,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:38:06,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 21:38:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:38:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-27 21:38:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2022-04-27 21:38:06,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 27 transitions. [2022-04-27 21:38:06,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:38:06,762 INFO L225 Difference]: With dead ends: 29 [2022-04-27 21:38:06,762 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 21:38:06,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 21:38:06,763 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:38:06,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:38:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 21:38:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 21:38:06,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:38:06,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,772 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,772 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:06,774 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 21:38:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 21:38:06,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:06,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:06,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 21:38:06,775 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-27 21:38:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:38:06,776 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-04-27 21:38:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 21:38:06,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:38:06,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:38:06,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:38:06,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:38:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:38:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-27 21:38:06,778 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2022-04-27 21:38:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:38:06,779 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-27 21:38:06,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:38:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-27 21:38:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 21:38:06,780 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:38:06,780 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:38:06,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:38:06,780 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:38:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:38:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash -353153412, now seen corresponding path program 1 times [2022-04-27 21:38:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:38:06,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891402312] [2022-04-27 21:38:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:38:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:38:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 21:38:06,823 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 21:38:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 21:38:06,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 21:38:06,852 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 21:38:06,852 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:38:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 21:38:06,856 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 21:38:06,858 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-27 21:38:06,873 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:38:06,874 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:38:06,875 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-04-27 21:38:06,875 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-27 21:38:06,875 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 21:38:06,875 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:38:06,875 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:38:06,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:38:06 BasicIcfg [2022-04-27 21:38:06,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:38:06,876 INFO L158 Benchmark]: Toolchain (without parser) took 1934.25ms. Allocated memory was 204.5MB in the beginning and 272.6MB in the end (delta: 68.2MB). Free memory was 154.3MB in the beginning and 196.0MB in the end (delta: -41.6MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2022-04-27 21:38:06,877 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 204.5MB. Free memory was 170.7MB in the beginning and 170.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:38:06,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.53ms. Allocated memory is still 204.5MB. Free memory was 154.2MB in the beginning and 180.5MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 21:38:06,877 INFO L158 Benchmark]: Boogie Preprocessor took 35.95ms. Allocated memory is still 204.5MB. Free memory was 180.5MB in the beginning and 179.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:38:06,878 INFO L158 Benchmark]: RCFGBuilder took 336.67ms. Allocated memory is still 204.5MB. Free memory was 179.0MB in the beginning and 166.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:38:06,878 INFO L158 Benchmark]: IcfgTransformer took 44.00ms. Allocated memory is still 204.5MB. Free memory was 166.4MB in the beginning and 164.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:38:06,878 INFO L158 Benchmark]: TraceAbstraction took 1266.57ms. Allocated memory was 204.5MB in the beginning and 272.6MB in the end (delta: 68.2MB). Free memory was 164.1MB in the beginning and 196.0MB in the end (delta: -31.8MB). Peak memory consumption was 37.9MB. Max. memory is 8.0GB. [2022-04-27 21:38:06,886 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 204.5MB. Free memory was 170.7MB in the beginning and 170.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.53ms. Allocated memory is still 204.5MB. Free memory was 154.2MB in the beginning and 180.5MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.95ms. Allocated memory is still 204.5MB. Free memory was 180.5MB in the beginning and 179.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 336.67ms. Allocated memory is still 204.5MB. Free memory was 179.0MB in the beginning and 166.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 44.00ms. Allocated memory is still 204.5MB. Free memory was 166.4MB in the beginning and 164.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1266.57ms. Allocated memory was 204.5MB in the beginning and 272.6MB in the end (delta: 68.2MB). Free memory was 164.1MB in the beginning and 196.0MB in the end (delta: -31.8MB). Peak memory consumption was 37.9MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int idBitLength, material_length, nlen; [L26] int j, k; [L27] nlen = __VERIFIER_nondet_int() [L28] idBitLength = __VERIFIER_nondet_int() [L29] material_length = __VERIFIER_nondet_int() [L30] COND FALSE !(!( nlen == idBitLength / 32 )) [L31] j = 0 VAL [idBitLength=9, j=0, material_length=1, nlen=0] [L31] COND TRUE (j < idBitLength / 8) && (j < material_length) VAL [idBitLength=9, j=0, material_length=1, nlen=0] [L32] CALL __VERIFIER_assert( 0 <= j) VAL [\old(cond)=1] [L18] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L32] RET __VERIFIER_assert( 0 <= j) VAL [idBitLength=9, j=0, material_length=1, nlen=0] [L33] CALL __VERIFIER_assert( j < material_length ) VAL [\old(cond)=1] [L18] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L33] RET __VERIFIER_assert( j < material_length ) VAL [idBitLength=9, j=0, material_length=1, nlen=0] [L34] CALL __VERIFIER_assert( 0 <= j/4 ) VAL [\old(cond)=1] [L18] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L34] RET __VERIFIER_assert( 0 <= j/4 ) VAL [idBitLength=9, j=0, material_length=1, nlen=0] [L35] CALL __VERIFIER_assert( j/4 < nlen) VAL [\old(cond)=0] [L18] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 39 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2/2 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-27 21:38:06,909 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...